./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/implicit_only_constructor_hierarchy.sol_3_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:23:59,575 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:23:59,616 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80611be6-d5be-4f0d-86d6-def968c5d1b7/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:23:59,618 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:23:59,619 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:23:59,632 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:23:59,633 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:23:59,633 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:23:59,633 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:23:59,633 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:23:59,634 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:23:59,634 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:23:59,634 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:23:59,634 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:23:59,634 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:23:59,634 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:23:59,634 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:23:59,634 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:23:59,634 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:23:59,634 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:23:59,634 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:23:59,634 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:23:59,634 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:23:59,634 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:23:59,635 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:23:59,635 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:23:59,635 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:23:59,812 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:23:59,819 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:23:59,821 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:23:59,822 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:23:59,822 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:23:59,823 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80611be6-d5be-4f0d-86d6-def968c5d1b7/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/implicit_only_constructor_hierarchy.sol_3_no_adts_000.smt2
[2025-05-07 17:23:59,825 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:23:59,827 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:24:00,111 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_80611be6-d5be-4f0d-86d6-def968c5d1b7/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/inheritance/implicit_only_constructor_hierarchy.sol_3_no_adts_000.smt2
[2025-05-07 17:24:00,113 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:24:00,114 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:24:00,115 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:24:00,115 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:24:00,115 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:24:00,117 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:24:00" (1/1) ...
[2025-05-07 17:24:00,156 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:00 Unit
[2025-05-07 17:24:00,156 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:24:00,157 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:24:00,157 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:24:00,157 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:24:00,168 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:00" (1/1) ...
[2025-05-07 17:24:00,168 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:00" (1/1) ...
[2025-05-07 17:24:00,192 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:00" (1/1) ...
[2025-05-07 17:24:00,193 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:00" (1/1) ...
[2025-05-07 17:24:00,199 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:00" (1/1) ...
[2025-05-07 17:24:00,200 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:00" (1/1) ...
[2025-05-07 17:24:00,202 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:00" (1/1) ...
[2025-05-07 17:24:00,206 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:00" (1/1) ...
[2025-05-07 17:24:00,208 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:00" (1/1) ...
[2025-05-07 17:24:00,235 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:24:00,236 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:24:00,236 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:24:00,236 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:24:00,237 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:00" (1/1) ...
[2025-05-07 17:24:00,239 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:24:00,251 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:24:00,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:24:00,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:24:00,275 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:24:00,275 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:24:00,275 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:24:00,275 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_15_0 given in one single declaration
[2025-05-07 17:24:00,275 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_15_0
[2025-05-07 17:24:00,275 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_15_0
[2025-05-07 17:24:00,275 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_11_function_g__25_26_0 given in one single declaration
[2025-05-07 17:24:00,276 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_11_function_g__25_26_0
[2025-05-07 17:24:00,276 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_11_function_g__25_26_0
[2025-05-07 17:24:00,276 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_39_function_g__25_26_0 given in one single declaration
[2025-05-07 17:24:00,276 INFO  L130     BoogieDeclarations]: Found specification of procedure block_39_function_g__25_26_0
[2025-05-07 17:24:00,276 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_39_function_g__25_26_0
[2025-05-07 17:24:00,276 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_10_function_g__25_26_0 given in one single declaration
[2025-05-07 17:24:00,276 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_10_function_g__25_26_0
[2025-05-07 17:24:00,276 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_10_function_g__25_26_0
[2025-05-07 17:24:00,276 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_37_return_function_g__25_26_0 given in one single declaration
[2025-05-07 17:24:00,276 INFO  L130     BoogieDeclarations]: Found specification of procedure block_37_return_function_g__25_26_0
[2025-05-07 17:24:00,276 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_37_return_function_g__25_26_0
[2025-05-07 17:24:00,276 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_36_g_24_26_0 given in one single declaration
[2025-05-07 17:24:00,276 INFO  L130     BoogieDeclarations]: Found specification of procedure block_36_g_24_26_0
[2025-05-07 17:24:00,277 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_36_g_24_26_0
[2025-05-07 17:24:00,277 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_35_function_g__25_26_0 given in one single declaration
[2025-05-07 17:24:00,277 INFO  L130     BoogieDeclarations]: Found specification of procedure block_35_function_g__25_26_0
[2025-05-07 17:24:00,277 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_35_function_g__25_26_0
[2025-05-07 17:24:00,277 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_38_function_g__25_26_0 given in one single declaration
[2025-05-07 17:24:00,277 INFO  L130     BoogieDeclarations]: Found specification of procedure block_38_function_g__25_26_0
[2025-05-07 17:24:00,277 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_38_function_g__25_26_0
[2025-05-07 17:24:00,277 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_5_B_26_0 given in one single declaration
[2025-05-07 17:24:00,277 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_5_B_26_0
[2025-05-07 17:24:00,277 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_5_B_26_0
[2025-05-07 17:24:00,277 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_7_B_26_0 given in one single declaration
[2025-05-07 17:24:00,277 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_7_B_26_0
[2025-05-07 17:24:00,277 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_7_B_26_0
[2025-05-07 17:24:00,277 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_40_B_26_0 given in one single declaration
[2025-05-07 17:24:00,278 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_40_B_26_0
[2025-05-07 17:24:00,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_40_B_26_0
[2025-05-07 17:24:00,278 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_42_B_26_0 given in one single declaration
[2025-05-07 17:24:00,278 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_42_B_26_0
[2025-05-07 17:24:00,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_42_B_26_0
[2025-05-07 17:24:00,278 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_41_B_26_0 given in one single declaration
[2025-05-07 17:24:00,278 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_41_B_26_0
[2025-05-07 17:24:00,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_41_B_26_0
[2025-05-07 17:24:00,278 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_46_B_26_0 given in one single declaration
[2025-05-07 17:24:00,278 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_46_B_26_0
[2025-05-07 17:24:00,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_46_B_26_0
[2025-05-07 17:24:00,278 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_43_A_13_0 given in one single declaration
[2025-05-07 17:24:00,278 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_43_A_13_0
[2025-05-07 17:24:00,278 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_43_A_13_0
[2025-05-07 17:24:00,278 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_45_A_13_0 given in one single declaration
[2025-05-07 17:24:00,279 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_45_A_13_0
[2025-05-07 17:24:00,279 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_45_A_13_0
[2025-05-07 17:24:00,279 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_44_A_13_0 given in one single declaration
[2025-05-07 17:24:00,279 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_44_A_13_0
[2025-05-07 17:24:00,279 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_44_A_13_0
[2025-05-07 17:24:00,279 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_9_function_h__12_26_0 given in one single declaration
[2025-05-07 17:24:00,279 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_9_function_h__12_26_0
[2025-05-07 17:24:00,279 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_9_function_h__12_26_0
[2025-05-07 17:24:00,279 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_8_function_h__12_26_0 given in one single declaration
[2025-05-07 17:24:00,279 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_8_function_h__12_26_0
[2025-05-07 17:24:00,279 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_8_function_h__12_26_0
[2025-05-07 17:24:00,279 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_33_function_h__12_26_0 given in one single declaration
[2025-05-07 17:24:00,279 INFO  L130     BoogieDeclarations]: Found specification of procedure block_33_function_h__12_26_0
[2025-05-07 17:24:00,279 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_33_function_h__12_26_0
[2025-05-07 17:24:00,279 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_31_h_11_26_0 given in one single declaration
[2025-05-07 17:24:00,280 INFO  L130     BoogieDeclarations]: Found specification of procedure block_31_h_11_26_0
[2025-05-07 17:24:00,280 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_31_h_11_26_0
[2025-05-07 17:24:00,280 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_30_function_h__12_26_0 given in one single declaration
[2025-05-07 17:24:00,280 INFO  L130     BoogieDeclarations]: Found specification of procedure block_30_function_h__12_26_0
[2025-05-07 17:24:00,280 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_30_function_h__12_26_0
[2025-05-07 17:24:00,280 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_32_return_function_h__12_26_0 given in one single declaration
[2025-05-07 17:24:00,280 INFO  L130     BoogieDeclarations]: Found specification of procedure block_32_return_function_h__12_26_0
[2025-05-07 17:24:00,280 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_32_return_function_h__12_26_0
[2025-05-07 17:24:00,280 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_34_function_h__12_26_0 given in one single declaration
[2025-05-07 17:24:00,280 INFO  L130     BoogieDeclarations]: Found specification of procedure block_34_function_h__12_26_0
[2025-05-07 17:24:00,280 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_34_function_h__12_26_0
[2025-05-07 17:24:00,280 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_12_C_39_0 given in one single declaration
[2025-05-07 17:24:00,280 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_12_C_39_0
[2025-05-07 17:24:00,280 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_12_C_39_0
[2025-05-07 17:24:00,281 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_20_function_f__38_39_0 given in one single declaration
[2025-05-07 17:24:00,281 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_20_function_f__38_39_0
[2025-05-07 17:24:00,281 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_20_function_f__38_39_0
[2025-05-07 17:24:00,281 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_19_function_f__38_39_0 given in one single declaration
[2025-05-07 17:24:00,281 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_19_function_f__38_39_0
[2025-05-07 17:24:00,281 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_19_function_f__38_39_0
[2025-05-07 17:24:00,281 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_59_return_function_f__38_39_0 given in one single declaration
[2025-05-07 17:24:00,281 INFO  L130     BoogieDeclarations]: Found specification of procedure block_59_return_function_f__38_39_0
[2025-05-07 17:24:00,281 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_59_return_function_f__38_39_0
[2025-05-07 17:24:00,281 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_58_f_37_39_0 given in one single declaration
[2025-05-07 17:24:00,281 INFO  L130     BoogieDeclarations]: Found specification of procedure block_58_f_37_39_0
[2025-05-07 17:24:00,281 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_58_f_37_39_0
[2025-05-07 17:24:00,281 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_57_function_f__38_39_0 given in one single declaration
[2025-05-07 17:24:00,281 INFO  L130     BoogieDeclarations]: Found specification of procedure block_57_function_f__38_39_0
[2025-05-07 17:24:00,281 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_57_function_f__38_39_0
[2025-05-07 17:24:00,281 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_60_function_f__38_39_0 given in one single declaration
[2025-05-07 17:24:00,281 INFO  L130     BoogieDeclarations]: Found specification of procedure block_60_function_f__38_39_0
[2025-05-07 17:24:00,281 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_60_function_f__38_39_0
[2025-05-07 17:24:00,282 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_61_function_f__38_39_0 given in one single declaration
[2025-05-07 17:24:00,282 INFO  L130     BoogieDeclarations]: Found specification of procedure block_61_function_f__38_39_0
[2025-05-07 17:24:00,282 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_61_function_f__38_39_0
[2025-05-07 17:24:00,282 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_14_C_39_0 given in one single declaration
[2025-05-07 17:24:00,282 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_14_C_39_0
[2025-05-07 17:24:00,282 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_14_C_39_0
[2025-05-07 17:24:00,282 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_65_B_26_0 given in one single declaration
[2025-05-07 17:24:00,282 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_65_B_26_0
[2025-05-07 17:24:00,282 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_65_B_26_0
[2025-05-07 17:24:00,282 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_67_B_26_0 given in one single declaration
[2025-05-07 17:24:00,282 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_67_B_26_0
[2025-05-07 17:24:00,282 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_67_B_26_0
[2025-05-07 17:24:00,282 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_66_B_26_0 given in one single declaration
[2025-05-07 17:24:00,282 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_66_B_26_0
[2025-05-07 17:24:00,282 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_66_B_26_0
[2025-05-07 17:24:00,282 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_62_C_39_0 given in one single declaration
[2025-05-07 17:24:00,282 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_62_C_39_0
[2025-05-07 17:24:00,283 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_62_C_39_0
[2025-05-07 17:24:00,283 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_64_C_39_0 given in one single declaration
[2025-05-07 17:24:00,283 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_64_C_39_0
[2025-05-07 17:24:00,283 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_64_C_39_0
[2025-05-07 17:24:00,283 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_63_C_39_0 given in one single declaration
[2025-05-07 17:24:00,283 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_63_C_39_0
[2025-05-07 17:24:00,283 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_63_C_39_0
[2025-05-07 17:24:00,283 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_68_A_13_0 given in one single declaration
[2025-05-07 17:24:00,283 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_68_A_13_0
[2025-05-07 17:24:00,283 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_68_A_13_0
[2025-05-07 17:24:00,283 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_70_A_13_0 given in one single declaration
[2025-05-07 17:24:00,283 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_70_A_13_0
[2025-05-07 17:24:00,283 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_70_A_13_0
[2025-05-07 17:24:00,283 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_69_A_13_0 given in one single declaration
[2025-05-07 17:24:00,283 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_69_A_13_0
[2025-05-07 17:24:00,283 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_69_A_13_0
[2025-05-07 17:24:00,283 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_71_C_39_0 given in one single declaration
[2025-05-07 17:24:00,284 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_71_C_39_0
[2025-05-07 17:24:00,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_71_C_39_0
[2025-05-07 17:24:00,284 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_16_function_h__12_39_0 given in one single declaration
[2025-05-07 17:24:00,284 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_16_function_h__12_39_0
[2025-05-07 17:24:00,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_16_function_h__12_39_0
[2025-05-07 17:24:00,284 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_51_function_h__12_39_0 given in one single declaration
[2025-05-07 17:24:00,284 INFO  L130     BoogieDeclarations]: Found specification of procedure block_51_function_h__12_39_0
[2025-05-07 17:24:00,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_51_function_h__12_39_0
[2025-05-07 17:24:00,284 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_15_function_h__12_39_0 given in one single declaration
[2025-05-07 17:24:00,284 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_15_function_h__12_39_0
[2025-05-07 17:24:00,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_15_function_h__12_39_0
[2025-05-07 17:24:00,284 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_49_return_function_h__12_39_0 given in one single declaration
[2025-05-07 17:24:00,284 INFO  L130     BoogieDeclarations]: Found specification of procedure block_49_return_function_h__12_39_0
[2025-05-07 17:24:00,284 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_49_return_function_h__12_39_0
[2025-05-07 17:24:00,284 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_48_h_11_39_0 given in one single declaration
[2025-05-07 17:24:00,284 INFO  L130     BoogieDeclarations]: Found specification of procedure block_48_h_11_39_0
[2025-05-07 17:24:00,285 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_48_h_11_39_0
[2025-05-07 17:24:00,285 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_47_function_h__12_39_0 given in one single declaration
[2025-05-07 17:24:00,285 INFO  L130     BoogieDeclarations]: Found specification of procedure block_47_function_h__12_39_0
[2025-05-07 17:24:00,285 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_47_function_h__12_39_0
[2025-05-07 17:24:00,285 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_50_function_h__12_39_0 given in one single declaration
[2025-05-07 17:24:00,285 INFO  L130     BoogieDeclarations]: Found specification of procedure block_50_function_h__12_39_0
[2025-05-07 17:24:00,285 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_50_function_h__12_39_0
[2025-05-07 17:24:00,285 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_18_function_g__25_39_0 given in one single declaration
[2025-05-07 17:24:00,285 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_18_function_g__25_39_0
[2025-05-07 17:24:00,285 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_18_function_g__25_39_0
[2025-05-07 17:24:00,285 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_56_function_g__25_39_0 given in one single declaration
[2025-05-07 17:24:00,285 INFO  L130     BoogieDeclarations]: Found specification of procedure block_56_function_g__25_39_0
[2025-05-07 17:24:00,285 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_56_function_g__25_39_0
[2025-05-07 17:24:00,285 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_17_function_g__25_39_0 given in one single declaration
[2025-05-07 17:24:00,285 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_17_function_g__25_39_0
[2025-05-07 17:24:00,285 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_17_function_g__25_39_0
[2025-05-07 17:24:00,285 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_54_return_function_g__25_39_0 given in one single declaration
[2025-05-07 17:24:00,286 INFO  L130     BoogieDeclarations]: Found specification of procedure block_54_return_function_g__25_39_0
[2025-05-07 17:24:00,286 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_54_return_function_g__25_39_0
[2025-05-07 17:24:00,286 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_53_g_24_39_0 given in one single declaration
[2025-05-07 17:24:00,286 INFO  L130     BoogieDeclarations]: Found specification of procedure block_53_g_24_39_0
[2025-05-07 17:24:00,286 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_53_g_24_39_0
[2025-05-07 17:24:00,286 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_52_function_g__25_39_0 given in one single declaration
[2025-05-07 17:24:00,286 INFO  L130     BoogieDeclarations]: Found specification of procedure block_52_function_g__25_39_0
[2025-05-07 17:24:00,286 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_52_function_g__25_39_0
[2025-05-07 17:24:00,286 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_55_function_g__25_39_0 given in one single declaration
[2025-05-07 17:24:00,286 INFO  L130     BoogieDeclarations]: Found specification of procedure block_55_function_g__25_39_0
[2025-05-07 17:24:00,286 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_55_function_g__25_39_0
[2025-05-07 17:24:00,286 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:24:00,286 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:24:00,286 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:24:00,543 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:24:00,544 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:24:00,888 INFO  L?                        ?]: Removed 511 outVars from TransFormulas that were not future-live.
[2025-05-07 17:24:00,888 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:24:00,898 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:24:00,899 INFO  L312             CfgBuilder]: Removed 31 assume(true) statements.
[2025-05-07 17:24:00,899 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:24:00 BoogieIcfgContainer
[2025-05-07 17:24:00,899 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:24:00,900 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:24:00,901 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:24:00,903 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:24:00,903 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:24:00" (1/3) ...
[2025-05-07 17:24:00,904 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc23227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:24:00, skipping insertion in model container
[2025-05-07 17:24:00,904 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:24:00" (2/3) ...
[2025-05-07 17:24:00,904 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc23227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:24:00, skipping insertion in model container
[2025-05-07 17:24:00,904 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:24:00" (3/3) ...
[2025-05-07 17:24:00,905 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:24:00,916 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:24:00,918 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 59 procedures, 231 locations, 356 edges, 59 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:24:00,951 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:24:00,959 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;@56256ae7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:24:00,959 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:24:00,962 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 231 states, 92 states have (on average 1.1304347826086956) internal successors, (104), 104 states have internal predecessors, (104), 79 states have call successors, (84), 58 states have call predecessors, (84), 58 states have return successors, (84), 68 states have call predecessors, (84), 79 states have call successors, (84)
[2025-05-07 17:24:00,972 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:24:00,972 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:00,972 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]
[2025-05-07 17:24:00,972 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:00,976 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:00,976 INFO  L85        PathProgramCache]: Analyzing trace with hash -1833066137, now seen corresponding path program 1 times
[2025-05-07 17:24:00,981 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:00,982 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009519358]
[2025-05-07 17:24:00,982 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:00,982 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:01,043 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:24:01,062 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:24:01,062 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:01,063 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:01,236 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:24:01,237 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:01,237 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009519358]
[2025-05-07 17:24:01,237 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009519358] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:01,237 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:01,239 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:24:01,240 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949995741]
[2025-05-07 17:24:01,240 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:01,249 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:24:01,249 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:01,273 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:24:01,273 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:24:01,276 INFO  L87              Difference]: Start difference. First operand  has 231 states, 92 states have (on average 1.1304347826086956) internal successors, (104), 104 states have internal predecessors, (104), 79 states have call successors, (84), 58 states have call predecessors, (84), 58 states have return successors, (84), 68 states have call predecessors, (84), 79 states have call successors, (84) Second operand  has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:24:01,325 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:01,326 INFO  L93              Difference]: Finished difference Result 233 states and 275 transitions.
[2025-05-07 17:24:01,327 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:24:01,328 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 51
[2025-05-07 17:24:01,328 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:01,334 INFO  L225             Difference]: With dead ends: 233
[2025-05-07 17:24:01,334 INFO  L226             Difference]: Without dead ends: 226
[2025-05-07 17:24:01,336 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:24:01,338 INFO  L437           NwaCegarLoop]: 270 mSDtfsCounter, 1 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 799 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:24:01,338 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 799 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:01,348 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 226 states.
[2025-05-07 17:24:01,369 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224.
[2025-05-07 17:24:01,370 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 224 states, 91 states have (on average 1.098901098901099) internal successors, (100), 100 states have internal predecessors, (100), 74 states have call successors, (79), 58 states have call predecessors, (79), 58 states have return successors, (79), 65 states have call predecessors, (79), 74 states have call successors, (79)
[2025-05-07 17:24:01,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 258 transitions.
[2025-05-07 17:24:01,375 INFO  L79                 Accepts]: Start accepts. Automaton has 224 states and 258 transitions. Word has length 51
[2025-05-07 17:24:01,375 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:01,376 INFO  L485      AbstractCegarLoop]: Abstraction has 224 states and 258 transitions.
[2025-05-07 17:24:01,376 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:24:01,376 INFO  L278                IsEmpty]: Start isEmpty. Operand 224 states and 258 transitions.
[2025-05-07 17:24:01,378 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:24:01,378 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:01,378 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]
[2025-05-07 17:24:01,378 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:24:01,379 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:01,379 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:01,379 INFO  L85        PathProgramCache]: Analyzing trace with hash -794815244, now seen corresponding path program 1 times
[2025-05-07 17:24:01,379 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:01,379 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630432066]
[2025-05-07 17:24:01,379 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:01,379 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:01,403 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:24:01,426 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:24:01,427 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:01,427 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:01,578 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:24:01,578 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:01,578 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630432066]
[2025-05-07 17:24:01,578 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630432066] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:01,578 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:01,579 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:24:01,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788842590]
[2025-05-07 17:24:01,579 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:01,580 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:24:01,580 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:01,580 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:24:01,581 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:24:01,581 INFO  L87              Difference]: Start difference. First operand 224 states and 258 transitions. Second operand  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:24:01,622 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:01,622 INFO  L93              Difference]: Finished difference Result 228 states and 264 transitions.
[2025-05-07 17:24:01,622 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:24:01,623 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14) Word has length 51
[2025-05-07 17:24:01,623 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:01,624 INFO  L225             Difference]: With dead ends: 228
[2025-05-07 17:24:01,625 INFO  L226             Difference]: Without dead ends: 217
[2025-05-07 17:24:01,625 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:24:01,625 INFO  L437           NwaCegarLoop]: 256 mSDtfsCounter, 1 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:01,625 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1002 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:01,626 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 217 states.
[2025-05-07 17:24:01,634 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215.
[2025-05-07 17:24:01,634 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 215 states, 91 states have (on average 1.065934065934066) internal successors, (97), 97 states have internal predecessors, (97), 65 states have call successors, (70), 58 states have call predecessors, (70), 58 states have return successors, (70), 59 states have call predecessors, (70), 65 states have call successors, (70)
[2025-05-07 17:24:01,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 237 transitions.
[2025-05-07 17:24:01,636 INFO  L79                 Accepts]: Start accepts. Automaton has 215 states and 237 transitions. Word has length 51
[2025-05-07 17:24:01,636 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:01,636 INFO  L485      AbstractCegarLoop]: Abstraction has 215 states and 237 transitions.
[2025-05-07 17:24:01,637 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 4 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:24:01,637 INFO  L278                IsEmpty]: Start isEmpty. Operand 215 states and 237 transitions.
[2025-05-07 17:24:01,638 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2025-05-07 17:24:01,638 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:01,638 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]
[2025-05-07 17:24:01,638 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:24:01,638 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:01,639 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:01,639 INFO  L85        PathProgramCache]: Analyzing trace with hash 39215696, now seen corresponding path program 1 times
[2025-05-07 17:24:01,639 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:01,639 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196417195]
[2025-05-07 17:24:01,639 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:01,639 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:01,663 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes.
[2025-05-07 17:24:01,679 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements.
[2025-05-07 17:24:01,679 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:01,679 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:02,143 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:24:02,143 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:02,143 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196417195]
[2025-05-07 17:24:02,143 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196417195] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:02,143 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:02,143 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2025-05-07 17:24:02,143 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024290874]
[2025-05-07 17:24:02,143 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:02,144 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-05-07 17:24:02,144 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:02,144 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-05-07 17:24:02,144 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380
[2025-05-07 17:24:02,145 INFO  L87              Difference]: Start difference. First operand 215 states and 237 transitions. Second operand  has 20 states, 15 states have (on average 1.8) internal successors, (27), 17 states have internal predecessors, (27), 8 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (17), 14 states have call predecessors, (17), 8 states have call successors, (17)
[2025-05-07 17:24:02,506 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:02,506 INFO  L93              Difference]: Finished difference Result 225 states and 252 transitions.
[2025-05-07 17:24:02,507 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-05-07 17:24:02,507 INFO  L79                 Accepts]: Start accepts. Automaton has  has 20 states, 15 states have (on average 1.8) internal successors, (27), 17 states have internal predecessors, (27), 8 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (17), 14 states have call predecessors, (17), 8 states have call successors, (17) Word has length 61
[2025-05-07 17:24:02,507 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:02,508 INFO  L225             Difference]: With dead ends: 225
[2025-05-07 17:24:02,508 INFO  L226             Difference]: Without dead ends: 225
[2025-05-07 17:24:02,509 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552
[2025-05-07 17:24:02,509 INFO  L437           NwaCegarLoop]: 223 mSDtfsCounter, 6 mSDsluCounter, 3968 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4191 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:02,509 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4191 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:24:02,510 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 225 states.
[2025-05-07 17:24:02,519 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223.
[2025-05-07 17:24:02,519 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 223 states, 94 states have (on average 1.0638297872340425) internal successors, (100), 100 states have internal predecessors, (100), 67 states have call successors, (72), 58 states have call predecessors, (72), 61 states have return successors, (78), 64 states have call predecessors, (78), 67 states have call successors, (78)
[2025-05-07 17:24:02,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 250 transitions.
[2025-05-07 17:24:02,521 INFO  L79                 Accepts]: Start accepts. Automaton has 223 states and 250 transitions. Word has length 61
[2025-05-07 17:24:02,521 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:02,521 INFO  L485      AbstractCegarLoop]: Abstraction has 223 states and 250 transitions.
[2025-05-07 17:24:02,521 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 15 states have (on average 1.8) internal successors, (27), 17 states have internal predecessors, (27), 8 states have call successors, (17), 1 states have call predecessors, (17), 15 states have return successors, (17), 14 states have call predecessors, (17), 8 states have call successors, (17)
[2025-05-07 17:24:02,521 INFO  L278                IsEmpty]: Start isEmpty. Operand 223 states and 250 transitions.
[2025-05-07 17:24:02,522 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2025-05-07 17:24:02,522 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:02,523 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]
[2025-05-07 17:24:02,523 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:24:02,523 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:02,523 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:02,523 INFO  L85        PathProgramCache]: Analyzing trace with hash 151891256, now seen corresponding path program 1 times
[2025-05-07 17:24:02,523 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:02,523 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952085727]
[2025-05-07 17:24:02,523 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:02,523 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:02,546 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes.
[2025-05-07 17:24:02,558 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements.
[2025-05-07 17:24:02,558 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:02,558 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:02,648 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:24:02,648 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:02,648 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952085727]
[2025-05-07 17:24:02,648 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952085727] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:02,648 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:02,648 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:24:02,648 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475673137]
[2025-05-07 17:24:02,648 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:02,648 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:24:02,648 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:02,649 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:24:02,649 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:24:02,649 INFO  L87              Difference]: Start difference. First operand 223 states and 250 transitions. Second operand  has 8 states, 6 states have (on average 4.5) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17)
[2025-05-07 17:24:02,703 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:02,703 INFO  L93              Difference]: Finished difference Result 223 states and 248 transitions.
[2025-05-07 17:24:02,703 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:24:02,703 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 4.5) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17) Word has length 61
[2025-05-07 17:24:02,704 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:02,705 INFO  L225             Difference]: With dead ends: 223
[2025-05-07 17:24:02,705 INFO  L226             Difference]: Without dead ends: 222
[2025-05-07 17:24:02,705 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-05-07 17:24:02,705 INFO  L437           NwaCegarLoop]: 236 mSDtfsCounter, 2 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1630 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:02,706 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1630 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:02,706 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 222 states.
[2025-05-07 17:24:02,712 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222.
[2025-05-07 17:24:02,713 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 222 states, 94 states have (on average 1.0638297872340425) internal successors, (100), 100 states have internal predecessors, (100), 66 states have call successors, (71), 58 states have call predecessors, (71), 61 states have return successors, (75), 63 states have call predecessors, (75), 66 states have call successors, (75)
[2025-05-07 17:24:02,714 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 246 transitions.
[2025-05-07 17:24:02,714 INFO  L79                 Accepts]: Start accepts. Automaton has 222 states and 246 transitions. Word has length 61
[2025-05-07 17:24:02,714 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:02,714 INFO  L485      AbstractCegarLoop]: Abstraction has 222 states and 246 transitions.
[2025-05-07 17:24:02,714 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 4.5) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (17), 1 states have call predecessors, (17), 6 states have return successors, (17), 7 states have call predecessors, (17), 5 states have call successors, (17)
[2025-05-07 17:24:02,714 INFO  L278                IsEmpty]: Start isEmpty. Operand 222 states and 246 transitions.
[2025-05-07 17:24:02,715 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2025-05-07 17:24:02,715 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:02,715 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]
[2025-05-07 17:24:02,715 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:24:02,716 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:02,716 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:02,716 INFO  L85        PathProgramCache]: Analyzing trace with hash -845773587, now seen corresponding path program 1 times
[2025-05-07 17:24:02,716 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:02,716 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321679668]
[2025-05-07 17:24:02,716 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:02,716 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:02,743 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes.
[2025-05-07 17:24:02,756 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements.
[2025-05-07 17:24:02,756 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:02,756 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:03,272 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:24:03,273 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:03,273 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321679668]
[2025-05-07 17:24:03,273 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321679668] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:03,273 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:03,273 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20
[2025-05-07 17:24:03,273 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160436564]
[2025-05-07 17:24:03,273 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:03,273 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2025-05-07 17:24:03,273 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:03,274 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2025-05-07 17:24:03,274 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380
[2025-05-07 17:24:03,274 INFO  L87              Difference]: Start difference. First operand 222 states and 246 transitions. Second operand  has 20 states, 15 states have (on average 2.533333333333333) internal successors, (38), 17 states have internal predecessors, (38), 8 states have call successors, (24), 1 states have call predecessors, (24), 15 states have return successors, (24), 16 states have call predecessors, (24), 8 states have call successors, (24)
[2025-05-07 17:24:03,533 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:03,533 INFO  L93              Difference]: Finished difference Result 230 states and 259 transitions.
[2025-05-07 17:24:03,533 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2025-05-07 17:24:03,533 INFO  L79                 Accepts]: Start accepts. Automaton has  has 20 states, 15 states have (on average 2.533333333333333) internal successors, (38), 17 states have internal predecessors, (38), 8 states have call successors, (24), 1 states have call predecessors, (24), 15 states have return successors, (24), 16 states have call predecessors, (24), 8 states have call successors, (24) Word has length 86
[2025-05-07 17:24:03,534 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:03,535 INFO  L225             Difference]: With dead ends: 230
[2025-05-07 17:24:03,535 INFO  L226             Difference]: Without dead ends: 230
[2025-05-07 17:24:03,536 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552
[2025-05-07 17:24:03,536 INFO  L437           NwaCegarLoop]: 225 mSDtfsCounter, 6 mSDsluCounter, 4005 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:03,537 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4230 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:24:03,537 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 230 states.
[2025-05-07 17:24:03,548 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227.
[2025-05-07 17:24:03,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 227 states, 96 states have (on average 1.0625) internal successors, (102), 102 states have internal predecessors, (102), 67 states have call successors, (72), 58 states have call predecessors, (72), 63 states have return successors, (78), 66 states have call predecessors, (78), 67 states have call successors, (78)
[2025-05-07 17:24:03,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 252 transitions.
[2025-05-07 17:24:03,551 INFO  L79                 Accepts]: Start accepts. Automaton has 227 states and 252 transitions. Word has length 86
[2025-05-07 17:24:03,551 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:03,551 INFO  L485      AbstractCegarLoop]: Abstraction has 227 states and 252 transitions.
[2025-05-07 17:24:03,551 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 15 states have (on average 2.533333333333333) internal successors, (38), 17 states have internal predecessors, (38), 8 states have call successors, (24), 1 states have call predecessors, (24), 15 states have return successors, (24), 16 states have call predecessors, (24), 8 states have call successors, (24)
[2025-05-07 17:24:03,551 INFO  L278                IsEmpty]: Start isEmpty. Operand 227 states and 252 transitions.
[2025-05-07 17:24:03,553 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2025-05-07 17:24:03,553 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:03,553 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-05-07 17:24:03,553 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:24:03,553 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:03,554 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:03,554 INFO  L85        PathProgramCache]: Analyzing trace with hash -321797010, now seen corresponding path program 1 times
[2025-05-07 17:24:03,554 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:03,554 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241972658]
[2025-05-07 17:24:03,554 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:03,554 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:03,588 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes.
[2025-05-07 17:24:03,602 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements.
[2025-05-07 17:24:03,602 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:03,602 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:04,141 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-05-07 17:24:04,141 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:04,141 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241972658]
[2025-05-07 17:24:04,141 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241972658] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:24:04,141 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094968564]
[2025-05-07 17:24:04,141 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:04,142 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:24:04,143 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:24:04,145 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:24:04,146 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:24:04,439 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes.
[2025-05-07 17:24:04,522 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements.
[2025-05-07 17:24:04,522 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:04,522 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:04,527 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 78 conjuncts are in the unsatisfiable core
[2025-05-07 17:24:04,534 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:24:04,632 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-05-07 17:24:04,632 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:24:06,289 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-05-07 17:24:06,289 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094968564] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:24:06,289 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:24:06,289 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 26] total 41
[2025-05-07 17:24:06,289 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485229023]
[2025-05-07 17:24:06,289 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:24:06,290 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 41 states
[2025-05-07 17:24:06,290 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:06,290 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2025-05-07 17:24:06,291 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1534, Unknown=0, NotChecked=0, Total=1640
[2025-05-07 17:24:06,291 INFO  L87              Difference]: Start difference. First operand 227 states and 252 transitions. Second operand  has 41 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 34 states have internal predecessors, (50), 19 states have call successors, (31), 1 states have call predecessors, (31), 29 states have return successors, (40), 30 states have call predecessors, (40), 19 states have call successors, (40)
[2025-05-07 17:24:06,794 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:06,794 INFO  L93              Difference]: Finished difference Result 234 states and 266 transitions.
[2025-05-07 17:24:06,794 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-05-07 17:24:06,794 INFO  L79                 Accepts]: Start accepts. Automaton has  has 41 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 34 states have internal predecessors, (50), 19 states have call successors, (31), 1 states have call predecessors, (31), 29 states have return successors, (40), 30 states have call predecessors, (40), 19 states have call successors, (40) Word has length 86
[2025-05-07 17:24:06,795 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:06,796 INFO  L225             Difference]: With dead ends: 234
[2025-05-07 17:24:06,796 INFO  L226             Difference]: Without dead ends: 233
[2025-05-07 17:24:06,797 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=2019, Unknown=0, NotChecked=0, Total=2162
[2025-05-07 17:24:06,797 INFO  L437           NwaCegarLoop]: 229 mSDtfsCounter, 8 mSDsluCounter, 6100 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6329 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:06,798 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6329 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-05-07 17:24:06,798 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 233 states.
[2025-05-07 17:24:06,808 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230.
[2025-05-07 17:24:06,808 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 230 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 103 states have internal predecessors, (103), 68 states have call successors, (73), 58 states have call predecessors, (73), 64 states have return successors, (81), 68 states have call predecessors, (81), 68 states have call successors, (81)
[2025-05-07 17:24:06,809 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 257 transitions.
[2025-05-07 17:24:06,809 INFO  L79                 Accepts]: Start accepts. Automaton has 230 states and 257 transitions. Word has length 86
[2025-05-07 17:24:06,810 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:06,810 INFO  L485      AbstractCegarLoop]: Abstraction has 230 states and 257 transitions.
[2025-05-07 17:24:06,810 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 41 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 34 states have internal predecessors, (50), 19 states have call successors, (31), 1 states have call predecessors, (31), 29 states have return successors, (40), 30 states have call predecessors, (40), 19 states have call successors, (40)
[2025-05-07 17:24:06,810 INFO  L278                IsEmpty]: Start isEmpty. Operand 230 states and 257 transitions.
[2025-05-07 17:24:06,811 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2025-05-07 17:24:06,811 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:06,812 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]
[2025-05-07 17:24:06,817 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:24:07,013 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6
[2025-05-07 17:24:07,013 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:07,014 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:07,014 INFO  L85        PathProgramCache]: Analyzing trace with hash 717707253, now seen corresponding path program 1 times
[2025-05-07 17:24:07,014 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:07,014 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119523638]
[2025-05-07 17:24:07,014 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:07,015 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:07,111 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes.
[2025-05-07 17:24:07,138 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements.
[2025-05-07 17:24:07,139 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:07,139 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:07,591 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:24:07,591 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:07,591 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119523638]
[2025-05-07 17:24:07,591 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119523638] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:07,591 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:07,592 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26
[2025-05-07 17:24:07,592 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179977739]
[2025-05-07 17:24:07,592 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:07,592 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2025-05-07 17:24:07,592 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:07,593 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2025-05-07 17:24:07,593 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650
[2025-05-07 17:24:07,593 INFO  L87              Difference]: Start difference. First operand 230 states and 257 transitions. Second operand  has 26 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 22 states have internal predecessors, (37), 11 states have call successors, (24), 1 states have call predecessors, (24), 19 states have return successors, (24), 20 states have call predecessors, (24), 11 states have call successors, (24)
[2025-05-07 17:24:08,001 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:08,001 INFO  L93              Difference]: Finished difference Result 240 states and 276 transitions.
[2025-05-07 17:24:08,001 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. 
[2025-05-07 17:24:08,002 INFO  L79                 Accepts]: Start accepts. Automaton has  has 26 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 22 states have internal predecessors, (37), 11 states have call successors, (24), 1 states have call predecessors, (24), 19 states have return successors, (24), 20 states have call predecessors, (24), 11 states have call successors, (24) Word has length 86
[2025-05-07 17:24:08,002 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:08,003 INFO  L225             Difference]: With dead ends: 240
[2025-05-07 17:24:08,003 INFO  L226             Difference]: Without dead ends: 239
[2025-05-07 17:24:08,004 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=917, Unknown=0, NotChecked=0, Total=992
[2025-05-07 17:24:08,004 INFO  L437           NwaCegarLoop]: 218 mSDtfsCounter, 8 mSDsluCounter, 5168 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 5386 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:08,005 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 5386 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:24:08,005 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 239 states.
[2025-05-07 17:24:08,013 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 234.
[2025-05-07 17:24:08,014 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 234 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 104 states have internal predecessors, (104), 70 states have call successors, (75), 58 states have call predecessors, (75), 65 states have return successors, (86), 71 states have call predecessors, (86), 70 states have call successors, (86)
[2025-05-07 17:24:08,015 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 265 transitions.
[2025-05-07 17:24:08,016 INFO  L79                 Accepts]: Start accepts. Automaton has 234 states and 265 transitions. Word has length 86
[2025-05-07 17:24:08,016 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:08,016 INFO  L485      AbstractCegarLoop]: Abstraction has 234 states and 265 transitions.
[2025-05-07 17:24:08,016 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 22 states have internal predecessors, (37), 11 states have call successors, (24), 1 states have call predecessors, (24), 19 states have return successors, (24), 20 states have call predecessors, (24), 11 states have call successors, (24)
[2025-05-07 17:24:08,016 INFO  L278                IsEmpty]: Start isEmpty. Operand 234 states and 265 transitions.
[2025-05-07 17:24:08,017 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2025-05-07 17:24:08,018 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:08,018 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]
[2025-05-07 17:24:08,018 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:24:08,018 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:08,018 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:08,018 INFO  L85        PathProgramCache]: Analyzing trace with hash -1434138389, now seen corresponding path program 1 times
[2025-05-07 17:24:08,018 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:08,018 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344022558]
[2025-05-07 17:24:08,019 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:08,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:08,038 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes.
[2025-05-07 17:24:08,045 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements.
[2025-05-07 17:24:08,045 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:08,045 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:08,113 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:24:08,113 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:08,113 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344022558]
[2025-05-07 17:24:08,113 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344022558] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:08,113 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:08,113 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:24:08,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300495778]
[2025-05-07 17:24:08,113 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:08,114 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:24:08,114 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:08,114 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:24:08,114 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:24:08,114 INFO  L87              Difference]: Start difference. First operand 234 states and 265 transitions. Second operand  has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 6 states have call successors, (20), 1 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20)
[2025-05-07 17:24:08,167 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:08,167 INFO  L93              Difference]: Finished difference Result 239 states and 271 transitions.
[2025-05-07 17:24:08,168 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:24:08,168 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 6 states have call successors, (20), 1 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 71
[2025-05-07 17:24:08,168 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:08,169 INFO  L225             Difference]: With dead ends: 239
[2025-05-07 17:24:08,170 INFO  L226             Difference]: Without dead ends: 239
[2025-05-07 17:24:08,170 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-05-07 17:24:08,170 INFO  L437           NwaCegarLoop]: 232 mSDtfsCounter, 2 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:08,171 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1604 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:08,171 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 239 states.
[2025-05-07 17:24:08,178 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239.
[2025-05-07 17:24:08,178 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 239 states, 100 states have (on average 1.06) internal successors, (106), 106 states have internal predecessors, (106), 71 states have call successors, (76), 58 states have call predecessors, (76), 67 states have return successors, (89), 74 states have call predecessors, (89), 71 states have call successors, (89)
[2025-05-07 17:24:08,179 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 271 transitions.
[2025-05-07 17:24:08,179 INFO  L79                 Accepts]: Start accepts. Automaton has 239 states and 271 transitions. Word has length 71
[2025-05-07 17:24:08,180 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:08,180 INFO  L485      AbstractCegarLoop]: Abstraction has 239 states and 271 transitions.
[2025-05-07 17:24:08,180 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 5.166666666666667) internal successors, (31), 8 states have internal predecessors, (31), 6 states have call successors, (20), 1 states have call predecessors, (20), 6 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20)
[2025-05-07 17:24:08,180 INFO  L278                IsEmpty]: Start isEmpty. Operand 239 states and 271 transitions.
[2025-05-07 17:24:08,181 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 72
[2025-05-07 17:24:08,181 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:08,181 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]
[2025-05-07 17:24:08,181 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:24:08,181 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:08,181 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:08,181 INFO  L85        PathProgramCache]: Analyzing trace with hash -584384393, now seen corresponding path program 1 times
[2025-05-07 17:24:08,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:08,181 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604127232]
[2025-05-07 17:24:08,181 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:08,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:08,202 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes.
[2025-05-07 17:24:08,208 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements.
[2025-05-07 17:24:08,208 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:08,208 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:08,639 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:24:08,639 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:08,639 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604127232]
[2025-05-07 17:24:08,639 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604127232] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:08,639 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:08,639 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24
[2025-05-07 17:24:08,639 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970375293]
[2025-05-07 17:24:08,639 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:08,639 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2025-05-07 17:24:08,639 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:08,640 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2025-05-07 17:24:08,640 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552
[2025-05-07 17:24:08,640 INFO  L87              Difference]: Start difference. First operand 239 states and 271 transitions. Second operand  has 24 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 20 states have internal predecessors, (31), 9 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (20), 17 states have call predecessors, (20), 9 states have call successors, (20)
[2025-05-07 17:24:08,996 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:08,996 INFO  L93              Difference]: Finished difference Result 243 states and 277 transitions.
[2025-05-07 17:24:08,997 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2025-05-07 17:24:08,997 INFO  L79                 Accepts]: Start accepts. Automaton has  has 24 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 20 states have internal predecessors, (31), 9 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (20), 17 states have call predecessors, (20), 9 states have call successors, (20) Word has length 71
[2025-05-07 17:24:08,997 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:08,998 INFO  L225             Difference]: With dead ends: 243
[2025-05-07 17:24:08,998 INFO  L226             Difference]: Without dead ends: 243
[2025-05-07 17:24:08,998 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=740, Unknown=0, NotChecked=0, Total=812
[2025-05-07 17:24:08,999 INFO  L437           NwaCegarLoop]: 222 mSDtfsCounter, 6 mSDsluCounter, 4600 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4822 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:08,999 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4822 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:24:08,999 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 243 states.
[2025-05-07 17:24:09,003 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241.
[2025-05-07 17:24:09,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 241 states, 101 states have (on average 1.0594059405940595) internal successors, (107), 107 states have internal predecessors, (107), 71 states have call successors, (76), 58 states have call predecessors, (76), 68 states have return successors, (92), 75 states have call predecessors, (92), 71 states have call successors, (92)
[2025-05-07 17:24:09,005 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 275 transitions.
[2025-05-07 17:24:09,005 INFO  L79                 Accepts]: Start accepts. Automaton has 241 states and 275 transitions. Word has length 71
[2025-05-07 17:24:09,005 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:09,005 INFO  L485      AbstractCegarLoop]: Abstraction has 241 states and 275 transitions.
[2025-05-07 17:24:09,005 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 20 states have internal predecessors, (31), 9 states have call successors, (20), 1 states have call predecessors, (20), 18 states have return successors, (20), 17 states have call predecessors, (20), 9 states have call successors, (20)
[2025-05-07 17:24:09,005 INFO  L278                IsEmpty]: Start isEmpty. Operand 241 states and 275 transitions.
[2025-05-07 17:24:09,006 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2025-05-07 17:24:09,006 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:09,006 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, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:09,007 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:24:09,007 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:09,007 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:09,007 INFO  L85        PathProgramCache]: Analyzing trace with hash -1852571933, now seen corresponding path program 1 times
[2025-05-07 17:24:09,007 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:09,007 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129472878]
[2025-05-07 17:24:09,007 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:09,007 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:09,034 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes.
[2025-05-07 17:24:09,043 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements.
[2025-05-07 17:24:09,043 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:09,043 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:09,614 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:24:09,614 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:09,614 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129472878]
[2025-05-07 17:24:09,614 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129472878] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:09,614 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:24:09,614 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30
[2025-05-07 17:24:09,615 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990648131]
[2025-05-07 17:24:09,615 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:09,615 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2025-05-07 17:24:09,615 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:09,616 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2025-05-07 17:24:09,616 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870
[2025-05-07 17:24:09,616 INFO  L87              Difference]: Start difference. First operand 241 states and 275 transitions. Second operand  has 30 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 25 states have internal predecessors, (41), 13 states have call successors, (27), 1 states have call predecessors, (27), 22 states have return successors, (27), 22 states have call predecessors, (27), 13 states have call successors, (27)
[2025-05-07 17:24:10,186 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:10,187 INFO  L93              Difference]: Finished difference Result 253 states and 297 transitions.
[2025-05-07 17:24:10,187 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2025-05-07 17:24:10,187 INFO  L79                 Accepts]: Start accepts. Automaton has  has 30 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 25 states have internal predecessors, (41), 13 states have call successors, (27), 1 states have call predecessors, (27), 22 states have return successors, (27), 22 states have call predecessors, (27), 13 states have call successors, (27) Word has length 96
[2025-05-07 17:24:10,187 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:10,188 INFO  L225             Difference]: With dead ends: 253
[2025-05-07 17:24:10,188 INFO  L226             Difference]: Without dead ends: 253
[2025-05-07 17:24:10,188 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=1240, Unknown=0, NotChecked=0, Total=1332
[2025-05-07 17:24:10,189 INFO  L437           NwaCegarLoop]: 218 mSDtfsCounter, 8 mSDsluCounter, 5990 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 6208 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:10,189 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 6208 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-05-07 17:24:10,189 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 253 states.
[2025-05-07 17:24:10,194 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 247.
[2025-05-07 17:24:10,194 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 247 states, 103 states have (on average 1.058252427184466) internal successors, (109), 109 states have internal predecessors, (109), 73 states have call successors, (78), 58 states have call predecessors, (78), 70 states have return successors, (97), 79 states have call predecessors, (97), 73 states have call successors, (97)
[2025-05-07 17:24:10,195 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 284 transitions.
[2025-05-07 17:24:10,195 INFO  L79                 Accepts]: Start accepts. Automaton has 247 states and 284 transitions. Word has length 96
[2025-05-07 17:24:10,195 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:10,195 INFO  L485      AbstractCegarLoop]: Abstraction has 247 states and 284 transitions.
[2025-05-07 17:24:10,195 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 25 states have internal predecessors, (41), 13 states have call successors, (27), 1 states have call predecessors, (27), 22 states have return successors, (27), 22 states have call predecessors, (27), 13 states have call successors, (27)
[2025-05-07 17:24:10,195 INFO  L278                IsEmpty]: Start isEmpty. Operand 247 states and 284 transitions.
[2025-05-07 17:24:10,196 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2025-05-07 17:24:10,196 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:10,196 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-05-07 17:24:10,196 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:24:10,196 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:10,196 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:10,196 INFO  L85        PathProgramCache]: Analyzing trace with hash -1013719160, now seen corresponding path program 1 times
[2025-05-07 17:24:10,196 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:10,196 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226797765]
[2025-05-07 17:24:10,197 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:10,197 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:10,219 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes.
[2025-05-07 17:24:10,223 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements.
[2025-05-07 17:24:10,223 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:10,223 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:10,338 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-05-07 17:24:10,338 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:10,338 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226797765]
[2025-05-07 17:24:10,338 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226797765] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:24:10,338 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374687608]
[2025-05-07 17:24:10,338 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:10,339 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:24:10,340 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:24:10,342 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:24:10,343 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-05-07 17:24:10,679 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes.
[2025-05-07 17:24:10,769 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements.
[2025-05-07 17:24:10,769 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:10,769 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:10,773 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1278 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-05-07 17:24:10,775 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:24:10,805 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:24:10,805 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:24:10,805 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [374687608] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:24:10,805 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:24:10,805 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11
[2025-05-07 17:24:10,806 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91558832]
[2025-05-07 17:24:10,806 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:24:10,806 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:24:10,806 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:10,806 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:24:10,806 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:24:10,806 INFO  L87              Difference]: Start difference. First operand 247 states and 284 transitions. Second operand  has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 5 states have call successors, (27), 2 states have call predecessors, (27), 5 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27)
[2025-05-07 17:24:10,823 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:10,823 INFO  L93              Difference]: Finished difference Result 143 states and 162 transitions.
[2025-05-07 17:24:10,824 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:24:10,824 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 5 states have call successors, (27), 2 states have call predecessors, (27), 5 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27) Word has length 96
[2025-05-07 17:24:10,824 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:10,824 INFO  L225             Difference]: With dead ends: 143
[2025-05-07 17:24:10,824 INFO  L226             Difference]: Without dead ends: 113
[2025-05-07 17:24:10,825 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:24:10,825 INFO  L437           NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:10,825 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 646 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:24:10,825 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2025-05-07 17:24:10,827 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113.
[2025-05-07 17:24:10,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 113 states, 47 states have (on average 1.0425531914893618) internal successors, (49), 49 states have internal predecessors, (49), 33 states have call successors, (35), 25 states have call predecessors, (35), 32 states have return successors, (46), 38 states have call predecessors, (46), 33 states have call successors, (46)
[2025-05-07 17:24:10,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions.
[2025-05-07 17:24:10,828 INFO  L79                 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 96
[2025-05-07 17:24:10,828 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:10,828 INFO  L485      AbstractCegarLoop]: Abstraction has 113 states and 130 transitions.
[2025-05-07 17:24:10,828 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 5 states have call successors, (27), 2 states have call predecessors, (27), 5 states have return successors, (27), 5 states have call predecessors, (27), 5 states have call successors, (27)
[2025-05-07 17:24:10,829 INFO  L278                IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions.
[2025-05-07 17:24:10,829 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-05-07 17:24:10,829 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:10,829 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-05-07 17:24:10,836 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-05-07 17:24:11,030 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:24:11,031 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:11,032 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:11,032 INFO  L85        PathProgramCache]: Analyzing trace with hash -1222448986, now seen corresponding path program 1 times
[2025-05-07 17:24:11,032 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:11,032 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218861339]
[2025-05-07 17:24:11,033 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:11,033 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:11,120 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-05-07 17:24:11,128 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-05-07 17:24:11,128 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:11,128 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:11,653 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-05-07 17:24:11,653 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:11,653 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218861339]
[2025-05-07 17:24:11,653 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218861339] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:24:11,654 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539923601]
[2025-05-07 17:24:11,654 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:11,654 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:24:11,655 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:24:11,657 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:24:11,657 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-05-07 17:24:12,067 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-05-07 17:24:12,231 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-05-07 17:24:12,231 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:12,231 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:12,235 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1484 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-05-07 17:24:12,238 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:24:12,319 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2025-05-07 17:24:12,319 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:24:12,916 INFO  L134       CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2025-05-07 17:24:12,916 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [539923601] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:24:12,917 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:24:12,917 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 6, 6] total 28
[2025-05-07 17:24:12,917 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680878171]
[2025-05-07 17:24:12,917 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:24:12,918 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2025-05-07 17:24:12,918 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:12,918 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2025-05-07 17:24:12,919 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756
[2025-05-07 17:24:12,919 INFO  L87              Difference]: Start difference. First operand 113 states and 130 transitions. Second operand  has 28 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 25 states have internal predecessors, (75), 11 states have call successors, (43), 2 states have call predecessors, (43), 21 states have return successors, (56), 24 states have call predecessors, (56), 11 states have call successors, (56)
[2025-05-07 17:24:13,312 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:13,312 INFO  L93              Difference]: Finished difference Result 118 states and 137 transitions.
[2025-05-07 17:24:13,312 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-05-07 17:24:13,313 INFO  L79                 Accepts]: Start accepts. Automaton has  has 28 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 25 states have internal predecessors, (75), 11 states have call successors, (43), 2 states have call predecessors, (43), 21 states have return successors, (56), 24 states have call predecessors, (56), 11 states have call successors, (56) Word has length 111
[2025-05-07 17:24:13,313 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:13,313 INFO  L225             Difference]: With dead ends: 118
[2025-05-07 17:24:13,313 INFO  L226             Difference]: Without dead ends: 110
[2025-05-07 17:24:13,314 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 221 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=1233, Unknown=0, NotChecked=0, Total=1332
[2025-05-07 17:24:13,314 INFO  L437           NwaCegarLoop]: 90 mSDtfsCounter, 13 mSDsluCounter, 2184 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2274 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:13,314 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2274 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:24:13,314 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 110 states.
[2025-05-07 17:24:13,316 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104.
[2025-05-07 17:24:13,317 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 104 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 31 states have call successors, (32), 24 states have call predecessors, (32), 29 states have return successors, (40), 34 states have call predecessors, (40), 31 states have call successors, (40)
[2025-05-07 17:24:13,317 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions.
[2025-05-07 17:24:13,317 INFO  L79                 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 111
[2025-05-07 17:24:13,317 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:13,317 INFO  L485      AbstractCegarLoop]: Abstraction has 104 states and 117 transitions.
[2025-05-07 17:24:13,317 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 21 states have (on average 3.5714285714285716) internal successors, (75), 25 states have internal predecessors, (75), 11 states have call successors, (43), 2 states have call predecessors, (43), 21 states have return successors, (56), 24 states have call predecessors, (56), 11 states have call successors, (56)
[2025-05-07 17:24:13,317 INFO  L278                IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions.
[2025-05-07 17:24:13,318 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-05-07 17:24:13,318 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:24:13,318 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-05-07 17:24:13,325 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-05-07 17:24:13,519 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:24:13,520 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:24:13,521 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:24:13,521 INFO  L85        PathProgramCache]: Analyzing trace with hash 1812748053, now seen corresponding path program 1 times
[2025-05-07 17:24:13,521 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:24:13,521 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330299163]
[2025-05-07 17:24:13,521 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:13,522 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:24:13,563 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-05-07 17:24:13,572 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-05-07 17:24:13,572 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:13,573 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:14,186 INFO  L134       CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2025-05-07 17:24:14,186 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:24:14,186 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330299163]
[2025-05-07 17:24:14,186 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330299163] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:24:14,186 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602381654]
[2025-05-07 17:24:14,187 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:24:14,187 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:24:14,188 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:24:14,189 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:24:14,190 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-05-07 17:24:14,533 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-05-07 17:24:14,625 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-05-07 17:24:14,625 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:24:14,625 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:24:14,630 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1483 conjuncts, 100 conjuncts are in the unsatisfiable core
[2025-05-07 17:24:14,634 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:24:14,693 INFO  L134       CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2025-05-07 17:24:14,693 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:24:16,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-05-07 17:24:16,541 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602381654] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:24:16,541 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:24:16,541 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 31] total 51
[2025-05-07 17:24:16,541 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332852562]
[2025-05-07 17:24:16,541 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:24:16,542 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 51 states
[2025-05-07 17:24:16,542 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:24:16,542 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants.
[2025-05-07 17:24:16,543 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=2417, Unknown=0, NotChecked=0, Total=2550
[2025-05-07 17:24:16,543 INFO  L87              Difference]: Start difference. First operand 104 states and 117 transitions. Second operand  has 51 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 44 states have internal predecessors, (66), 23 states have call successors, (42), 1 states have call predecessors, (42), 37 states have return successors, (54), 40 states have call predecessors, (54), 23 states have call successors, (54)
[2025-05-07 17:24:17,066 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:24:17,066 INFO  L93              Difference]: Finished difference Result 98 states and 110 transitions.
[2025-05-07 17:24:17,066 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2025-05-07 17:24:17,067 INFO  L79                 Accepts]: Start accepts. Automaton has  has 51 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 44 states have internal predecessors, (66), 23 states have call successors, (42), 1 states have call predecessors, (42), 37 states have return successors, (54), 40 states have call predecessors, (54), 23 states have call successors, (54) Word has length 111
[2025-05-07 17:24:17,067 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:24:17,067 INFO  L225             Difference]: With dead ends: 98
[2025-05-07 17:24:17,067 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:24:17,067 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=3130, Unknown=0, NotChecked=0, Total=3306
[2025-05-07 17:24:17,068 INFO  L437           NwaCegarLoop]: 74 mSDtfsCounter, 7 mSDsluCounter, 2616 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:24:17,068 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2690 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-05-07 17:24:17,068 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:24:17,068 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:24:17,068 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:24:17,068 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:24:17,068 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111
[2025-05-07 17:24:17,068 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:24:17,068 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:24:17,069 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 51 states, 37 states have (on average 1.7837837837837838) internal successors, (66), 44 states have internal predecessors, (66), 23 states have call successors, (42), 1 states have call predecessors, (42), 37 states have return successors, (54), 40 states have call predecessors, (54), 23 states have call successors, (54)
[2025-05-07 17:24:17,069 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:24:17,069 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:24:17,070 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:24:17,075 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-05-07 17:24:17,271 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-05-07 17:24:17,280 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:24:17,286 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:24:17,293 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:24:17 BoogieIcfgContainer
[2025-05-07 17:24:17,293 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:24:17,294 INFO  L158              Benchmark]: Toolchain (without parser) took 17179.50ms. Allocated memory was 234.9MB in the beginning and 369.1MB in the end (delta: 134.2MB). Free memory was 129.7MB in the beginning and 209.1MB in the end (delta: -79.4MB). Peak memory consumption was 65.9MB. Max. memory is 33.6GB.
[2025-05-07 17:24:17,295 INFO  L158              Benchmark]: SmtParser took 0.28ms. Allocated memory is still 234.9MB. Free memory is still 172.1MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:24:17,295 INFO  L158              Benchmark]: ChcToBoogie took 41.59ms. Allocated memory is still 234.9MB. Free memory was 129.7MB in the beginning and 124.6MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:24:17,296 INFO  L158              Benchmark]: Boogie Preprocessor took 78.74ms. Allocated memory is still 234.9MB. Free memory was 124.5MB in the beginning and 192.7MB in the end (delta: -68.1MB). Peak memory consumption was 26.6MB. Max. memory is 33.6GB.
[2025-05-07 17:24:17,296 INFO  L158              Benchmark]: RCFGBuilder took 663.33ms. Allocated memory is still 234.9MB. Free memory was 192.7MB in the beginning and 119.8MB in the end (delta: 72.9MB). Peak memory consumption was 67.1MB. Max. memory is 33.6GB.
[2025-05-07 17:24:17,297 INFO  L158              Benchmark]: TraceAbstraction took 16392.39ms. Allocated memory was 234.9MB in the beginning and 369.1MB in the end (delta: 134.2MB). Free memory was 118.9MB in the beginning and 209.1MB in the end (delta: -90.2MB). Peak memory consumption was 39.3MB. Max. memory is 33.6GB.
[2025-05-07 17:24:17,300 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.28ms. Allocated memory is still 234.9MB. Free memory is still 172.1MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 41.59ms. Allocated memory is still 234.9MB. Free memory was 129.7MB in the beginning and 124.6MB in the end (delta: 5.1MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 78.74ms. Allocated memory is still 234.9MB. Free memory was 124.5MB in the beginning and 192.7MB in the end (delta: -68.1MB). Peak memory consumption was 26.6MB. Max. memory is 33.6GB.
 * RCFGBuilder took 663.33ms. Allocated memory is still 234.9MB. Free memory was 192.7MB in the beginning and 119.8MB in the end (delta: 72.9MB). Peak memory consumption was 67.1MB. Max. memory is 33.6GB.
 * TraceAbstraction took 16392.39ms. Allocated memory was 234.9MB in the beginning and 369.1MB in the end (delta: 134.2MB). Free memory was 118.9MB in the beginning and 209.1MB in the end (delta: -90.2MB). Peak memory consumption was 39.3MB. 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 59 procedures, 231 locations, 356 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 150 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 41811 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39186 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4936 IncrementalHoareTripleChecker+Invalid, 4991 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 2625 mSDtfsCounter, 4936 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1006 GetRequests, 703 SyntacticMatches, 3 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=10, InterpolantAutomatonStates: 233, 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, 13 MinimizatonAttempts, 31 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 1442 NumberOfCodeBlocks, 1442 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1730 ConstructedInterpolants, 0 QuantifiedInterpolants, 3497 SizeOfPredicates, 17 NumberOfNonLiveVariables, 5377 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 220/268 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:24:17,320 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
