./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/modifiers/modifier_overriding_1.sol_1_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:29:17,492 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:29:17,543 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab99bca0-d63b-414a-b53b-a727b6a84bd9/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:29:17,547 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:29:17,547 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:29:17,565 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:29:17,566 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:29:17,566 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:29:17,566 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:29:17,566 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:29:17,567 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:29:17,567 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:29:17,567 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:29:17,567 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:29:17,567 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:29:17,567 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:29:17,567 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:29:17,567 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:29:17,567 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:29:17,568 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:29:17,568 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:29:17,568 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:29:17,568 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:29:17,568 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:29:17,568 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:29:17,569 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:29:17,569 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:29:17,745 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:29:17,752 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:29:17,754 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:29:17,754 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:29:17,755 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:29:17,756 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab99bca0-d63b-414a-b53b-a727b6a84bd9/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/modifiers/modifier_overriding_1.sol_1_no_adts_000.smt2
[2025-05-07 17:29:17,757 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:29:17,759 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:29:17,993 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab99bca0-d63b-414a-b53b-a727b6a84bd9/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/modifiers/modifier_overriding_1.sol_1_no_adts_000.smt2
[2025-05-07 17:29:17,996 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:29:17,997 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:29:17,997 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:29:17,998 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:29:17,998 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:29:18,000 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:18,030 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:18 Unit
[2025-05-07 17:29:18,030 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:29:18,031 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:29:18,031 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:29:18,031 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:29:18,042 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:18" (1/1) ...
[2025-05-07 17:29:18,042 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:18" (1/1) ...
[2025-05-07 17:29:18,064 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:18" (1/1) ...
[2025-05-07 17:29:18,064 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:18" (1/1) ...
[2025-05-07 17:29:18,068 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:18" (1/1) ...
[2025-05-07 17:29:18,069 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:18" (1/1) ...
[2025-05-07 17:29:18,070 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:18" (1/1) ...
[2025-05-07 17:29:18,072 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:18" (1/1) ...
[2025-05-07 17:29:18,073 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:18" (1/1) ...
[2025-05-07 17:29:18,083 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:29:18,084 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:29:18,084 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:29:18,084 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:29:18,085 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:18" (1/1) ...
[2025-05-07 17:29:18,086 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:29:18,094 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:18,103 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:29:18,106 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:29:18,114 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:29:18,114 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:29:18,114 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:29:18,114 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_5_0 given in one single declaration
[2025-05-07 17:29:18,114 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_5_0
[2025-05-07 17:29:18,114 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_5_0
[2025-05-07 17:29:18,114 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_9_function_f__9_52_0 given in one single declaration
[2025-05-07 17:29:18,114 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_9_function_f__9_52_0
[2025-05-07 17:29:18,114 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_9_function_f__9_52_0
[2025-05-07 17:29:18,114 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_25_function_f__9_52_0 given in one single declaration
[2025-05-07 17:29:18,115 INFO  L130     BoogieDeclarations]: Found specification of procedure block_25_function_f__9_52_0
[2025-05-07 17:29:18,115 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_25_function_f__9_52_0
[2025-05-07 17:29:18,115 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_8_function_f__9_52_0 given in one single declaration
[2025-05-07 17:29:18,115 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_8_function_f__9_52_0
[2025-05-07 17:29:18,115 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_8_function_f__9_52_0
[2025-05-07 17:29:18,115 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_23_function_f__9_52_0 given in one single declaration
[2025-05-07 17:29:18,115 INFO  L130     BoogieDeclarations]: Found specification of procedure block_23_function_f__9_52_0
[2025-05-07 17:29:18,115 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_23_function_f__9_52_0
[2025-05-07 17:29:18,115 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_22_return_function_f__9_52_0 given in one single declaration
[2025-05-07 17:29:18,115 INFO  L130     BoogieDeclarations]: Found specification of procedure block_22_return_function_f__9_52_0
[2025-05-07 17:29:18,115 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_22_return_function_f__9_52_0
[2025-05-07 17:29:18,115 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_20_f_8_52_0 given in one single declaration
[2025-05-07 17:29:18,115 INFO  L130     BoogieDeclarations]: Found specification of procedure block_20_f_8_52_0
[2025-05-07 17:29:18,115 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_20_f_8_52_0
[2025-05-07 17:29:18,115 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_19_function_f__9_52_0 given in one single declaration
[2025-05-07 17:29:18,115 INFO  L130     BoogieDeclarations]: Found specification of procedure block_19_function_f__9_52_0
[2025-05-07 17:29:18,115 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_19_function_f__9_52_0
[2025-05-07 17:29:18,115 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_21_return_f_41_52_0 given in one single declaration
[2025-05-07 17:29:18,116 INFO  L130     BoogieDeclarations]: Found specification of procedure block_21_return_f_41_52_0
[2025-05-07 17:29:18,116 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_21_return_f_41_52_0
[2025-05-07 17:29:18,116 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_24_function_f__9_52_0 given in one single declaration
[2025-05-07 17:29:18,116 INFO  L130     BoogieDeclarations]: Found specification of procedure block_24_function_f__9_52_0
[2025-05-07 17:29:18,116 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_24_function_f__9_52_0
[2025-05-07 17:29:18,116 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_5_B_52_0 given in one single declaration
[2025-05-07 17:29:18,116 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_5_B_52_0
[2025-05-07 17:29:18,116 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_5_B_52_0
[2025-05-07 17:29:18,116 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_11_function_set__51_52_0 given in one single declaration
[2025-05-07 17:29:18,116 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_11_function_set__51_52_0
[2025-05-07 17:29:18,116 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_11_function_set__51_52_0
[2025-05-07 17:29:18,116 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_29_function_set__51_52_0 given in one single declaration
[2025-05-07 17:29:18,116 INFO  L130     BoogieDeclarations]: Found specification of procedure block_29_function_set__51_52_0
[2025-05-07 17:29:18,116 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_29_function_set__51_52_0
[2025-05-07 17:29:18,116 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_10_function_set__51_52_0 given in one single declaration
[2025-05-07 17:29:18,116 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_10_function_set__51_52_0
[2025-05-07 17:29:18,116 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_10_function_set__51_52_0
[2025-05-07 17:29:18,116 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_28_return_function_set__51_52_0 given in one single declaration
[2025-05-07 17:29:18,116 INFO  L130     BoogieDeclarations]: Found specification of procedure block_28_return_function_set__51_52_0
[2025-05-07 17:29:18,116 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_28_return_function_set__51_52_0
[2025-05-07 17:29:18,117 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_27_set_50_52_0 given in one single declaration
[2025-05-07 17:29:18,117 INFO  L130     BoogieDeclarations]: Found specification of procedure block_27_set_50_52_0
[2025-05-07 17:29:18,117 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_27_set_50_52_0
[2025-05-07 17:29:18,117 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_26_function_set__51_52_0 given in one single declaration
[2025-05-07 17:29:18,117 INFO  L130     BoogieDeclarations]: Found specification of procedure block_26_function_set__51_52_0
[2025-05-07 17:29:18,117 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_26_function_set__51_52_0
[2025-05-07 17:29:18,117 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_7_B_52_0 given in one single declaration
[2025-05-07 17:29:18,117 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_7_B_52_0
[2025-05-07 17:29:18,117 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_7_B_52_0
[2025-05-07 17:29:18,117 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_30_B_52_0 given in one single declaration
[2025-05-07 17:29:18,117 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_30_B_52_0
[2025-05-07 17:29:18,117 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_30_B_52_0
[2025-05-07 17:29:18,117 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_32_B_52_0 given in one single declaration
[2025-05-07 17:29:18,117 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_32_B_52_0
[2025-05-07 17:29:18,117 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_32_B_52_0
[2025-05-07 17:29:18,117 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_31_B_52_0 given in one single declaration
[2025-05-07 17:29:18,117 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_31_B_52_0
[2025-05-07 17:29:18,117 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_31_B_52_0
[2025-05-07 17:29:18,118 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_33_A_14_0 given in one single declaration
[2025-05-07 17:29:18,118 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_33_A_14_0
[2025-05-07 17:29:18,118 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_33_A_14_0
[2025-05-07 17:29:18,118 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_35_A_14_0 given in one single declaration
[2025-05-07 17:29:18,118 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_35_A_14_0
[2025-05-07 17:29:18,118 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_35_A_14_0
[2025-05-07 17:29:18,118 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_34_A_14_0 given in one single declaration
[2025-05-07 17:29:18,118 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_34_A_14_0
[2025-05-07 17:29:18,118 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_34_A_14_0
[2025-05-07 17:29:18,118 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_36_B_52_0 given in one single declaration
[2025-05-07 17:29:18,118 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_36_B_52_0
[2025-05-07 17:29:18,118 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_36_B_52_0
[2025-05-07 17:29:18,118 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:29:18,118 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:29:18,118 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:29:18,258 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:29:18,260 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:29:18,485 INFO  L?                        ?]: Removed 226 outVars from TransFormulas that were not future-live.
[2025-05-07 17:29:18,485 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:29:18,496 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:29:18,497 INFO  L312             CfgBuilder]: Removed 13 assume(true) statements.
[2025-05-07 17:29:18,497 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:29:18 BoogieIcfgContainer
[2025-05-07 17:29:18,497 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:29:18,499 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:29:18,500 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:29:18,503 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:29:18,503 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:29:17" (1/3) ...
[2025-05-07 17:29:18,504 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b347ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:29:18, skipping insertion in model container
[2025-05-07 17:29:18,504 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:18" (2/3) ...
[2025-05-07 17:29:18,504 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b347ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:29:18, skipping insertion in model container
[2025-05-07 17:29:18,504 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:29:18" (3/3) ...
[2025-05-07 17:29:18,505 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:29:18,520 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:29:18,522 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 27 procedures, 105 locations, 156 edges, 27 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:29:18,558 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:29:18,568 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;@535ff83d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:29:18,568 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:29:18,571 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 105 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 48 states have internal predecessors, (48), 34 states have call successors, (36), 26 states have call predecessors, (36), 26 states have return successors, (36), 30 states have call predecessors, (36), 34 states have call successors, (36)
[2025-05-07 17:29:18,581 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2025-05-07 17:29:18,581 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:18,581 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]
[2025-05-07 17:29:18,582 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:18,585 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:18,585 INFO  L85        PathProgramCache]: Analyzing trace with hash 270858440, now seen corresponding path program 1 times
[2025-05-07 17:29:18,590 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:18,591 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899849743]
[2025-05-07 17:29:18,591 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:18,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:18,643 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes.
[2025-05-07 17:29:18,669 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements.
[2025-05-07 17:29:18,669 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:18,669 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:18,871 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:29:18,871 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:18,871 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899849743]
[2025-05-07 17:29:18,872 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899849743] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:18,872 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:18,875 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:18,876 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779731480]
[2025-05-07 17:29:18,877 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:18,880 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:18,880 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:18,900 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:18,900 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:18,902 INFO  L87              Difference]: Start difference. First operand  has 105 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 48 states have internal predecessors, (48), 34 states have call successors, (36), 26 states have call predecessors, (36), 26 states have return successors, (36), 30 states have call predecessors, (36), 34 states have call successors, (36) Second operand  has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (15), 1 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15)
[2025-05-07 17:29:18,967 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:18,968 INFO  L93              Difference]: Finished difference Result 105 states and 119 transitions.
[2025-05-07 17:29:18,970 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:18,971 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (15), 1 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 55
[2025-05-07 17:29:18,972 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:18,978 INFO  L225             Difference]: With dead ends: 105
[2025-05-07 17:29:18,978 INFO  L226             Difference]: Without dead ends: 98
[2025-05-07 17:29:18,980 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:29:18,982 INFO  L437           NwaCegarLoop]: 118 mSDtfsCounter, 1 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 3 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, 3 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:18,983 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 336 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:18,994 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2025-05-07 17:29:19,014 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98.
[2025-05-07 17:29:19,015 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 44 states have internal predecessors, (44), 29 states have call successors, (31), 26 states have call predecessors, (31), 26 states have return successors, (31), 27 states have call predecessors, (31), 29 states have call successors, (31)
[2025-05-07 17:29:19,019 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions.
[2025-05-07 17:29:19,020 INFO  L79                 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 55
[2025-05-07 17:29:19,021 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:19,021 INFO  L485      AbstractCegarLoop]: Abstraction has 98 states and 106 transitions.
[2025-05-07 17:29:19,021 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (15), 1 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15)
[2025-05-07 17:29:19,021 INFO  L278                IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions.
[2025-05-07 17:29:19,023 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-05-07 17:29:19,024 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:19,024 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]
[2025-05-07 17:29:19,024 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:29:19,024 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:19,025 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:19,025 INFO  L85        PathProgramCache]: Analyzing trace with hash 192026031, now seen corresponding path program 1 times
[2025-05-07 17:29:19,025 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:19,025 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563248423]
[2025-05-07 17:29:19,025 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:19,026 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:19,060 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-05-07 17:29:19,099 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-05-07 17:29:19,099 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:19,099 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:19,715 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:29:19,715 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:19,716 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563248423]
[2025-05-07 17:29:19,716 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563248423] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:19,716 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:19,716 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21
[2025-05-07 17:29:19,716 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679461668]
[2025-05-07 17:29:19,716 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:19,717 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2025-05-07 17:29:19,717 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:19,718 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2025-05-07 17:29:19,718 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420
[2025-05-07 17:29:19,718 INFO  L87              Difference]: Start difference. First operand 98 states and 106 transitions. Second operand  has 21 states, 16 states have (on average 1.8125) internal successors, (29), 18 states have internal predecessors, (29), 8 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (18), 15 states have call predecessors, (18), 8 states have call successors, (18)
[2025-05-07 17:29:20,092 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:20,092 INFO  L93              Difference]: Finished difference Result 108 states and 121 transitions.
[2025-05-07 17:29:20,092 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2025-05-07 17:29:20,092 INFO  L79                 Accepts]: Start accepts. Automaton has  has 21 states, 16 states have (on average 1.8125) internal successors, (29), 18 states have internal predecessors, (29), 8 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (18), 15 states have call predecessors, (18), 8 states have call successors, (18) Word has length 65
[2025-05-07 17:29:20,093 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:20,094 INFO  L225             Difference]: With dead ends: 108
[2025-05-07 17:29:20,094 INFO  L226             Difference]: Without dead ends: 108
[2025-05-07 17:29:20,094 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600
[2025-05-07 17:29:20,094 INFO  L437           NwaCegarLoop]: 90 mSDtfsCounter, 6 mSDsluCounter, 1659 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:20,095 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1749 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:29:20,095 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 108 states.
[2025-05-07 17:29:20,103 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106.
[2025-05-07 17:29:20,104 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 106 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 47 states have internal predecessors, (47), 31 states have call successors, (33), 26 states have call predecessors, (33), 29 states have return successors, (39), 32 states have call predecessors, (39), 31 states have call successors, (39)
[2025-05-07 17:29:20,105 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions.
[2025-05-07 17:29:20,105 INFO  L79                 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 65
[2025-05-07 17:29:20,105 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:20,105 INFO  L485      AbstractCegarLoop]: Abstraction has 106 states and 119 transitions.
[2025-05-07 17:29:20,105 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 16 states have (on average 1.8125) internal successors, (29), 18 states have internal predecessors, (29), 8 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (18), 15 states have call predecessors, (18), 8 states have call successors, (18)
[2025-05-07 17:29:20,105 INFO  L278                IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions.
[2025-05-07 17:29:20,106 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-05-07 17:29:20,106 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:20,106 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]
[2025-05-07 17:29:20,107 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:29:20,107 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:20,107 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:20,107 INFO  L85        PathProgramCache]: Analyzing trace with hash 983253539, now seen corresponding path program 1 times
[2025-05-07 17:29:20,107 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:20,107 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797701932]
[2025-05-07 17:29:20,107 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:20,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:20,136 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-05-07 17:29:20,152 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-05-07 17:29:20,152 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:20,152 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:20,624 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:29:20,625 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:20,625 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797701932]
[2025-05-07 17:29:20,625 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797701932] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:20,625 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:20,625 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21
[2025-05-07 17:29:20,625 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453856537]
[2025-05-07 17:29:20,625 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:20,625 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2025-05-07 17:29:20,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:20,626 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2025-05-07 17:29:20,626 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420
[2025-05-07 17:29:20,626 INFO  L87              Difference]: Start difference. First operand 106 states and 119 transitions. Second operand  has 21 states, 16 states have (on average 1.8125) internal successors, (29), 18 states have internal predecessors, (29), 8 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (18), 15 states have call predecessors, (18), 8 states have call successors, (18)
[2025-05-07 17:29:20,946 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:20,947 INFO  L93              Difference]: Finished difference Result 113 states and 128 transitions.
[2025-05-07 17:29:20,947 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2025-05-07 17:29:20,947 INFO  L79                 Accepts]: Start accepts. Automaton has  has 21 states, 16 states have (on average 1.8125) internal successors, (29), 18 states have internal predecessors, (29), 8 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (18), 15 states have call predecessors, (18), 8 states have call successors, (18) Word has length 65
[2025-05-07 17:29:20,948 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:20,948 INFO  L225             Difference]: With dead ends: 113
[2025-05-07 17:29:20,948 INFO  L226             Difference]: Without dead ends: 113
[2025-05-07 17:29:20,949 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600
[2025-05-07 17:29:20,949 INFO  L437           NwaCegarLoop]: 92 mSDtfsCounter, 5 mSDsluCounter, 1693 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:20,949 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1785 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:29:20,950 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2025-05-07 17:29:20,955 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 106.
[2025-05-07 17:29:20,956 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 106 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 47 states have internal predecessors, (47), 31 states have call successors, (33), 26 states have call predecessors, (33), 29 states have return successors, (39), 32 states have call predecessors, (39), 31 states have call successors, (39)
[2025-05-07 17:29:20,956 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions.
[2025-05-07 17:29:20,956 INFO  L79                 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 65
[2025-05-07 17:29:20,957 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:20,957 INFO  L485      AbstractCegarLoop]: Abstraction has 106 states and 119 transitions.
[2025-05-07 17:29:20,957 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 16 states have (on average 1.8125) internal successors, (29), 18 states have internal predecessors, (29), 8 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (18), 15 states have call predecessors, (18), 8 states have call successors, (18)
[2025-05-07 17:29:20,957 INFO  L278                IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions.
[2025-05-07 17:29:20,958 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 66
[2025-05-07 17:29:20,958 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:20,958 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]
[2025-05-07 17:29:20,958 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:29:20,958 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:20,958 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:20,958 INFO  L85        PathProgramCache]: Analyzing trace with hash -1074151711, now seen corresponding path program 1 times
[2025-05-07 17:29:20,958 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:20,959 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026264288]
[2025-05-07 17:29:20,959 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:20,959 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:20,979 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes.
[2025-05-07 17:29:20,989 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements.
[2025-05-07 17:29:20,989 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:20,989 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:21,391 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:29:21,392 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:21,392 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026264288]
[2025-05-07 17:29:21,392 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026264288] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:21,392 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:21,392 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21
[2025-05-07 17:29:21,392 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112380703]
[2025-05-07 17:29:21,392 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:21,392 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2025-05-07 17:29:21,392 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:21,393 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2025-05-07 17:29:21,393 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420
[2025-05-07 17:29:21,393 INFO  L87              Difference]: Start difference. First operand 106 states and 119 transitions. Second operand  has 21 states, 16 states have (on average 1.8125) internal successors, (29), 18 states have internal predecessors, (29), 8 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (18), 15 states have call predecessors, (18), 8 states have call successors, (18)
[2025-05-07 17:29:21,691 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:21,691 INFO  L93              Difference]: Finished difference Result 106 states and 118 transitions.
[2025-05-07 17:29:21,691 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2025-05-07 17:29:21,692 INFO  L79                 Accepts]: Start accepts. Automaton has  has 21 states, 16 states have (on average 1.8125) internal successors, (29), 18 states have internal predecessors, (29), 8 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (18), 15 states have call predecessors, (18), 8 states have call successors, (18) Word has length 65
[2025-05-07 17:29:21,692 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:21,693 INFO  L225             Difference]: With dead ends: 106
[2025-05-07 17:29:21,693 INFO  L226             Difference]: Without dead ends: 105
[2025-05-07 17:29:21,694 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600
[2025-05-07 17:29:21,694 INFO  L437           NwaCegarLoop]: 87 mSDtfsCounter, 5 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:21,695 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1692 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:29:21,695 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 105 states.
[2025-05-07 17:29:21,700 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100.
[2025-05-07 17:29:21,701 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 100 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 29 states have call successors, (31), 26 states have call predecessors, (31), 27 states have return successors, (33), 28 states have call predecessors, (33), 29 states have call successors, (33)
[2025-05-07 17:29:21,702 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions.
[2025-05-07 17:29:21,702 INFO  L79                 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 65
[2025-05-07 17:29:21,702 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:21,702 INFO  L485      AbstractCegarLoop]: Abstraction has 100 states and 109 transitions.
[2025-05-07 17:29:21,702 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 16 states have (on average 1.8125) internal successors, (29), 18 states have internal predecessors, (29), 8 states have call successors, (18), 1 states have call predecessors, (18), 16 states have return successors, (18), 15 states have call predecessors, (18), 8 states have call successors, (18)
[2025-05-07 17:29:21,702 INFO  L278                IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions.
[2025-05-07 17:29:21,703 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-05-07 17:29:21,703 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:21,704 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:21,704 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:29:21,704 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:21,704 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:21,704 INFO  L85        PathProgramCache]: Analyzing trace with hash 1377315430, now seen corresponding path program 1 times
[2025-05-07 17:29:21,704 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:21,704 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813918488]
[2025-05-07 17:29:21,704 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:21,704 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:21,740 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:29:21,754 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:29:21,754 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:21,754 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:21,866 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:29:21,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:21,866 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813918488]
[2025-05-07 17:29:21,866 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813918488] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:21,866 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:21,866 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-05-07 17:29:21,867 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143978730]
[2025-05-07 17:29:21,867 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:21,867 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-05-07 17:29:21,867 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:21,868 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-05-07 17:29:21,868 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-05-07 17:29:21,868 INFO  L87              Difference]: Start difference. First operand 100 states and 109 transitions. Second operand  has 9 states, 7 states have (on average 5.571428571428571) internal successors, (39), 9 states have internal predecessors, (39), 5 states have call successors, (25), 1 states have call predecessors, (25), 7 states have return successors, (25), 8 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:29:21,937 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:21,937 INFO  L93              Difference]: Finished difference Result 105 states and 115 transitions.
[2025-05-07 17:29:21,937 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-05-07 17:29:21,938 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 7 states have (on average 5.571428571428571) internal successors, (39), 9 states have internal predecessors, (39), 5 states have call successors, (25), 1 states have call predecessors, (25), 7 states have return successors, (25), 8 states have call predecessors, (25), 5 states have call successors, (25) Word has length 90
[2025-05-07 17:29:21,938 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:21,939 INFO  L225             Difference]: With dead ends: 105
[2025-05-07 17:29:21,939 INFO  L226             Difference]: Without dead ends: 105
[2025-05-07 17:29:21,939 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:29:21,940 INFO  L437           NwaCegarLoop]: 105 mSDtfsCounter, 2 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:21,940 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 816 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:29:21,941 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 105 states.
[2025-05-07 17:29:21,946 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105.
[2025-05-07 17:29:21,946 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 105 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 47 states have internal predecessors, (47), 30 states have call successors, (32), 26 states have call predecessors, (32), 29 states have return successors, (36), 31 states have call predecessors, (36), 30 states have call successors, (36)
[2025-05-07 17:29:21,947 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions.
[2025-05-07 17:29:21,947 INFO  L79                 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 90
[2025-05-07 17:29:21,947 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:21,948 INFO  L485      AbstractCegarLoop]: Abstraction has 105 states and 115 transitions.
[2025-05-07 17:29:21,948 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 7 states have (on average 5.571428571428571) internal successors, (39), 9 states have internal predecessors, (39), 5 states have call successors, (25), 1 states have call predecessors, (25), 7 states have return successors, (25), 8 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:29:21,948 INFO  L278                IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions.
[2025-05-07 17:29:21,949 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-05-07 17:29:21,949 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:21,949 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:21,949 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:29:21,949 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:21,950 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:21,950 INFO  L85        PathProgramCache]: Analyzing trace with hash -1651474124, now seen corresponding path program 1 times
[2025-05-07 17:29:21,950 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:21,950 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891332669]
[2025-05-07 17:29:21,950 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:21,950 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:21,986 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:29:22,002 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:29:22,003 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:22,003 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:22,074 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:29:22,074 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:22,074 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891332669]
[2025-05-07 17:29:22,074 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891332669] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:22,074 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:22,074 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:29:22,075 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271946867]
[2025-05-07 17:29:22,075 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:22,075 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:22,075 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:22,075 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:22,075 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:22,075 INFO  L87              Difference]: Start difference. First operand 105 states and 115 transitions. Second operand  has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:29:22,100 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:22,100 INFO  L93              Difference]: Finished difference Result 110 states and 121 transitions.
[2025-05-07 17:29:22,100 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:22,101 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25) Word has length 90
[2025-05-07 17:29:22,101 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:22,102 INFO  L225             Difference]: With dead ends: 110
[2025-05-07 17:29:22,102 INFO  L226             Difference]: Without dead ends: 110
[2025-05-07 17:29:22,102 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:22,103 INFO  L437           NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:22,103 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 518 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:22,104 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 110 states.
[2025-05-07 17:29:22,109 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105.
[2025-05-07 17:29:22,110 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 105 states, 45 states have (on average 1.0444444444444445) internal successors, (47), 47 states have internal predecessors, (47), 30 states have call successors, (32), 26 states have call predecessors, (32), 29 states have return successors, (36), 31 states have call predecessors, (36), 30 states have call successors, (36)
[2025-05-07 17:29:22,110 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions.
[2025-05-07 17:29:22,111 INFO  L79                 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 90
[2025-05-07 17:29:22,111 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:22,111 INFO  L485      AbstractCegarLoop]: Abstraction has 105 states and 115 transitions.
[2025-05-07 17:29:22,111 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:29:22,111 INFO  L278                IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions.
[2025-05-07 17:29:22,112 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-05-07 17:29:22,112 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:22,112 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:22,112 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:29:22,112 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:22,113 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:22,113 INFO  L85        PathProgramCache]: Analyzing trace with hash -860246616, now seen corresponding path program 1 times
[2025-05-07 17:29:22,113 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:22,113 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052955774]
[2025-05-07 17:29:22,113 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:22,113 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:22,140 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:29:22,152 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:29:22,152 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:22,152 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:22,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:29:22,254 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:22,254 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052955774]
[2025-05-07 17:29:22,254 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052955774] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:22,254 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:22,254 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:22,254 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372652575]
[2025-05-07 17:29:22,254 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:22,254 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:22,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:22,254 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:22,254 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:22,255 INFO  L87              Difference]: Start difference. First operand 105 states and 115 transitions. Second operand  has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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:29:22,271 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:22,272 INFO  L93              Difference]: Finished difference Result 92 states and 100 transitions.
[2025-05-07 17:29:22,272 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:22,272 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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 90
[2025-05-07 17:29:22,272 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:22,272 INFO  L225             Difference]: With dead ends: 92
[2025-05-07 17:29:22,272 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:29:22,273 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:29:22,273 INFO  L437           NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:22,273 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 277 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:22,274 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:29:22,274 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:29:22,274 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:29:22,274 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:29:22,274 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 90
[2025-05-07 17:29:22,274 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:22,274 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:29:22,274 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 13.0) internal successors, (39), 4 states have internal predecessors, (39), 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:29:22,274 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:29:22,275 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:29:22,276 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:29:22,277 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:29:22,279 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:22,281 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:29:22,284 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:29:22 BoogieIcfgContainer
[2025-05-07 17:29:22,284 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:29:22,284 INFO  L158              Benchmark]: Toolchain (without parser) took 4287.66ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 150.2MB in the beginning and 228.9MB in the end (delta: -78.8MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:22,284 INFO  L158              Benchmark]: SmtParser took 0.24ms. 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:29:22,285 INFO  L158              Benchmark]: ChcToBoogie took 32.79ms. Allocated memory is still 234.9MB. Free memory was 150.1MB in the beginning and 147.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:22,285 INFO  L158              Benchmark]: Boogie Preprocessor took 52.73ms. Allocated memory is still 234.9MB. Free memory was 147.2MB in the beginning and 144.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:29:22,285 INFO  L158              Benchmark]: RCFGBuilder took 413.55ms. Allocated memory is still 234.9MB. Free memory was 143.9MB in the beginning and 179.3MB in the end (delta: -35.4MB). Peak memory consumption was 43.1MB. Max. memory is 33.6GB.
[2025-05-07 17:29:22,285 INFO  L158              Benchmark]: TraceAbstraction took 3784.33ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 178.5MB in the beginning and 228.9MB in the end (delta: -50.4MB). Peak memory consumption was 4.7MB. Max. memory is 33.6GB.
[2025-05-07 17:29:22,286 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.24ms. Allocated memory is still 234.9MB. Free memory is still 174.0MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 32.79ms. Allocated memory is still 234.9MB. Free memory was 150.1MB in the beginning and 147.3MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 52.73ms. Allocated memory is still 234.9MB. Free memory was 147.2MB in the beginning and 144.0MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 413.55ms. Allocated memory is still 234.9MB. Free memory was 143.9MB in the beginning and 179.3MB in the end (delta: -35.4MB). Peak memory consumption was 43.1MB. Max. memory is 33.6GB.
 * TraceAbstraction took 3784.33ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 178.5MB in the beginning and 228.9MB in the end (delta: -50.4MB). Peak memory consumption was 4.7MB. 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 27 procedures, 105 locations, 156 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 7173 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6480 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1337 IncrementalHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 693 mSDtfsCounter, 1337 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=2, InterpolantAutomatonStates: 86, 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, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 520 NumberOfCodeBlocks, 520 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 513 ConstructedInterpolants, 0 QuantifiedInterpolants, 792 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 9/9 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:29:22,297 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
