./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/try_catch/try_nested_2.sol_1_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:26:22,720 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:26:22,770 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff5be76c-c003-4c07-852a-9290f3969448/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:26:22,774 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:26:22,774 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:26:22,792 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:26:22,792 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:26:22,793 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:26:22,793 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:26:22,793 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:26:22,793 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:26:22,793 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:26:22,794 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:26:22,794 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:26:22,794 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:26:22,794 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:26:22,794 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:26:22,794 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:26:22,794 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:26:22,794 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:26:22,795 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:26:22,795 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:26:22,795 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:26:22,795 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:26:22,795 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:26:22,795 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:26:22,796 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:26:22,995 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:26:23,002 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:26:23,004 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:26:23,005 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:26:23,005 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:26:23,006 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff5be76c-c003-4c07-852a-9290f3969448/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/try_catch/try_nested_2.sol_1_no_adts_000.smt2
[2025-05-07 17:26:23,007 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:26:23,010 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:26:23,277 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff5be76c-c003-4c07-852a-9290f3969448/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/try_catch/try_nested_2.sol_1_no_adts_000.smt2
[2025-05-07 17:26:23,280 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:26:23,280 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:26:23,281 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:26:23,281 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:26:23,281 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:26:23,283 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:26:23" (1/1) ...
[2025-05-07 17:26:23,316 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:23 Unit
[2025-05-07 17:26:23,317 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:26:23,317 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:26:23,317 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:26:23,318 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:26:23,329 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:23" (1/1) ...
[2025-05-07 17:26:23,329 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:23" (1/1) ...
[2025-05-07 17:26:23,351 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:23" (1/1) ...
[2025-05-07 17:26:23,351 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:23" (1/1) ...
[2025-05-07 17:26:23,358 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:23" (1/1) ...
[2025-05-07 17:26:23,359 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:23" (1/1) ...
[2025-05-07 17:26:23,360 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:23" (1/1) ...
[2025-05-07 17:26:23,363 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:23" (1/1) ...
[2025-05-07 17:26:23,364 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:23" (1/1) ...
[2025-05-07 17:26:23,377 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:26:23,378 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:26:23,378 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:26:23,378 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:26:23,379 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:23" (1/1) ...
[2025-05-07 17:26:23,380 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:26:23,389 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:26:23,398 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:26:23,401 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:26:23,411 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:26:23,411 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:26:23,411 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:26:23,411 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_4_0 given in one single declaration
[2025-05-07 17:26:23,412 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_4_0
[2025-05-07 17:26:23,412 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_4_0
[2025-05-07 17:26:23,412 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_6_function_f__74_75_0 given in one single declaration
[2025-05-07 17:26:23,412 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_6_function_f__74_75_0
[2025-05-07 17:26:23,412 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_6_function_f__74_75_0
[2025-05-07 17:26:23,412 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_26_function_f__74_75_0 given in one single declaration
[2025-05-07 17:26:23,412 INFO  L130     BoogieDeclarations]: Found specification of procedure block_26_function_f__74_75_0
[2025-05-07 17:26:23,412 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_26_function_f__74_75_0
[2025-05-07 17:26:23,412 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_5_function_f__74_75_0 given in one single declaration
[2025-05-07 17:26:23,412 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_5_function_f__74_75_0
[2025-05-07 17:26:23,412 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_5_function_f__74_75_0
[2025-05-07 17:26:23,412 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_25_function_f__74_75_0 given in one single declaration
[2025-05-07 17:26:23,413 INFO  L130     BoogieDeclarations]: Found specification of procedure block_25_function_f__74_75_0
[2025-05-07 17:26:23,413 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_25_function_f__74_75_0
[2025-05-07 17:26:23,413 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_15_f_73_75_0 given in one single declaration
[2025-05-07 17:26:23,413 INFO  L130     BoogieDeclarations]: Found specification of procedure block_15_f_73_75_0
[2025-05-07 17:26:23,413 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_15_f_73_75_0
[2025-05-07 17:26:23,413 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_17_try_clause_55f_55_75_0 given in one single declaration
[2025-05-07 17:26:23,413 INFO  L130     BoogieDeclarations]: Found specification of procedure block_17_try_clause_55f_55_75_0
[2025-05-07 17:26:23,413 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_17_try_clause_55f_55_75_0
[2025-05-07 17:26:23,413 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_20_f_73_75_0 given in one single declaration
[2025-05-07 17:26:23,413 INFO  L130     BoogieDeclarations]: Found specification of procedure block_20_f_73_75_0
[2025-05-07 17:26:23,413 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_20_f_73_75_0
[2025-05-07 17:26:23,413 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_21_try_clause_40f_40_75_0 given in one single declaration
[2025-05-07 17:26:23,413 INFO  L130     BoogieDeclarations]: Found specification of procedure block_21_try_clause_40f_40_75_0
[2025-05-07 17:26:23,414 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_21_try_clause_40f_40_75_0
[2025-05-07 17:26:23,414 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_22_try_clause_46f_46_75_0 given in one single declaration
[2025-05-07 17:26:23,414 INFO  L130     BoogieDeclarations]: Found specification of procedure block_22_try_clause_46f_46_75_0
[2025-05-07 17:26:23,414 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_22_try_clause_46f_46_75_0
[2025-05-07 17:26:23,414 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_13_return_function_f__74_75_0 given in one single declaration
[2025-05-07 17:26:23,414 INFO  L130     BoogieDeclarations]: Found specification of procedure block_13_return_function_f__74_75_0
[2025-05-07 17:26:23,414 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_13_return_function_f__74_75_0
[2025-05-07 17:26:23,414 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_18_function_g__8_75_0 given in one single declaration
[2025-05-07 17:26:23,414 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_18_function_g__8_75_0
[2025-05-07 17:26:23,414 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_18_function_g__8_75_0
[2025-05-07 17:26:23,414 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_3_function_g__8_75_0 given in one single declaration
[2025-05-07 17:26:23,414 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_3_function_g__8_75_0
[2025-05-07 17:26:23,414 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_3_function_g__8_75_0
[2025-05-07 17:26:23,414 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_9_return_function_g__8_75_0 given in one single declaration
[2025-05-07 17:26:23,415 INFO  L130     BoogieDeclarations]: Found specification of procedure block_9_return_function_g__8_75_0
[2025-05-07 17:26:23,415 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_9_return_function_g__8_75_0
[2025-05-07 17:26:23,415 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_8_g_7_75_0 given in one single declaration
[2025-05-07 17:26:23,415 INFO  L130     BoogieDeclarations]: Found specification of procedure block_8_g_7_75_0
[2025-05-07 17:26:23,415 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_8_g_7_75_0
[2025-05-07 17:26:23,415 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_7_function_g__8_75_0 given in one single declaration
[2025-05-07 17:26:23,415 INFO  L130     BoogieDeclarations]: Found specification of procedure block_7_function_g__8_75_0
[2025-05-07 17:26:23,415 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_7_function_g__8_75_0
[2025-05-07 17:26:23,415 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_14_try_header_f_56_75_0 given in one single declaration
[2025-05-07 17:26:23,415 INFO  L130     BoogieDeclarations]: Found specification of procedure block_14_try_header_f_56_75_0
[2025-05-07 17:26:23,415 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_14_try_header_f_56_75_0
[2025-05-07 17:26:23,415 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_12_f_73_75_0 given in one single declaration
[2025-05-07 17:26:23,415 INFO  L130     BoogieDeclarations]: Found specification of procedure block_12_f_73_75_0
[2025-05-07 17:26:23,415 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_12_f_73_75_0
[2025-05-07 17:26:23,416 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_11_function_f__74_75_0 given in one single declaration
[2025-05-07 17:26:23,416 INFO  L130     BoogieDeclarations]: Found specification of procedure block_11_function_f__74_75_0
[2025-05-07 17:26:23,416 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_11_function_f__74_75_0
[2025-05-07 17:26:23,416 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_23_function_g__8_75_0 given in one single declaration
[2025-05-07 17:26:23,416 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_23_function_g__8_75_0
[2025-05-07 17:26:23,416 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_23_function_g__8_75_0
[2025-05-07 17:26:23,416 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_19_try_header_f_47_75_0 given in one single declaration
[2025-05-07 17:26:23,416 INFO  L130     BoogieDeclarations]: Found specification of procedure block_19_try_header_f_47_75_0
[2025-05-07 17:26:23,416 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_19_try_header_f_47_75_0
[2025-05-07 17:26:23,416 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_16_try_clause_49f_49_75_0 given in one single declaration
[2025-05-07 17:26:23,416 INFO  L130     BoogieDeclarations]: Found specification of procedure block_16_try_clause_49f_49_75_0
[2025-05-07 17:26:23,416 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_16_try_clause_49f_49_75_0
[2025-05-07 17:26:23,416 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_24_function_f__74_75_0 given in one single declaration
[2025-05-07 17:26:23,417 INFO  L130     BoogieDeclarations]: Found specification of procedure block_24_function_f__74_75_0
[2025-05-07 17:26:23,417 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_24_function_f__74_75_0
[2025-05-07 17:26:23,417 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_0_C_75_0 given in one single declaration
[2025-05-07 17:26:23,417 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_0_C_75_0
[2025-05-07 17:26:23,417 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_0_C_75_0
[2025-05-07 17:26:23,417 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_2_C_75_0 given in one single declaration
[2025-05-07 17:26:23,417 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_2_C_75_0
[2025-05-07 17:26:23,417 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_2_C_75_0
[2025-05-07 17:26:23,417 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_30_C_75_0 given in one single declaration
[2025-05-07 17:26:23,417 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_30_C_75_0
[2025-05-07 17:26:23,417 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_30_C_75_0
[2025-05-07 17:26:23,417 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_27_C_75_0 given in one single declaration
[2025-05-07 17:26:23,417 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_27_C_75_0
[2025-05-07 17:26:23,417 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_27_C_75_0
[2025-05-07 17:26:23,417 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_29_C_75_0 given in one single declaration
[2025-05-07 17:26:23,418 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_29_C_75_0
[2025-05-07 17:26:23,418 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_29_C_75_0
[2025-05-07 17:26:23,418 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_28_C_75_0 given in one single declaration
[2025-05-07 17:26:23,418 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_28_C_75_0
[2025-05-07 17:26:23,418 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_28_C_75_0
[2025-05-07 17:26:23,418 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_4_function_g__8_75_0 given in one single declaration
[2025-05-07 17:26:23,418 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_4_function_g__8_75_0
[2025-05-07 17:26:23,418 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_4_function_g__8_75_0
[2025-05-07 17:26:23,418 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_10_function_g__8_75_0 given in one single declaration
[2025-05-07 17:26:23,418 INFO  L130     BoogieDeclarations]: Found specification of procedure block_10_function_g__8_75_0
[2025-05-07 17:26:23,418 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_10_function_g__8_75_0
[2025-05-07 17:26:23,418 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:26:23,418 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:26:23,418 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:26:23,584 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:26:23,597 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:26:23,837 INFO  L?                        ?]: Removed 272 outVars from TransFormulas that were not future-live.
[2025-05-07 17:26:23,837 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:26:23,846 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:26:23,846 INFO  L312             CfgBuilder]: Removed 14 assume(true) statements.
[2025-05-07 17:26:23,847 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:26:23 BoogieIcfgContainer
[2025-05-07 17:26:23,847 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:26:23,849 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:26:23,849 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:26:23,852 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:26:23,853 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:26:23" (1/3) ...
[2025-05-07 17:26:23,853 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdec3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:26:23, skipping insertion in model container
[2025-05-07 17:26:23,853 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:26:23" (2/3) ...
[2025-05-07 17:26:23,853 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bdec3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:26:23, skipping insertion in model container
[2025-05-07 17:26:23,854 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:26:23" (3/3) ...
[2025-05-07 17:26:23,855 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:26:23,870 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:26:23,872 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 33 procedures, 133 locations, 203 edges, 33 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:26:23,903 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:26:23,910 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;@2a00e5c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:26:23,910 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:26:23,913 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 133 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 62 states have internal predecessors, (62), 45 states have call successors, (47), 32 states have call predecessors, (47), 32 states have return successors, (47), 38 states have call predecessors, (47), 45 states have call successors, (47)
[2025-05-07 17:26:23,921 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2025-05-07 17:26:23,921 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:23,921 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]
[2025-05-07 17:26:23,922 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:23,925 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:23,925 INFO  L85        PathProgramCache]: Analyzing trace with hash -2110541144, now seen corresponding path program 1 times
[2025-05-07 17:26:23,930 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:23,931 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220179393]
[2025-05-07 17:26:23,931 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:23,931 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:23,990 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes.
[2025-05-07 17:26:24,010 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements.
[2025-05-07 17:26:24,010 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:24,010 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:24,196 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:26:24,197 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:24,197 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220179393]
[2025-05-07 17:26:24,197 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220179393] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:24,197 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:24,199 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:24,200 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493058376]
[2025-05-07 17:26:24,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:24,204 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:24,204 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:24,241 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:24,241 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:24,244 INFO  L87              Difference]: Start difference. First operand  has 133 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 62 states have internal predecessors, (62), 45 states have call successors, (47), 32 states have call predecessors, (47), 32 states have return successors, (47), 38 states have call predecessors, (47), 45 states have call successors, (47) Second operand  has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 4 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:26:24,298 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:24,298 INFO  L93              Difference]: Finished difference Result 135 states and 159 transitions.
[2025-05-07 17:26:24,299 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:24,301 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 4 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 69
[2025-05-07 17:26:24,301 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:24,310 INFO  L225             Difference]: With dead ends: 135
[2025-05-07 17:26:24,310 INFO  L226             Difference]: Without dead ends: 131
[2025-05-07 17:26:24,311 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:26:24,313 INFO  L437           NwaCegarLoop]: 155 mSDtfsCounter, 1 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:24,314 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 457 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:24,325 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 131 states.
[2025-05-07 17:26:24,344 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129.
[2025-05-07 17:26:24,345 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 59 states have internal predecessors, (59), 43 states have call successors, (45), 32 states have call predecessors, (45), 32 states have return successors, (45), 37 states have call predecessors, (45), 43 states have call successors, (45)
[2025-05-07 17:26:24,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions.
[2025-05-07 17:26:24,350 INFO  L79                 Accepts]: Start accepts. Automaton has 129 states and 149 transitions. Word has length 69
[2025-05-07 17:26:24,350 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:24,350 INFO  L485      AbstractCegarLoop]: Abstraction has 129 states and 149 transitions.
[2025-05-07 17:26:24,350 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 4 states have call successors, (19), 1 states have call predecessors, (19), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:26:24,350 INFO  L278                IsEmpty]: Start isEmpty. Operand 129 states and 149 transitions.
[2025-05-07 17:26:24,352 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 70
[2025-05-07 17:26:24,353 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:24,353 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]
[2025-05-07 17:26:24,353 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:26:24,353 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:24,354 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:24,354 INFO  L85        PathProgramCache]: Analyzing trace with hash -1948313172, now seen corresponding path program 1 times
[2025-05-07 17:26:24,354 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:24,354 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985296753]
[2025-05-07 17:26:24,354 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:24,355 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:24,396 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes.
[2025-05-07 17:26:24,449 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements.
[2025-05-07 17:26:24,449 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:24,449 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:24,616 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:26:24,616 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:24,616 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985296753]
[2025-05-07 17:26:24,616 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985296753] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:24,616 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:24,617 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:26:24,617 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632003160]
[2025-05-07 17:26:24,617 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:24,618 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:26:24,618 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:24,619 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:26:24,619 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:26:24,619 INFO  L87              Difference]: Start difference. First operand 129 states and 149 transitions. Second operand  has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (19), 1 states have call predecessors, (19), 6 states have return successors, (19), 7 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:26:24,713 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:24,713 INFO  L93              Difference]: Finished difference Result 131 states and 150 transitions.
[2025-05-07 17:26:24,714 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:26:24,714 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (19), 1 states have call predecessors, (19), 6 states have return successors, (19), 7 states have call predecessors, (19), 4 states have call successors, (19) Word has length 69
[2025-05-07 17:26:24,714 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:24,715 INFO  L225             Difference]: With dead ends: 131
[2025-05-07 17:26:24,715 INFO  L226             Difference]: Without dead ends: 129
[2025-05-07 17:26:24,715 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:26:24,716 INFO  L437           NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:24,716 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 838 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:26:24,717 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 129 states.
[2025-05-07 17:26:24,721 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127.
[2025-05-07 17:26:24,722 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 127 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 58 states have internal predecessors, (58), 41 states have call successors, (43), 32 states have call predecessors, (43), 32 states have return successors, (43), 36 states have call predecessors, (43), 41 states have call successors, (43)
[2025-05-07 17:26:24,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions.
[2025-05-07 17:26:24,723 INFO  L79                 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 69
[2025-05-07 17:26:24,723 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:24,723 INFO  L485      AbstractCegarLoop]: Abstraction has 127 states and 144 transitions.
[2025-05-07 17:26:24,724 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (19), 1 states have call predecessors, (19), 6 states have return successors, (19), 7 states have call predecessors, (19), 4 states have call successors, (19)
[2025-05-07 17:26:24,724 INFO  L278                IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions.
[2025-05-07 17:26:24,725 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2025-05-07 17:26:24,725 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:24,725 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]
[2025-05-07 17:26:24,725 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:26:24,725 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:24,726 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:24,726 INFO  L85        PathProgramCache]: Analyzing trace with hash 949983931, now seen corresponding path program 1 times
[2025-05-07 17:26:24,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:24,726 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648850202]
[2025-05-07 17:26:24,726 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:24,726 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:24,750 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes.
[2025-05-07 17:26:24,764 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements.
[2025-05-07 17:26:24,764 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:24,764 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:24,854 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:26:24,854 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:24,854 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648850202]
[2025-05-07 17:26:24,854 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648850202] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:24,854 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:24,854 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:26:24,854 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427549484]
[2025-05-07 17:26:24,854 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:24,855 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:26:24,855 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:24,856 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:26:24,856 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:24,856 INFO  L87              Difference]: Start difference. First operand 127 states and 144 transitions. Second operand  has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (17), 1 states have call predecessors, (17), 5 states have return successors, (17), 6 states have call predecessors, (17), 4 states have call successors, (17)
[2025-05-07 17:26:24,897 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:24,897 INFO  L93              Difference]: Finished difference Result 132 states and 150 transitions.
[2025-05-07 17:26:24,898 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:26:24,898 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (17), 1 states have call predecessors, (17), 5 states have return successors, (17), 6 states have call predecessors, (17), 4 states have call successors, (17) Word has length 63
[2025-05-07 17:26:24,898 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:24,900 INFO  L225             Difference]: With dead ends: 132
[2025-05-07 17:26:24,900 INFO  L226             Difference]: Without dead ends: 132
[2025-05-07 17:26:24,900 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:26:24,901 INFO  L437           NwaCegarLoop]: 146 mSDtfsCounter, 1 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:24,901 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 715 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:24,902 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 132 states.
[2025-05-07 17:26:24,910 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132.
[2025-05-07 17:26:24,910 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 132 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 42 states have call successors, (44), 32 states have call predecessors, (44), 34 states have return successors, (46), 39 states have call predecessors, (46), 42 states have call successors, (46)
[2025-05-07 17:26:24,911 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 150 transitions.
[2025-05-07 17:26:24,912 INFO  L79                 Accepts]: Start accepts. Automaton has 132 states and 150 transitions. Word has length 63
[2025-05-07 17:26:24,913 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:24,913 INFO  L485      AbstractCegarLoop]: Abstraction has 132 states and 150 transitions.
[2025-05-07 17:26:24,913 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (17), 1 states have call predecessors, (17), 5 states have return successors, (17), 6 states have call predecessors, (17), 4 states have call successors, (17)
[2025-05-07 17:26:24,913 INFO  L278                IsEmpty]: Start isEmpty. Operand 132 states and 150 transitions.
[2025-05-07 17:26:24,915 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2025-05-07 17:26:24,915 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:24,915 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]
[2025-05-07 17:26:24,915 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:26:24,915 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:24,915 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:24,916 INFO  L85        PathProgramCache]: Analyzing trace with hash -440571419, now seen corresponding path program 1 times
[2025-05-07 17:26:24,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:24,916 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94506815]
[2025-05-07 17:26:24,916 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:24,916 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:24,936 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes.
[2025-05-07 17:26:24,955 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements.
[2025-05-07 17:26:24,956 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:24,956 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:25,162 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:26:25,163 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:25,163 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94506815]
[2025-05-07 17:26:25,163 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94506815] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:25,163 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:25,163 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:25,163 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993767255]
[2025-05-07 17:26:25,163 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:25,163 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:25,163 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:25,164 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:25,164 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:25,164 INFO  L87              Difference]: Start difference. First operand 132 states and 150 transitions. Second operand  has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (17), 1 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17)
[2025-05-07 17:26:25,196 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:25,196 INFO  L93              Difference]: Finished difference Result 134 states and 153 transitions.
[2025-05-07 17:26:25,197 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:25,197 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (17), 1 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 63
[2025-05-07 17:26:25,197 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:25,198 INFO  L225             Difference]: With dead ends: 134
[2025-05-07 17:26:25,198 INFO  L226             Difference]: Without dead ends: 134
[2025-05-07 17:26:25,198 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:26:25,198 INFO  L437           NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:25,199 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 422 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:25,199 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 134 states.
[2025-05-07 17:26:25,203 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134.
[2025-05-07 17:26:25,204 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 134 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 61 states have internal predecessors, (61), 42 states have call successors, (44), 32 states have call predecessors, (44), 35 states have return successors, (48), 40 states have call predecessors, (48), 42 states have call successors, (48)
[2025-05-07 17:26:25,205 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions.
[2025-05-07 17:26:25,205 INFO  L79                 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 63
[2025-05-07 17:26:25,205 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:25,205 INFO  L485      AbstractCegarLoop]: Abstraction has 134 states and 153 transitions.
[2025-05-07 17:26:25,205 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (17), 1 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17)
[2025-05-07 17:26:25,205 INFO  L278                IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions.
[2025-05-07 17:26:25,206 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 64
[2025-05-07 17:26:25,206 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:25,206 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]
[2025-05-07 17:26:25,206 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:26:25,206 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:25,206 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:25,206 INFO  L85        PathProgramCache]: Analyzing trace with hash 1688918287, now seen corresponding path program 1 times
[2025-05-07 17:26:25,207 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:25,207 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347437748]
[2025-05-07 17:26:25,207 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:25,207 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:25,223 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes.
[2025-05-07 17:26:25,234 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements.
[2025-05-07 17:26:25,234 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:25,234 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:25,408 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:26:25,409 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:25,409 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347437748]
[2025-05-07 17:26:25,409 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347437748] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:25,409 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:25,409 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-05-07 17:26:25,409 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792045333]
[2025-05-07 17:26:25,409 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:25,409 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-05-07 17:26:25,410 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:25,410 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-05-07 17:26:25,410 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:26:25,410 INFO  L87              Difference]: Start difference. First operand 134 states and 153 transitions. Second operand  has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (17), 10 states have call predecessors, (17), 5 states have call successors, (17)
[2025-05-07 17:26:25,555 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:25,555 INFO  L93              Difference]: Finished difference Result 141 states and 161 transitions.
[2025-05-07 17:26:25,555 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-05-07 17:26:25,556 INFO  L79                 Accepts]: Start accepts. Automaton has  has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (17), 10 states have call predecessors, (17), 5 states have call successors, (17) Word has length 63
[2025-05-07 17:26:25,556 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:25,557 INFO  L225             Difference]: With dead ends: 141
[2025-05-07 17:26:25,557 INFO  L226             Difference]: Without dead ends: 141
[2025-05-07 17:26:25,557 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132
[2025-05-07 17:26:25,558 INFO  L437           NwaCegarLoop]: 145 mSDtfsCounter, 2 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1417 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:25,558 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1417 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:26:25,559 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 141 states.
[2025-05-07 17:26:25,566 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136.
[2025-05-07 17:26:25,566 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 136 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 62 states have internal predecessors, (62), 42 states have call successors, (44), 32 states have call predecessors, (44), 36 states have return successors, (49), 41 states have call predecessors, (49), 42 states have call successors, (49)
[2025-05-07 17:26:25,567 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 155 transitions.
[2025-05-07 17:26:25,567 INFO  L79                 Accepts]: Start accepts. Automaton has 136 states and 155 transitions. Word has length 63
[2025-05-07 17:26:25,568 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:25,568 INFO  L485      AbstractCegarLoop]: Abstraction has 136 states and 155 transitions.
[2025-05-07 17:26:25,568 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 11 states have internal predecessors, (29), 5 states have call successors, (17), 1 states have call predecessors, (17), 9 states have return successors, (17), 10 states have call predecessors, (17), 5 states have call successors, (17)
[2025-05-07 17:26:25,568 INFO  L278                IsEmpty]: Start isEmpty. Operand 136 states and 155 transitions.
[2025-05-07 17:26:25,569 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 95
[2025-05-07 17:26:25,569 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:25,569 INFO  L218           NwaCegarLoop]: trace histogram [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]
[2025-05-07 17:26:25,569 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:26:25,570 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:25,570 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:25,570 INFO  L85        PathProgramCache]: Analyzing trace with hash -1909410496, now seen corresponding path program 1 times
[2025-05-07 17:26:25,570 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:25,570 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208564478]
[2025-05-07 17:26:25,570 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:25,570 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:25,606 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes.
[2025-05-07 17:26:25,624 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements.
[2025-05-07 17:26:25,624 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:25,624 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:25,734 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-05-07 17:26:25,734 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:25,734 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208564478]
[2025-05-07 17:26:25,734 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208564478] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:25,734 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:25,734 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:26:25,734 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948770674]
[2025-05-07 17:26:25,734 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:25,735 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:26:25,735 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:25,735 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:26:25,735 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:26:25,736 INFO  L87              Difference]: Start difference. First operand 136 states and 155 transitions. Second operand  has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (24), 1 states have call predecessors, (24), 6 states have return successors, (26), 7 states have call predecessors, (26), 4 states have call successors, (26)
[2025-05-07 17:26:25,789 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:25,789 INFO  L93              Difference]: Finished difference Result 136 states and 154 transitions.
[2025-05-07 17:26:25,790 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:26:25,790 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (24), 1 states have call predecessors, (24), 6 states have return successors, (26), 7 states have call predecessors, (26), 4 states have call successors, (26) Word has length 94
[2025-05-07 17:26:25,790 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:25,791 INFO  L225             Difference]: With dead ends: 136
[2025-05-07 17:26:25,791 INFO  L226             Difference]: Without dead ends: 134
[2025-05-07 17:26:25,791 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:26:25,792 INFO  L437           NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:25,792 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 806 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:25,793 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 134 states.
[2025-05-07 17:26:25,798 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134.
[2025-05-07 17:26:25,799 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 134 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 61 states have internal predecessors, (61), 40 states have call successors, (42), 32 states have call predecessors, (42), 36 states have return successors, (47), 40 states have call predecessors, (47), 40 states have call successors, (47)
[2025-05-07 17:26:25,800 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions.
[2025-05-07 17:26:25,800 INFO  L79                 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 94
[2025-05-07 17:26:25,800 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:25,800 INFO  L485      AbstractCegarLoop]: Abstraction has 134 states and 150 transitions.
[2025-05-07 17:26:25,801 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (24), 1 states have call predecessors, (24), 6 states have return successors, (26), 7 states have call predecessors, (26), 4 states have call successors, (26)
[2025-05-07 17:26:25,801 INFO  L278                IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions.
[2025-05-07 17:26:25,802 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2025-05-07 17:26:25,802 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:25,802 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1]
[2025-05-07 17:26:25,802 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:26:25,802 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:25,803 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:25,803 INFO  L85        PathProgramCache]: Analyzing trace with hash 34690554, now seen corresponding path program 1 times
[2025-05-07 17:26:25,803 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:25,803 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911145498]
[2025-05-07 17:26:25,803 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:25,803 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:25,831 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes.
[2025-05-07 17:26:25,850 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements.
[2025-05-07 17:26:25,850 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:25,850 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:26,153 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-05-07 17:26:26,153 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:26,153 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911145498]
[2025-05-07 17:26:26,153 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911145498] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:26,153 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:26,153 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:26:26,153 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966004961]
[2025-05-07 17:26:26,153 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:26,154 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:26:26,154 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:26,155 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:26:26,155 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:26:26,155 INFO  L87              Difference]: Start difference. First operand 134 states and 150 transitions. Second operand  has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 4 states have call successors, (27), 1 states have call predecessors, (27), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:26:26,193 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:26,193 INFO  L93              Difference]: Finished difference Result 138 states and 155 transitions.
[2025-05-07 17:26:26,194 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:26:26,194 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 4 states have call successors, (27), 1 states have call predecessors, (27), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 108
[2025-05-07 17:26:26,194 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:26,194 INFO  L225             Difference]: With dead ends: 138
[2025-05-07 17:26:26,195 INFO  L226             Difference]: Without dead ends: 138
[2025-05-07 17:26:26,195 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:26:26,195 INFO  L437           NwaCegarLoop]: 140 mSDtfsCounter, 1 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:26,195 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 546 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:26,196 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 138 states.
[2025-05-07 17:26:26,198 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138.
[2025-05-07 17:26:26,199 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 138 states, 60 states have (on average 1.05) internal successors, (63), 63 states have internal predecessors, (63), 40 states have call successors, (42), 32 states have call predecessors, (42), 38 states have return successors, (50), 42 states have call predecessors, (50), 40 states have call successors, (50)
[2025-05-07 17:26:26,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 155 transitions.
[2025-05-07 17:26:26,199 INFO  L79                 Accepts]: Start accepts. Automaton has 138 states and 155 transitions. Word has length 108
[2025-05-07 17:26:26,200 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:26,200 INFO  L485      AbstractCegarLoop]: Abstraction has 138 states and 155 transitions.
[2025-05-07 17:26:26,200 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 states have internal predecessors, (42), 4 states have call successors, (27), 1 states have call predecessors, (27), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:26:26,200 INFO  L278                IsEmpty]: Start isEmpty. Operand 138 states and 155 transitions.
[2025-05-07 17:26:26,201 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 109
[2025-05-07 17:26:26,201 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:26,201 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1]
[2025-05-07 17:26:26,201 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:26:26,201 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:26,201 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:26,201 INFO  L85        PathProgramCache]: Analyzing trace with hash -846003174, now seen corresponding path program 1 times
[2025-05-07 17:26:26,201 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:26,201 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171497572]
[2025-05-07 17:26:26,201 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:26,201 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:26,238 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes.
[2025-05-07 17:26:26,256 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements.
[2025-05-07 17:26:26,256 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:26,256 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:26,460 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-05-07 17:26:26,460 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:26,460 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171497572]
[2025-05-07 17:26:26,460 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171497572] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:26,460 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:26,460 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-05-07 17:26:26,460 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543056411]
[2025-05-07 17:26:26,460 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:26,460 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-05-07 17:26:26,460 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:26,461 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-05-07 17:26:26,461 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:26:26,461 INFO  L87              Difference]: Start difference. First operand 138 states and 155 transitions. Second operand  has 10 states, 8 states have (on average 5.25) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (27), 1 states have call predecessors, (27), 8 states have return successors, (27), 9 states have call predecessors, (27), 5 states have call successors, (27)
[2025-05-07 17:26:26,560 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:26,560 INFO  L93              Difference]: Finished difference Result 145 states and 163 transitions.
[2025-05-07 17:26:26,560 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-05-07 17:26:26,560 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 5.25) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (27), 1 states have call predecessors, (27), 8 states have return successors, (27), 9 states have call predecessors, (27), 5 states have call successors, (27) Word has length 108
[2025-05-07 17:26:26,561 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:26,562 INFO  L225             Difference]: With dead ends: 145
[2025-05-07 17:26:26,562 INFO  L226             Difference]: Without dead ends: 145
[2025-05-07 17:26:26,562 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:26:26,563 INFO  L437           NwaCegarLoop]: 144 mSDtfsCounter, 2 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:26,563 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1266 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:26:26,563 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2025-05-07 17:26:26,568 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 136.
[2025-05-07 17:26:26,569 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 136 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 62 states have internal predecessors, (62), 40 states have call successors, (42), 32 states have call predecessors, (42), 37 states have return successors, (48), 41 states have call predecessors, (48), 40 states have call successors, (48)
[2025-05-07 17:26:26,570 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions.
[2025-05-07 17:26:26,570 INFO  L79                 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 108
[2025-05-07 17:26:26,570 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:26,570 INFO  L485      AbstractCegarLoop]: Abstraction has 136 states and 152 transitions.
[2025-05-07 17:26:26,570 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 5.25) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (27), 1 states have call predecessors, (27), 8 states have return successors, (27), 9 states have call predecessors, (27), 5 states have call successors, (27)
[2025-05-07 17:26:26,570 INFO  L278                IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions.
[2025-05-07 17:26:26,571 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-05-07 17:26:26,571 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:26,572 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:26,572 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:26:26,572 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:26,572 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:26,572 INFO  L85        PathProgramCache]: Analyzing trace with hash -1415964189, now seen corresponding path program 1 times
[2025-05-07 17:26:26,572 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:26,572 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38285956]
[2025-05-07 17:26:26,572 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:26,572 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:26,600 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-05-07 17:26:26,610 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-05-07 17:26:26,611 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:26,611 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:26,807 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:26:26,807 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:26,807 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38285956]
[2025-05-07 17:26:26,807 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38285956] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:26,807 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:26,807 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:26:26,807 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271257768]
[2025-05-07 17:26:26,807 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:26,808 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:26:26,808 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:26,808 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:26:26,808 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:26:26,808 INFO  L87              Difference]: Start difference. First operand 136 states and 152 transitions. Second operand  has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 4 states have call successors, (25), 1 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:26:26,840 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:26,841 INFO  L93              Difference]: Finished difference Result 134 states and 149 transitions.
[2025-05-07 17:26:26,841 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:26:26,841 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 4 states have call successors, (25), 1 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 91
[2025-05-07 17:26:26,842 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:26,843 INFO  L225             Difference]: With dead ends: 134
[2025-05-07 17:26:26,843 INFO  L226             Difference]: Without dead ends: 132
[2025-05-07 17:26:26,843 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:26:26,843 INFO  L437           NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:26,843 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 540 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:26:26,844 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 132 states.
[2025-05-07 17:26:26,848 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132.
[2025-05-07 17:26:26,848 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 132 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 60 states have internal predecessors, (60), 39 states have call successors, (40), 31 states have call predecessors, (40), 36 states have return successors, (46), 40 states have call predecessors, (46), 39 states have call successors, (46)
[2025-05-07 17:26:26,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 146 transitions.
[2025-05-07 17:26:26,850 INFO  L79                 Accepts]: Start accepts. Automaton has 132 states and 146 transitions. Word has length 91
[2025-05-07 17:26:26,850 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:26,850 INFO  L485      AbstractCegarLoop]: Abstraction has 132 states and 146 transitions.
[2025-05-07 17:26:26,850 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 4 states have call successors, (25), 1 states have call predecessors, (25), 4 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:26:26,850 INFO  L278                IsEmpty]: Start isEmpty. Operand 132 states and 146 transitions.
[2025-05-07 17:26:26,851 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2025-05-07 17:26:26,851 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:26,851 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:26,852 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:26:26,852 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:26,852 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:26,852 INFO  L85        PathProgramCache]: Analyzing trace with hash -1603860595, now seen corresponding path program 1 times
[2025-05-07 17:26:26,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:26,852 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176342828]
[2025-05-07 17:26:26,852 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:26,853 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:26,883 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes.
[2025-05-07 17:26:26,900 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements.
[2025-05-07 17:26:26,900 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:26,900 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:27,058 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:26:27,058 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:27,058 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176342828]
[2025-05-07 17:26:27,058 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176342828] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:27,058 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:27,058 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-05-07 17:26:27,058 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530254204]
[2025-05-07 17:26:27,058 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:27,058 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-05-07 17:26:27,058 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:27,059 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-05-07 17:26:27,059 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132
[2025-05-07 17:26:27,059 INFO  L87              Difference]: Start difference. First operand 132 states and 146 transitions. Second operand  has 12 states, 10 states have (on average 4.1) internal successors, (41), 12 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (25), 11 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:26:27,179 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:27,179 INFO  L93              Difference]: Finished difference Result 126 states and 140 transitions.
[2025-05-07 17:26:27,180 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-05-07 17:26:27,180 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 10 states have (on average 4.1) internal successors, (41), 12 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (25), 11 states have call predecessors, (25), 5 states have call successors, (25) Word has length 91
[2025-05-07 17:26:27,180 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:27,180 INFO  L225             Difference]: With dead ends: 126
[2025-05-07 17:26:27,180 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:26:27,181 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:26:27,181 INFO  L437           NwaCegarLoop]: 129 mSDtfsCounter, 1 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:27,181 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1387 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:26:27,182 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:26:27,182 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:26:27,182 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:26:27,182 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:26:27,182 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91
[2025-05-07 17:26:27,182 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:27,182 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:26:27,182 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 10 states have (on average 4.1) internal successors, (41), 12 states have internal predecessors, (41), 5 states have call successors, (25), 1 states have call predecessors, (25), 10 states have return successors, (25), 11 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:26:27,183 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:26:27,183 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:26:27,185 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:26:27,185 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:26:27,188 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:27,190 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:26:27,193 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:26:27 BoogieIcfgContainer
[2025-05-07 17:26:27,193 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:26:27,194 INFO  L158              Benchmark]: Toolchain (without parser) took 3913.33ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 138.7MB in the beginning and 151.6MB in the end (delta: -12.9MB). Peak memory consumption was 48.9MB. Max. memory is 33.6GB.
[2025-05-07 17:26:27,194 INFO  L158              Benchmark]: SmtParser took 0.26ms. Allocated memory is still 234.9MB. Free memory is still 172.7MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:26:27,194 INFO  L158              Benchmark]: ChcToBoogie took 36.02ms. Allocated memory is still 234.9MB. Free memory was 138.7MB in the beginning and 134.8MB in the end (delta: 3.9MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-05-07 17:26:27,194 INFO  L158              Benchmark]: Boogie Preprocessor took 59.88ms. Allocated memory is still 234.9MB. Free memory was 134.7MB in the beginning and 130.9MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:26:27,195 INFO  L158              Benchmark]: RCFGBuilder took 468.96ms. Allocated memory is still 234.9MB. Free memory was 130.9MB in the beginning and 151.3MB in the end (delta: -20.4MB). Peak memory consumption was 26.3MB. Max. memory is 33.6GB.
[2025-05-07 17:26:27,195 INFO  L158              Benchmark]: TraceAbstraction took 3344.47ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 150.9MB in the beginning and 151.6MB in the end (delta: -739.0kB). Peak memory consumption was 56.2MB. Max. memory is 33.6GB.
[2025-05-07 17:26:27,196 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.26ms. Allocated memory is still 234.9MB. Free memory is still 172.7MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 36.02ms. Allocated memory is still 234.9MB. Free memory was 138.7MB in the beginning and 134.8MB in the end (delta: 3.9MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * Boogie Preprocessor took 59.88ms. Allocated memory is still 234.9MB. Free memory was 134.7MB in the beginning and 130.9MB in the end (delta: 3.8MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 468.96ms. Allocated memory is still 234.9MB. Free memory was 130.9MB in the beginning and 151.3MB in the end (delta: -20.4MB). Peak memory consumption was 26.3MB. Max. memory is 33.6GB.
 * TraceAbstraction took 3344.47ms. Allocated memory was 234.9MB in the beginning and 285.2MB in the end (delta: 50.3MB). Free memory was 150.9MB in the beginning and 151.6MB in the end (delta: -739.0kB). Peak memory consumption was 56.2MB. 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 33 procedures, 133 locations, 203 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 8394 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6973 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 474 IncrementalHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 1421 mSDtfsCounter, 474 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=7, InterpolantAutomatonStates: 71, 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, 10 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 819 NumberOfCodeBlocks, 819 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 809 ConstructedInterpolants, 0 QuantifiedInterpolants, 1036 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 39/39 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:26:27,208 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
