./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/special/msg_value_inheritance_3.sol_4_no_adts_000.smt2 .


--------------------------------------------------------------------------------


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:23:51,639 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:23:51,692 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eeda4e0-1ee5-4001-a85b-278e75129e6b/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:23:51,697 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:23:51,697 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:23:51,715 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:23:51,715 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:23:51,716 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:23:51,716 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:23:51,716 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:23:51,716 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:23:51,716 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:23:51,716 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:23:51,717 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:23:51,717 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:23:51,717 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:23:51,717 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:23:51,717 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:23:51,717 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:23:51,717 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:23:51,717 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:23:51,717 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:23:51,717 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:23:51,718 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:23:51,718 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:23:51,718 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:23:51,718 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:23:51,905 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:23:51,911 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:23:51,913 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:23:51,914 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:23:51,914 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:23:51,915 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eeda4e0-1ee5-4001-a85b-278e75129e6b/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/special/msg_value_inheritance_3.sol_4_no_adts_000.smt2
[2025-05-07 17:23:51,916 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:23:51,918 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:23:52,153 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8eeda4e0-1ee5-4001-a85b-278e75129e6b/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/special/msg_value_inheritance_3.sol_4_no_adts_000.smt2
[2025-05-07 17:23:52,155 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:23:52,156 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:23:52,157 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:23:52,157 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:23:52,157 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:23:52,159 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:23:52" (1/1) ...
[2025-05-07 17:23:52,186 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:52 Unit
[2025-05-07 17:23:52,187 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:23:52,187 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:23:52,187 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:23:52,187 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:23:52,198 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:52" (1/1) ...
[2025-05-07 17:23:52,198 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:52" (1/1) ...
[2025-05-07 17:23:52,220 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:52" (1/1) ...
[2025-05-07 17:23:52,220 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:52" (1/1) ...
[2025-05-07 17:23:52,225 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:52" (1/1) ...
[2025-05-07 17:23:52,226 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:52" (1/1) ...
[2025-05-07 17:23:52,227 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:52" (1/1) ...
[2025-05-07 17:23:52,230 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:52" (1/1) ...
[2025-05-07 17:23:52,231 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:52" (1/1) ...
[2025-05-07 17:23:52,242 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:23:52,242 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:23:52,242 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:23:52,242 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:23:52,243 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:52" (1/1) ...
[2025-05-07 17:23:52,245 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:23:52,254 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:23:52,262 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-05-07 17:23:52,264 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:23:52,272 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:23:52,272 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:23:52,272 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:23:52,273 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_7_0 given in one single declaration
[2025-05-07 17:23:52,273 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_7_0
[2025-05-07 17:23:52,273 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_7_0
[2025-05-07 17:23:52,273 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_10_C_47_0 given in one single declaration
[2025-05-07 17:23:52,273 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_10_C_47_0
[2025-05-07 17:23:52,273 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_10_C_47_0
[2025-05-07 17:23:52,273 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_34_C_47_0 given in one single declaration
[2025-05-07 17:23:52,273 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_34_C_47_0
[2025-05-07 17:23:52,273 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_34_C_47_0
[2025-05-07 17:23:52,273 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_36_C_47_0 given in one single declaration
[2025-05-07 17:23:52,273 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_36_C_47_0
[2025-05-07 17:23:52,273 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_36_C_47_0
[2025-05-07 17:23:52,273 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_35_C_47_0 given in one single declaration
[2025-05-07 17:23:52,274 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_35_C_47_0
[2025-05-07 17:23:52,274 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_35_C_47_0
[2025-05-07 17:23:52,274 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_13_constructor_46_47_0 given in one single declaration
[2025-05-07 17:23:52,274 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_13_constructor_46_47_0
[2025-05-07 17:23:52,274 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_13_constructor_46_47_0
[2025-05-07 17:23:52,274 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_33_constructor_46_47_0 given in one single declaration
[2025-05-07 17:23:52,274 INFO  L130     BoogieDeclarations]: Found specification of procedure block_33_constructor_46_47_0
[2025-05-07 17:23:52,274 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_33_constructor_46_47_0
[2025-05-07 17:23:52,274 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_31__45_47_0 given in one single declaration
[2025-05-07 17:23:52,274 INFO  L130     BoogieDeclarations]: Found specification of procedure block_31__45_47_0
[2025-05-07 17:23:52,274 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_31__45_47_0
[2025-05-07 17:23:52,274 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_30_constructor_46_47_0 given in one single declaration
[2025-05-07 17:23:52,275 INFO  L130     BoogieDeclarations]: Found specification of procedure block_30_constructor_46_47_0
[2025-05-07 17:23:52,275 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_30_constructor_46_47_0
[2025-05-07 17:23:52,275 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_32_return_constructor_46_47_0 given in one single declaration
[2025-05-07 17:23:52,275 INFO  L130     BoogieDeclarations]: Found specification of procedure block_32_return_constructor_46_47_0
[2025-05-07 17:23:52,275 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_32_return_constructor_46_47_0
[2025-05-07 17:23:52,275 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_51_C_47_0 given in one single declaration
[2025-05-07 17:23:52,275 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_51_C_47_0
[2025-05-07 17:23:52,275 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_51_C_47_0
[2025-05-07 17:23:52,275 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_41_B_27_0 given in one single declaration
[2025-05-07 17:23:52,275 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_41_B_27_0
[2025-05-07 17:23:52,275 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_41_B_27_0
[2025-05-07 17:23:52,275 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_43_B_27_0 given in one single declaration
[2025-05-07 17:23:52,275 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_43_B_27_0
[2025-05-07 17:23:52,275 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_43_B_27_0
[2025-05-07 17:23:52,275 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_42_B_27_0 given in one single declaration
[2025-05-07 17:23:52,276 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_42_B_27_0
[2025-05-07 17:23:52,276 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_42_B_27_0
[2025-05-07 17:23:52,276 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_12_constructor_26_47_0 given in one single declaration
[2025-05-07 17:23:52,276 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_12_constructor_26_47_0
[2025-05-07 17:23:52,276 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_12_constructor_26_47_0
[2025-05-07 17:23:52,276 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_40_constructor_26_47_0 given in one single declaration
[2025-05-07 17:23:52,276 INFO  L130     BoogieDeclarations]: Found specification of procedure block_40_constructor_26_47_0
[2025-05-07 17:23:52,276 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_40_constructor_26_47_0
[2025-05-07 17:23:52,276 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_38__25_47_0 given in one single declaration
[2025-05-07 17:23:52,276 INFO  L130     BoogieDeclarations]: Found specification of procedure block_38__25_47_0
[2025-05-07 17:23:52,276 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_38__25_47_0
[2025-05-07 17:23:52,276 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_37_constructor_26_47_0 given in one single declaration
[2025-05-07 17:23:52,276 INFO  L130     BoogieDeclarations]: Found specification of procedure block_37_constructor_26_47_0
[2025-05-07 17:23:52,276 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_37_constructor_26_47_0
[2025-05-07 17:23:52,277 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_39_return_constructor_26_47_0 given in one single declaration
[2025-05-07 17:23:52,277 INFO  L130     BoogieDeclarations]: Found specification of procedure block_39_return_constructor_26_47_0
[2025-05-07 17:23:52,277 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_39_return_constructor_26_47_0
[2025-05-07 17:23:52,277 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_48_A_15_0 given in one single declaration
[2025-05-07 17:23:52,277 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_48_A_15_0
[2025-05-07 17:23:52,277 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_48_A_15_0
[2025-05-07 17:23:52,277 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_50_A_15_0 given in one single declaration
[2025-05-07 17:23:52,277 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_50_A_15_0
[2025-05-07 17:23:52,277 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_50_A_15_0
[2025-05-07 17:23:52,277 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_49_A_15_0 given in one single declaration
[2025-05-07 17:23:52,277 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_49_A_15_0
[2025-05-07 17:23:52,277 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_49_A_15_0
[2025-05-07 17:23:52,277 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_11_constructor_14_47_0 given in one single declaration
[2025-05-07 17:23:52,277 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_11_constructor_14_47_0
[2025-05-07 17:23:52,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_11_constructor_14_47_0
[2025-05-07 17:23:52,278 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_46_return_constructor_14_47_0 given in one single declaration
[2025-05-07 17:23:52,278 INFO  L130     BoogieDeclarations]: Found specification of procedure block_46_return_constructor_14_47_0
[2025-05-07 17:23:52,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_46_return_constructor_14_47_0
[2025-05-07 17:23:52,278 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_45__13_47_0 given in one single declaration
[2025-05-07 17:23:52,278 INFO  L130     BoogieDeclarations]: Found specification of procedure block_45__13_47_0
[2025-05-07 17:23:52,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_45__13_47_0
[2025-05-07 17:23:52,278 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_44_constructor_14_47_0 given in one single declaration
[2025-05-07 17:23:52,278 INFO  L130     BoogieDeclarations]: Found specification of procedure block_44_constructor_14_47_0
[2025-05-07 17:23:52,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_44_constructor_14_47_0
[2025-05-07 17:23:52,278 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_47_constructor_14_47_0 given in one single declaration
[2025-05-07 17:23:52,278 INFO  L130     BoogieDeclarations]: Found specification of procedure block_47_constructor_14_47_0
[2025-05-07 17:23:52,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_47_constructor_14_47_0
[2025-05-07 17:23:52,278 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_6_B_27_0 given in one single declaration
[2025-05-07 17:23:52,278 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_6_B_27_0
[2025-05-07 17:23:52,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_6_B_27_0
[2025-05-07 17:23:52,279 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_29_B_27_0 given in one single declaration
[2025-05-07 17:23:52,279 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_29_B_27_0
[2025-05-07 17:23:52,279 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_29_B_27_0
[2025-05-07 17:23:52,279 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_26_B_27_0 given in one single declaration
[2025-05-07 17:23:52,279 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_26_B_27_0
[2025-05-07 17:23:52,279 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_26_B_27_0
[2025-05-07 17:23:52,279 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_28_B_27_0 given in one single declaration
[2025-05-07 17:23:52,279 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_28_B_27_0
[2025-05-07 17:23:52,279 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_28_B_27_0
[2025-05-07 17:23:52,279 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_27_B_27_0 given in one single declaration
[2025-05-07 17:23:52,279 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_27_B_27_0
[2025-05-07 17:23:52,279 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_27_B_27_0
[2025-05-07 17:23:52,279 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_7_constructor_26_27_0 given in one single declaration
[2025-05-07 17:23:52,279 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_7_constructor_26_27_0
[2025-05-07 17:23:52,279 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_7_constructor_26_27_0
[2025-05-07 17:23:52,279 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_25_constructor_26_27_0 given in one single declaration
[2025-05-07 17:23:52,279 INFO  L130     BoogieDeclarations]: Found specification of procedure block_25_constructor_26_27_0
[2025-05-07 17:23:52,279 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_25_constructor_26_27_0
[2025-05-07 17:23:52,279 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_23__25_27_0 given in one single declaration
[2025-05-07 17:23:52,279 INFO  L130     BoogieDeclarations]: Found specification of procedure block_23__25_27_0
[2025-05-07 17:23:52,279 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_23__25_27_0
[2025-05-07 17:23:52,279 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_22_constructor_26_27_0 given in one single declaration
[2025-05-07 17:23:52,279 INFO  L130     BoogieDeclarations]: Found specification of procedure block_22_constructor_26_27_0
[2025-05-07 17:23:52,279 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_22_constructor_26_27_0
[2025-05-07 17:23:52,280 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_24_return_constructor_26_27_0 given in one single declaration
[2025-05-07 17:23:52,280 INFO  L130     BoogieDeclarations]: Found specification of procedure block_24_return_constructor_26_27_0
[2025-05-07 17:23:52,280 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_24_return_constructor_26_27_0
[2025-05-07 17:23:52,280 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:23:52,280 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:23:52,280 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:23:52,439 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:23:52,441 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:23:52,701 INFO  L?                        ?]: Removed 305 outVars from TransFormulas that were not future-live.
[2025-05-07 17:23:52,701 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:23:52,710 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:23:52,711 INFO  L312             CfgBuilder]: Removed 16 assume(true) statements.
[2025-05-07 17:23:52,711 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:23:52 BoogieIcfgContainer
[2025-05-07 17:23:52,711 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:23:52,712 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:23:52,712 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:23:52,715 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:23:52,715 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:23:52" (1/3) ...
[2025-05-07 17:23:52,715 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a053ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:23:52, skipping insertion in model container
[2025-05-07 17:23:52,715 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:23:52" (2/3) ...
[2025-05-07 17:23:52,715 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a053ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:23:52, skipping insertion in model container
[2025-05-07 17:23:52,715 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:23:52" (3/3) ...
[2025-05-07 17:23:52,716 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:23:52,726 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:23:52,728 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 39 procedures, 163 locations, 259 edges, 39 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:23:52,755 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:23:52,763 INFO  L340      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6396789f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:23:52,763 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:23:52,765 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 163 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 76 states have internal predecessors, (76), 57 states have call successors, (61), 38 states have call predecessors, (61), 38 states have return successors, (61), 48 states have call predecessors, (61), 57 states have call successors, (61)
[2025-05-07 17:23:52,774 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:23:52,774 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:52,774 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:52,775 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:52,778 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:52,778 INFO  L85        PathProgramCache]: Analyzing trace with hash 399834201, now seen corresponding path program 1 times
[2025-05-07 17:23:52,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:52,783 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336203532]
[2025-05-07 17:23:52,783 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:52,784 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:52,816 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:23:52,834 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:23:52,834 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:52,834 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:52,971 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:52,971 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:52,971 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336203532]
[2025-05-07 17:23:52,972 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336203532] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:52,972 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:52,974 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:23:52,975 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808778571]
[2025-05-07 17:23:52,975 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:52,978 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:23:52,978 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:53,007 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:23:53,007 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:53,009 INFO  L87              Difference]: Start difference. First operand  has 163 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 76 states have internal predecessors, (76), 57 states have call successors, (61), 38 states have call predecessors, (61), 38 states have return successors, (61), 48 states have call predecessors, (61), 57 states have call successors, (61) Second operand  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:23:53,064 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:53,064 INFO  L93              Difference]: Finished difference Result 154 states and 182 transitions.
[2025-05-07 17:23:53,065 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:23:53,066 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 41
[2025-05-07 17:23:53,067 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:53,073 INFO  L225             Difference]: With dead ends: 154
[2025-05-07 17:23:53,073 INFO  L226             Difference]: Without dead ends: 147
[2025-05-07 17:23:53,074 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:53,076 INFO  L437           NwaCegarLoop]: 182 mSDtfsCounter, 1 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:53,077 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 535 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:23:53,087 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 147 states.
[2025-05-07 17:23:53,106 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147.
[2025-05-07 17:23:53,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 147 states, 59 states have (on average 1.1355932203389831) internal successors, (67), 67 states have internal predecessors, (67), 52 states have call successors, (53), 35 states have call predecessors, (53), 35 states have return successors, (53), 44 states have call predecessors, (53), 52 states have call successors, (53)
[2025-05-07 17:23:53,111 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 173 transitions.
[2025-05-07 17:23:53,111 INFO  L79                 Accepts]: Start accepts. Automaton has 147 states and 173 transitions. Word has length 41
[2025-05-07 17:23:53,112 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:53,112 INFO  L485      AbstractCegarLoop]: Abstraction has 147 states and 173 transitions.
[2025-05-07 17:23:53,112 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:23:53,112 INFO  L278                IsEmpty]: Start isEmpty. Operand 147 states and 173 transitions.
[2025-05-07 17:23:53,113 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:23:53,114 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:53,114 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:53,114 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:23:53,114 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:53,114 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:53,115 INFO  L85        PathProgramCache]: Analyzing trace with hash 1618134295, now seen corresponding path program 1 times
[2025-05-07 17:23:53,115 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:53,115 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460198088]
[2025-05-07 17:23:53,115 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:53,115 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:53,137 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:23:53,147 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:23:53,147 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:53,148 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:53,232 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:53,232 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:53,233 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460198088]
[2025-05-07 17:23:53,233 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460198088] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:53,233 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:53,233 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:23:53,233 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081382360]
[2025-05-07 17:23:53,233 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:53,234 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:23:53,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:53,234 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:23:53,234 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:53,234 INFO  L87              Difference]: Start difference. First operand 147 states and 173 transitions. Second operand  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:23:53,260 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:53,260 INFO  L93              Difference]: Finished difference Result 149 states and 174 transitions.
[2025-05-07 17:23:53,261 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:23:53,261 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 41
[2025-05-07 17:23:53,261 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:53,262 INFO  L225             Difference]: With dead ends: 149
[2025-05-07 17:23:53,262 INFO  L226             Difference]: Without dead ends: 145
[2025-05-07 17:23:53,262 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:53,263 INFO  L437           NwaCegarLoop]: 172 mSDtfsCounter, 1 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:53,263 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 506 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:23:53,264 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2025-05-07 17:23:53,271 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145.
[2025-05-07 17:23:53,271 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 145 states, 59 states have (on average 1.11864406779661) internal successors, (66), 66 states have internal predecessors, (66), 50 states have call successors, (51), 35 states have call predecessors, (51), 35 states have return successors, (51), 43 states have call predecessors, (51), 50 states have call successors, (51)
[2025-05-07 17:23:53,272 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 168 transitions.
[2025-05-07 17:23:53,272 INFO  L79                 Accepts]: Start accepts. Automaton has 145 states and 168 transitions. Word has length 41
[2025-05-07 17:23:53,273 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:53,273 INFO  L485      AbstractCegarLoop]: Abstraction has 145 states and 168 transitions.
[2025-05-07 17:23:53,273 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:23:53,273 INFO  L278                IsEmpty]: Start isEmpty. Operand 145 states and 168 transitions.
[2025-05-07 17:23:53,274 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:23:53,274 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:53,274 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:53,274 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:23:53,274 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:53,275 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:53,275 INFO  L85        PathProgramCache]: Analyzing trace with hash 2016305051, now seen corresponding path program 1 times
[2025-05-07 17:23:53,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:53,275 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200884473]
[2025-05-07 17:23:53,275 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:53,275 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:53,293 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:23:53,307 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:23:53,307 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:53,307 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:53,388 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:53,388 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:53,388 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200884473]
[2025-05-07 17:23:53,388 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200884473] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:53,388 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:53,388 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:23:53,388 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076937645]
[2025-05-07 17:23:53,388 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:53,389 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:23:53,389 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:53,389 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:23:53,389 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:23:53,389 INFO  L87              Difference]: Start difference. First operand 145 states and 168 transitions. Second operand  has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11)
[2025-05-07 17:23:53,439 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:53,439 INFO  L93              Difference]: Finished difference Result 130 states and 152 transitions.
[2025-05-07 17:23:53,440 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:23:53,440 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 41
[2025-05-07 17:23:53,440 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:53,441 INFO  L225             Difference]: With dead ends: 130
[2025-05-07 17:23:53,441 INFO  L226             Difference]: Without dead ends: 112
[2025-05-07 17:23:53,441 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:23:53,442 INFO  L437           NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:53,442 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 886 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:23:53,442 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 112 states.
[2025-05-07 17:23:53,447 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112.
[2025-05-07 17:23:53,447 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 112 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 50 states have internal predecessors, (50), 41 states have call successors, (42), 26 states have call predecessors, (42), 26 states have return successors, (42), 35 states have call predecessors, (42), 41 states have call successors, (42)
[2025-05-07 17:23:53,448 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions.
[2025-05-07 17:23:53,448 INFO  L79                 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 41
[2025-05-07 17:23:53,448 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:53,448 INFO  L485      AbstractCegarLoop]: Abstraction has 112 states and 134 transitions.
[2025-05-07 17:23:53,448 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 3.8) internal successors, (19), 7 states have internal predecessors, (19), 5 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11)
[2025-05-07 17:23:53,448 INFO  L278                IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions.
[2025-05-07 17:23:53,449 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2025-05-07 17:23:53,449 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:53,449 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:53,449 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:23:53,449 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:53,450 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:53,450 INFO  L85        PathProgramCache]: Analyzing trace with hash 513610733, now seen corresponding path program 1 times
[2025-05-07 17:23:53,450 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:53,450 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324849816]
[2025-05-07 17:23:53,450 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:53,450 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:53,466 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes.
[2025-05-07 17:23:53,477 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements.
[2025-05-07 17:23:53,477 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:53,477 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:53,552 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:53,552 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:53,552 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324849816]
[2025-05-07 17:23:53,552 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324849816] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:53,552 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:53,552 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:23:53,552 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589381934]
[2025-05-07 17:23:53,552 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:53,553 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:23:53,553 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:53,553 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:23:53,553 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:23:53,554 INFO  L87              Difference]: Start difference. First operand 112 states and 134 transitions. Second operand  has 7 states, 5 states have (on average 4.0) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11)
[2025-05-07 17:23:53,648 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:53,648 INFO  L93              Difference]: Finished difference Result 116 states and 141 transitions.
[2025-05-07 17:23:53,649 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:23:53,649 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 4.0) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 42
[2025-05-07 17:23:53,649 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:53,650 INFO  L225             Difference]: With dead ends: 116
[2025-05-07 17:23:53,650 INFO  L226             Difference]: Without dead ends: 116
[2025-05-07 17:23:53,650 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:23:53,651 INFO  L437           NwaCegarLoop]: 133 mSDtfsCounter, 2 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:53,651 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 775 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:23:53,652 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2025-05-07 17:23:53,657 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114.
[2025-05-07 17:23:53,658 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 114 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 51 states have internal predecessors, (51), 41 states have call successors, (42), 26 states have call predecessors, (42), 27 states have return successors, (43), 36 states have call predecessors, (43), 41 states have call successors, (43)
[2025-05-07 17:23:53,659 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 136 transitions.
[2025-05-07 17:23:53,659 INFO  L79                 Accepts]: Start accepts. Automaton has 114 states and 136 transitions. Word has length 42
[2025-05-07 17:23:53,659 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:53,659 INFO  L485      AbstractCegarLoop]: Abstraction has 114 states and 136 transitions.
[2025-05-07 17:23:53,660 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 4.0) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11)
[2025-05-07 17:23:53,660 INFO  L278                IsEmpty]: Start isEmpty. Operand 114 states and 136 transitions.
[2025-05-07 17:23:53,660 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2025-05-07 17:23:53,660 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:53,660 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:53,660 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:23:53,661 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:53,661 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:53,661 INFO  L85        PathProgramCache]: Analyzing trace with hash 296744433, now seen corresponding path program 1 times
[2025-05-07 17:23:53,661 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:53,661 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799936644]
[2025-05-07 17:23:53,661 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:53,661 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:53,675 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes.
[2025-05-07 17:23:53,683 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements.
[2025-05-07 17:23:53,684 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:53,684 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:53,762 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:53,762 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:53,762 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799936644]
[2025-05-07 17:23:53,762 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799936644] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:53,763 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:53,763 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:23:53,763 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688032010]
[2025-05-07 17:23:53,763 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:53,763 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:23:53,763 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:53,764 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:23:53,764 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:23:53,764 INFO  L87              Difference]: Start difference. First operand 114 states and 136 transitions. Second operand  has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11)
[2025-05-07 17:23:53,834 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:53,834 INFO  L93              Difference]: Finished difference Result 120 states and 146 transitions.
[2025-05-07 17:23:53,834 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:23:53,834 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 42
[2025-05-07 17:23:53,834 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:53,835 INFO  L225             Difference]: With dead ends: 120
[2025-05-07 17:23:53,835 INFO  L226             Difference]: Without dead ends: 117
[2025-05-07 17:23:53,835 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:23:53,836 INFO  L437           NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:53,836 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 765 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:23:53,836 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2025-05-07 17:23:53,841 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117.
[2025-05-07 17:23:53,842 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 117 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 52 states have internal predecessors, (52), 42 states have call successors, (43), 26 states have call predecessors, (43), 28 states have return successors, (47), 38 states have call predecessors, (47), 42 states have call successors, (47)
[2025-05-07 17:23:53,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions.
[2025-05-07 17:23:53,842 INFO  L79                 Accepts]: Start accepts. Automaton has 117 states and 142 transitions. Word has length 42
[2025-05-07 17:23:53,843 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:53,843 INFO  L485      AbstractCegarLoop]: Abstraction has 117 states and 142 transitions.
[2025-05-07 17:23:53,843 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (11), 1 states have call predecessors, (11), 6 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11)
[2025-05-07 17:23:53,843 INFO  L278                IsEmpty]: Start isEmpty. Operand 117 states and 142 transitions.
[2025-05-07 17:23:53,843 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2025-05-07 17:23:53,843 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:53,844 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:53,844 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:23:53,844 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:53,844 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:53,844 INFO  L85        PathProgramCache]: Analyzing trace with hash -565490575, now seen corresponding path program 1 times
[2025-05-07 17:23:53,844 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:53,844 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808911790]
[2025-05-07 17:23:53,844 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:53,844 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:53,857 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes.
[2025-05-07 17:23:53,860 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements.
[2025-05-07 17:23:53,860 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:53,860 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:53,889 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:53,889 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:53,889 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808911790]
[2025-05-07 17:23:53,890 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808911790] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:53,890 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:53,890 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:23:53,890 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88533758]
[2025-05-07 17:23:53,890 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:53,890 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:23:53,890 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:53,890 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:23:53,890 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:53,891 INFO  L87              Difference]: Start difference. First operand 117 states and 142 transitions. Second operand  has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:23:53,925 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:53,926 INFO  L93              Difference]: Finished difference Result 120 states and 145 transitions.
[2025-05-07 17:23:53,926 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:23:53,926 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 42
[2025-05-07 17:23:53,927 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:53,928 INFO  L225             Difference]: With dead ends: 120
[2025-05-07 17:23:53,928 INFO  L226             Difference]: Without dead ends: 119
[2025-05-07 17:23:53,928 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:53,928 INFO  L437           NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:53,929 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 363 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:23:53,929 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 119 states.
[2025-05-07 17:23:53,936 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 112.
[2025-05-07 17:23:53,936 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 112 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 50 states have internal predecessors, (50), 39 states have call successors, (40), 26 states have call predecessors, (40), 27 states have return successors, (41), 35 states have call predecessors, (41), 39 states have call successors, (41)
[2025-05-07 17:23:53,937 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 131 transitions.
[2025-05-07 17:23:53,938 INFO  L79                 Accepts]: Start accepts. Automaton has 112 states and 131 transitions. Word has length 42
[2025-05-07 17:23:53,938 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:53,938 INFO  L485      AbstractCegarLoop]: Abstraction has 112 states and 131 transitions.
[2025-05-07 17:23:53,938 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11)
[2025-05-07 17:23:53,938 INFO  L278                IsEmpty]: Start isEmpty. Operand 112 states and 131 transitions.
[2025-05-07 17:23:53,939 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2025-05-07 17:23:53,939 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:53,939 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:53,939 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:23:53,939 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:53,940 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:53,940 INFO  L85        PathProgramCache]: Analyzing trace with hash 169169323, now seen corresponding path program 1 times
[2025-05-07 17:23:53,940 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:53,940 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061638780]
[2025-05-07 17:23:53,940 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:53,940 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:53,965 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes.
[2025-05-07 17:23:53,972 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements.
[2025-05-07 17:23:53,972 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:53,972 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:54,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:54,015 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:54,016 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061638780]
[2025-05-07 17:23:54,016 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061638780] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:54,016 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:54,016 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:23:54,016 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103366750]
[2025-05-07 17:23:54,016 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:54,016 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:23:54,016 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:54,017 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:23:54,017 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:54,017 INFO  L87              Difference]: Start difference. First operand 112 states and 131 transitions. Second operand  has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18)
[2025-05-07 17:23:54,045 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:54,045 INFO  L93              Difference]: Finished difference Result 116 states and 136 transitions.
[2025-05-07 17:23:54,046 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:23:54,046 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 67
[2025-05-07 17:23:54,046 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:54,047 INFO  L225             Difference]: With dead ends: 116
[2025-05-07 17:23:54,047 INFO  L226             Difference]: Without dead ends: 116
[2025-05-07 17:23:54,047 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:54,048 INFO  L437           NwaCegarLoop]: 131 mSDtfsCounter, 1 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:54,048 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 373 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:23:54,048 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2025-05-07 17:23:54,052 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114.
[2025-05-07 17:23:54,052 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 114 states, 46 states have (on average 1.108695652173913) internal successors, (51), 51 states have internal predecessors, (51), 39 states have call successors, (40), 26 states have call predecessors, (40), 28 states have return successors, (43), 36 states have call predecessors, (43), 39 states have call successors, (43)
[2025-05-07 17:23:54,053 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions.
[2025-05-07 17:23:54,053 INFO  L79                 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 67
[2025-05-07 17:23:54,053 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:54,053 INFO  L485      AbstractCegarLoop]: Abstraction has 114 states and 134 transitions.
[2025-05-07 17:23:54,053 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 3 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18)
[2025-05-07 17:23:54,053 INFO  L278                IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions.
[2025-05-07 17:23:54,054 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2025-05-07 17:23:54,054 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:54,054 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:54,054 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:23:54,054 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:54,055 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:54,055 INFO  L85        PathProgramCache]: Analyzing trace with hash 797253027, now seen corresponding path program 1 times
[2025-05-07 17:23:54,055 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:54,055 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699124322]
[2025-05-07 17:23:54,055 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:54,055 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:54,078 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes.
[2025-05-07 17:23:54,088 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements.
[2025-05-07 17:23:54,088 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:54,088 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:54,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:54,140 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:54,140 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699124322]
[2025-05-07 17:23:54,140 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699124322] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:54,140 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:54,140 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:23:54,140 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874690873]
[2025-05-07 17:23:54,140 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:54,141 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:23:54,141 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:54,141 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:23:54,141 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:23:54,142 INFO  L87              Difference]: Start difference. First operand 114 states and 134 transitions. Second operand  has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (18), 1 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:23:54,182 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:54,183 INFO  L93              Difference]: Finished difference Result 116 states and 137 transitions.
[2025-05-07 17:23:54,183 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:23:54,183 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (18), 1 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 67
[2025-05-07 17:23:54,183 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:54,184 INFO  L225             Difference]: With dead ends: 116
[2025-05-07 17:23:54,184 INFO  L226             Difference]: Without dead ends: 116
[2025-05-07 17:23:54,184 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:23:54,185 INFO  L437           NwaCegarLoop]: 125 mSDtfsCounter, 1 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:54,185 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 486 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:23:54,185 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2025-05-07 17:23:54,188 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114.
[2025-05-07 17:23:54,189 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 114 states, 46 states have (on average 1.108695652173913) internal successors, (51), 51 states have internal predecessors, (51), 39 states have call successors, (40), 26 states have call predecessors, (40), 28 states have return successors, (42), 36 states have call predecessors, (42), 39 states have call successors, (42)
[2025-05-07 17:23:54,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 133 transitions.
[2025-05-07 17:23:54,189 INFO  L79                 Accepts]: Start accepts. Automaton has 114 states and 133 transitions. Word has length 67
[2025-05-07 17:23:54,190 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:54,190 INFO  L485      AbstractCegarLoop]: Abstraction has 114 states and 133 transitions.
[2025-05-07 17:23:54,190 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 4 states have call successors, (18), 1 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:23:54,190 INFO  L278                IsEmpty]: Start isEmpty. Operand 114 states and 133 transitions.
[2025-05-07 17:23:54,190 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2025-05-07 17:23:54,190 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:54,191 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:54,191 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:23:54,191 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:54,191 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:54,191 INFO  L85        PathProgramCache]: Analyzing trace with hash 413932455, now seen corresponding path program 1 times
[2025-05-07 17:23:54,191 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:54,191 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438279585]
[2025-05-07 17:23:54,191 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:54,191 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:54,212 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes.
[2025-05-07 17:23:54,216 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements.
[2025-05-07 17:23:54,216 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:54,216 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:54,262 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:54,262 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:54,262 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438279585]
[2025-05-07 17:23:54,262 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438279585] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:54,262 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:54,262 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:23:54,262 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897878306]
[2025-05-07 17:23:54,262 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:54,263 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:23:54,263 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:54,263 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:23:54,263 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:54,263 INFO  L87              Difference]: Start difference. First operand 114 states and 133 transitions. Second operand  has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:23:54,284 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:54,284 INFO  L93              Difference]: Finished difference Result 116 states and 136 transitions.
[2025-05-07 17:23:54,285 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:23:54,285 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 67
[2025-05-07 17:23:54,285 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:54,286 INFO  L225             Difference]: With dead ends: 116
[2025-05-07 17:23:54,286 INFO  L226             Difference]: Without dead ends: 116
[2025-05-07 17:23:54,286 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:54,286 INFO  L437           NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:54,287 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 367 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:23:54,287 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 116 states.
[2025-05-07 17:23:54,290 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116.
[2025-05-07 17:23:54,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 116 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 52 states have internal predecessors, (52), 39 states have call successors, (40), 26 states have call predecessors, (40), 29 states have return successors, (44), 37 states have call predecessors, (44), 39 states have call successors, (44)
[2025-05-07 17:23:54,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 136 transitions.
[2025-05-07 17:23:54,291 INFO  L79                 Accepts]: Start accepts. Automaton has 116 states and 136 transitions. Word has length 67
[2025-05-07 17:23:54,292 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:54,292 INFO  L485      AbstractCegarLoop]: Abstraction has 116 states and 136 transitions.
[2025-05-07 17:23:54,292 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 4 states have call successors, (18), 1 states have call predecessors, (18), 3 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18)
[2025-05-07 17:23:54,292 INFO  L278                IsEmpty]: Start isEmpty. Operand 116 states and 136 transitions.
[2025-05-07 17:23:54,293 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2025-05-07 17:23:54,293 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:54,293 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:54,293 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:23:54,293 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:54,293 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:54,293 INFO  L85        PathProgramCache]: Analyzing trace with hash -92285657, now seen corresponding path program 1 times
[2025-05-07 17:23:54,294 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:54,294 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651695161]
[2025-05-07 17:23:54,294 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:54,294 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:54,314 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes.
[2025-05-07 17:23:54,323 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements.
[2025-05-07 17:23:54,323 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:54,323 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:54,392 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:54,392 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:54,392 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651695161]
[2025-05-07 17:23:54,392 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651695161] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:54,392 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:54,393 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:23:54,393 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976255591]
[2025-05-07 17:23:54,393 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:54,393 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:23:54,393 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:54,394 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:23:54,394 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:23:54,394 INFO  L87              Difference]: Start difference. First operand 116 states and 136 transitions. Second operand  has 7 states, 5 states have (on average 6.2) internal successors, (31), 7 states have internal predecessors, (31), 5 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18)
[2025-05-07 17:23:54,438 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:54,438 INFO  L93              Difference]: Finished difference Result 113 states and 129 transitions.
[2025-05-07 17:23:54,438 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:23:54,438 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 6.2) internal successors, (31), 7 states have internal predecessors, (31), 5 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 67
[2025-05-07 17:23:54,438 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:54,439 INFO  L225             Difference]: With dead ends: 113
[2025-05-07 17:23:54,439 INFO  L226             Difference]: Without dead ends: 109
[2025-05-07 17:23:54,439 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:23:54,440 INFO  L437           NwaCegarLoop]: 122 mSDtfsCounter, 1 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:54,440 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 714 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:23:54,440 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 109 states.
[2025-05-07 17:23:54,442 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107.
[2025-05-07 17:23:54,443 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 107 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 48 states have internal predecessors, (48), 34 states have call successors, (35), 26 states have call predecessors, (35), 27 states have return successors, (35), 32 states have call predecessors, (35), 34 states have call successors, (35)
[2025-05-07 17:23:54,443 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions.
[2025-05-07 17:23:54,443 INFO  L79                 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 67
[2025-05-07 17:23:54,443 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:54,443 INFO  L485      AbstractCegarLoop]: Abstraction has 107 states and 118 transitions.
[2025-05-07 17:23:54,443 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 6.2) internal successors, (31), 7 states have internal predecessors, (31), 5 states have call successors, (18), 1 states have call predecessors, (18), 5 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18)
[2025-05-07 17:23:54,444 INFO  L278                IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions.
[2025-05-07 17:23:54,445 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-05-07 17:23:54,445 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:54,445 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:54,445 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:23:54,445 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:54,445 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:54,445 INFO  L85        PathProgramCache]: Analyzing trace with hash -1916505248, now seen corresponding path program 1 times
[2025-05-07 17:23:54,445 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:54,446 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938494173]
[2025-05-07 17:23:54,446 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:54,446 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:54,472 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-05-07 17:23:54,475 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-05-07 17:23:54,475 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:54,475 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:54,519 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:54,519 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:54,520 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938494173]
[2025-05-07 17:23:54,520 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938494173] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:54,520 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:54,520 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:23:54,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446438581]
[2025-05-07 17:23:54,520 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:54,520 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:23:54,520 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:54,521 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:23:54,521 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:54,521 INFO  L87              Difference]: Start difference. First operand 107 states and 118 transitions. Second operand  has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:23:54,534 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:54,534 INFO  L93              Difference]: Finished difference Result 109 states and 119 transitions.
[2025-05-07 17:23:54,534 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:23:54,534 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) Word has length 92
[2025-05-07 17:23:54,535 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:54,535 INFO  L225             Difference]: With dead ends: 109
[2025-05-07 17:23:54,535 INFO  L226             Difference]: Without dead ends: 99
[2025-05-07 17:23:54,535 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:54,536 INFO  L437           NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:54,536 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 336 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:23:54,536 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 99 states.
[2025-05-07 17:23:54,538 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99.
[2025-05-07 17:23:54,538 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 99 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 44 states have internal predecessors, (44), 31 states have call successors, (31), 25 states have call predecessors, (31), 25 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31)
[2025-05-07 17:23:54,539 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions.
[2025-05-07 17:23:54,539 INFO  L79                 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 92
[2025-05-07 17:23:54,539 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:54,539 INFO  L485      AbstractCegarLoop]: Abstraction has 99 states and 106 transitions.
[2025-05-07 17:23:54,539 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 4 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:23:54,539 INFO  L278                IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions.
[2025-05-07 17:23:54,540 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-05-07 17:23:54,540 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:54,540 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:54,540 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:23:54,541 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:54,541 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:54,541 INFO  L85        PathProgramCache]: Analyzing trace with hash -978689254, now seen corresponding path program 1 times
[2025-05-07 17:23:54,541 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:54,541 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678164607]
[2025-05-07 17:23:54,541 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:54,541 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:54,562 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-05-07 17:23:54,564 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-05-07 17:23:54,564 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:54,564 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:54,613 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:54,613 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:54,613 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678164607]
[2025-05-07 17:23:54,613 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678164607] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:54,613 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:54,614 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:23:54,614 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080039879]
[2025-05-07 17:23:54,614 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:54,614 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:23:54,614 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:54,615 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:23:54,615 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:54,615 INFO  L87              Difference]: Start difference. First operand 99 states and 106 transitions. Second operand  has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25)
[2025-05-07 17:23:54,620 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:54,621 INFO  L93              Difference]: Finished difference Result 101 states and 107 transitions.
[2025-05-07 17:23:54,621 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:23:54,621 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25) Word has length 92
[2025-05-07 17:23:54,621 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:54,622 INFO  L225             Difference]: With dead ends: 101
[2025-05-07 17:23:54,622 INFO  L226             Difference]: Without dead ends: 95
[2025-05-07 17:23:54,622 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:54,622 INFO  L437           NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:54,623 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 308 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:23:54,623 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2025-05-07 17:23:54,624 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95.
[2025-05-07 17:23:54,625 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 95 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 states have internal predecessors, (43), 27 states have call successors, (27), 25 states have call predecessors, (27), 25 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27)
[2025-05-07 17:23:54,625 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions.
[2025-05-07 17:23:54,625 INFO  L79                 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 92
[2025-05-07 17:23:54,625 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:54,625 INFO  L485      AbstractCegarLoop]: Abstraction has 95 states and 97 transitions.
[2025-05-07 17:23:54,625 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 3 states have call successors, (25)
[2025-05-07 17:23:54,625 INFO  L278                IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions.
[2025-05-07 17:23:54,626 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-05-07 17:23:54,626 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:54,626 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:54,627 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-05-07 17:23:54,627 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:54,627 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:54,627 INFO  L85        PathProgramCache]: Analyzing trace with hash -812143268, now seen corresponding path program 1 times
[2025-05-07 17:23:54,627 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:54,627 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279536343]
[2025-05-07 17:23:54,627 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:54,627 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:54,652 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-05-07 17:23:54,664 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-05-07 17:23:54,664 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:54,664 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:54,757 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:54,757 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:54,757 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279536343]
[2025-05-07 17:23:54,757 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279536343] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:54,757 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:54,758 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:23:54,758 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049727942]
[2025-05-07 17:23:54,758 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:54,758 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:23:54,758 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:54,758 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:23:54,759 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:23:54,759 INFO  L87              Difference]: Start difference. First operand 95 states and 97 transitions. Second operand  has 7 states, 5 states have (on average 8.4) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:23:54,799 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:54,799 INFO  L93              Difference]: Finished difference Result 94 states and 94 transitions.
[2025-05-07 17:23:54,800 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:23:54,800 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 8.4) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 92
[2025-05-07 17:23:54,800 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:54,801 INFO  L225             Difference]: With dead ends: 94
[2025-05-07 17:23:54,801 INFO  L226             Difference]: Without dead ends: 93
[2025-05-07 17:23:54,801 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:23:54,802 INFO  L437           NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:54,802 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 530 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:23:54,802 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2025-05-07 17:23:54,805 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93.
[2025-05-07 17:23:54,805 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 93 states, 42 states have (on average 1.0) internal successors, (42), 42 states have internal predecessors, (42), 25 states have call successors, (25), 25 states have call predecessors, (25), 25 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25)
[2025-05-07 17:23:54,806 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 92 transitions.
[2025-05-07 17:23:54,806 INFO  L79                 Accepts]: Start accepts. Automaton has 93 states and 92 transitions. Word has length 92
[2025-05-07 17:23:54,806 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:54,806 INFO  L485      AbstractCegarLoop]: Abstraction has 93 states and 92 transitions.
[2025-05-07 17:23:54,806 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 8.4) internal successors, (42), 7 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:23:54,806 INFO  L278                IsEmpty]: Start isEmpty. Operand 93 states and 92 transitions.
[2025-05-07 17:23:54,807 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-05-07 17:23:54,807 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:23:54,807 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:54,807 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-05-07 17:23:54,807 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:23:54,808 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:23:54,808 INFO  L85        PathProgramCache]: Analyzing trace with hash -550688288, now seen corresponding path program 1 times
[2025-05-07 17:23:54,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:23:54,808 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097636618]
[2025-05-07 17:23:54,808 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:23:54,808 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:23:54,840 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-05-07 17:23:54,856 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-05-07 17:23:54,856 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:23:54,856 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:23:54,914 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:23:54,914 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:23:54,914 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097636618]
[2025-05-07 17:23:54,914 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097636618] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:23:54,914 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:23:54,914 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:23:54,914 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469789658]
[2025-05-07 17:23:54,914 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:23:54,914 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:23:54,914 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:23:54,915 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:23:54,915 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:54,915 INFO  L87              Difference]: Start difference. First operand 93 states and 92 transitions. Second operand  has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25)
[2025-05-07 17:23:54,920 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:23:54,920 INFO  L93              Difference]: Finished difference Result 85 states and 84 transitions.
[2025-05-07 17:23:54,921 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:23:54,921 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25) Word has length 92
[2025-05-07 17:23:54,921 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:23:54,921 INFO  L225             Difference]: With dead ends: 85
[2025-05-07 17:23:54,921 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:23:54,921 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:23:54,922 INFO  L437           NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:23:54,922 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:23:54,922 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:23:54,922 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:23:54,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-05-07 17:23:54,922 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:23:54,922 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92
[2025-05-07 17:23:54,922 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:23:54,922 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:23:54,923 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (25), 1 states have call predecessors, (25), 3 states have return successors, (25), 4 states have call predecessors, (25), 3 states have call successors, (25)
[2025-05-07 17:23:54,923 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:23:54,923 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:23:54,924 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:23:54,925 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-05-07 17:23:54,927 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:23:54,929 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:23:54,931 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:23:54 BoogieIcfgContainer
[2025-05-07 17:23:54,931 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:23:54,931 INFO  L158              Benchmark]: Toolchain (without parser) took 2775.18ms. Allocated memory is still 234.9MB. Free memory was 144.1MB in the beginning and 177.7MB in the end (delta: -33.7MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:23:54,931 INFO  L158              Benchmark]: SmtParser took 0.21ms. Allocated memory is still 234.9MB. Free memory is still 174.0MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:23:54,931 INFO  L158              Benchmark]: ChcToBoogie took 30.23ms. Allocated memory is still 234.9MB. Free memory was 144.1MB in the beginning and 140.8MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:23:54,932 INFO  L158              Benchmark]: Boogie Preprocessor took 54.74ms. Allocated memory is still 234.9MB. Free memory was 140.8MB in the beginning and 137.1MB in the end (delta: 3.7MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-05-07 17:23:54,932 INFO  L158              Benchmark]: RCFGBuilder took 468.59ms. Allocated memory is still 234.9MB. Free memory was 137.0MB in the beginning and 159.3MB in the end (delta: -22.3MB). Peak memory consumption was 26.3MB. Max. memory is 33.6GB.
[2025-05-07 17:23:54,932 INFO  L158              Benchmark]: TraceAbstraction took 2218.64ms. Allocated memory is still 234.9MB. Free memory was 158.7MB in the beginning and 177.7MB in the end (delta: -19.0MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:23:54,933 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.21ms. Allocated memory is still 234.9MB. Free memory is still 174.0MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 30.23ms. Allocated memory is still 234.9MB. Free memory was 144.1MB in the beginning and 140.8MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 54.74ms. Allocated memory is still 234.9MB. Free memory was 140.8MB in the beginning and 137.1MB in the end (delta: 3.7MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * RCFGBuilder took 468.59ms. Allocated memory is still 234.9MB. Free memory was 137.0MB in the beginning and 159.3MB in the end (delta: -22.3MB). Peak memory consumption was 26.3MB. Max. memory is 33.6GB.
 * TraceAbstraction took 2218.64ms. Allocated memory is still 234.9MB. Free memory was 158.7MB in the beginning and 177.7MB in the end (delta: -19.0MB). There was no memory consumed. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Unknown line] : the set of constraint Horn clauses is satisfiable
    For all program executions holds that the set of constraint Horn clauses is satisfiable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 39 procedures, 163 locations, 259 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 7186 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5384 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 1802 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=163occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 885 NumberOfCodeBlocks, 885 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 871 ConstructedInterpolants, 0 QuantifiedInterpolants, 1075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-05-07 17:23:54,944 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
sat
