./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/special/msg_data.sol_17_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:27:00,305 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:27:00,341 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91960d4-00ee-4031-b27f-f22275c2c978/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:27:00,344 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:27:00,344 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:27:00,357 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:27:00,357 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:27:00,357 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:27:00,358 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:27:00,358 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:27:00,358 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:27:00,358 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:27:00,358 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:27:00,358 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:27:00,358 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:27:00,358 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:27:00,358 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:27:00,358 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:27:00,358 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:27:00,359 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:27:00,359 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:27:00,359 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:27:00,359 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:27:00,359 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:27:00,359 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:27:00,359 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:27:00,359 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:27:00,553 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:27:00,561 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:27:00,563 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:27:00,564 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:27:00,565 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:27:00,566 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91960d4-00ee-4031-b27f-f22275c2c978/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/special/msg_data.sol_17_no_adts_000.smt2
[2025-05-07 17:27:00,566 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:27:00,569 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:27:00,900 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d91960d4-00ee-4031-b27f-f22275c2c978/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/special/msg_data.sol_17_no_adts_000.smt2
[2025-05-07 17:27:00,902 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:27:00,903 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:27:00,903 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:27:00,904 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:27:00,904 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:27:00,905 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:27:00" (1/1) ...
[2025-05-07 17:27:00,949 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:00 Unit
[2025-05-07 17:27:00,949 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:27:00,950 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:27:00,950 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:27:00,950 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:27:00,969 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:00" (1/1) ...
[2025-05-07 17:27:00,969 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:00" (1/1) ...
[2025-05-07 17:27:00,992 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:00" (1/1) ...
[2025-05-07 17:27:00,992 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:00" (1/1) ...
[2025-05-07 17:27:01,000 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:00" (1/1) ...
[2025-05-07 17:27:01,001 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:00" (1/1) ...
[2025-05-07 17:27:01,003 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:00" (1/1) ...
[2025-05-07 17:27:01,005 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:00" (1/1) ...
[2025-05-07 17:27:01,007 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:00" (1/1) ...
[2025-05-07 17:27:01,020 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:27:01,021 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:27:01,021 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:27:01,021 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:27:01,022 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:00" (1/1) ...
[2025-05-07 17:27:01,024 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:27:01,033 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:27:01,042 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:27:01,044 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:27:01,054 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:27:01,054 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:27:01,054 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:27:01,054 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_29_0 given in one single declaration
[2025-05-07 17:27:01,054 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_29_0
[2025-05-07 17:27:01,054 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_29_0
[2025-05-07 17:27:01,054 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_4_function_f__56_97_0 given in one single declaration
[2025-05-07 17:27:01,054 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_4_function_f__56_97_0
[2025-05-07 17:27:01,055 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_4_function_f__56_97_0
[2025-05-07 17:27:01,055 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_3_function_f__56_97_0 given in one single declaration
[2025-05-07 17:27:01,055 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_3_function_f__56_97_0
[2025-05-07 17:27:01,055 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_3_function_f__56_97_0
[2025-05-07 17:27:01,055 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_17_function_f__56_97_0 given in one single declaration
[2025-05-07 17:27:01,055 INFO  L130     BoogieDeclarations]: Found specification of procedure block_17_function_f__56_97_0
[2025-05-07 17:27:01,055 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_17_function_f__56_97_0
[2025-05-07 17:27:01,055 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_8_f_55_97_0 given in one single declaration
[2025-05-07 17:27:01,055 INFO  L130     BoogieDeclarations]: Found specification of procedure block_8_f_55_97_0
[2025-05-07 17:27:01,055 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_8_f_55_97_0
[2025-05-07 17:27:01,055 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_7_function_f__56_97_0 given in one single declaration
[2025-05-07 17:27:01,055 INFO  L130     BoogieDeclarations]: Found specification of procedure block_7_function_f__56_97_0
[2025-05-07 17:27:01,056 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_7_function_f__56_97_0
[2025-05-07 17:27:01,056 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_16_function_f__56_97_0 given in one single declaration
[2025-05-07 17:27:01,056 INFO  L130     BoogieDeclarations]: Found specification of procedure block_16_function_f__56_97_0
[2025-05-07 17:27:01,056 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_16_function_f__56_97_0
[2025-05-07 17:27:01,056 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_11_function_f__56_97_0 given in one single declaration
[2025-05-07 17:27:01,056 INFO  L130     BoogieDeclarations]: Found specification of procedure block_11_function_f__56_97_0
[2025-05-07 17:27:01,056 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_11_function_f__56_97_0
[2025-05-07 17:27:01,056 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_18_function_f__56_97_0 given in one single declaration
[2025-05-07 17:27:01,056 INFO  L130     BoogieDeclarations]: Found specification of procedure block_18_function_f__56_97_0
[2025-05-07 17:27:01,056 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_18_function_f__56_97_0
[2025-05-07 17:27:01,056 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_19_function_f__56_97_0 given in one single declaration
[2025-05-07 17:27:01,056 INFO  L130     BoogieDeclarations]: Found specification of procedure block_19_function_f__56_97_0
[2025-05-07 17:27:01,056 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_19_function_f__56_97_0
[2025-05-07 17:27:01,056 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_13_function_f__56_97_0 given in one single declaration
[2025-05-07 17:27:01,056 INFO  L130     BoogieDeclarations]: Found specification of procedure block_13_function_f__56_97_0
[2025-05-07 17:27:01,057 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_13_function_f__56_97_0
[2025-05-07 17:27:01,057 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_9_return_function_f__56_97_0 given in one single declaration
[2025-05-07 17:27:01,057 INFO  L130     BoogieDeclarations]: Found specification of procedure block_9_return_function_f__56_97_0
[2025-05-07 17:27:01,057 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_9_return_function_f__56_97_0
[2025-05-07 17:27:01,057 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_14_function_f__56_97_0 given in one single declaration
[2025-05-07 17:27:01,057 INFO  L130     BoogieDeclarations]: Found specification of procedure block_14_function_f__56_97_0
[2025-05-07 17:27:01,057 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_14_function_f__56_97_0
[2025-05-07 17:27:01,057 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_10_function_f__56_97_0 given in one single declaration
[2025-05-07 17:27:01,057 INFO  L130     BoogieDeclarations]: Found specification of procedure block_10_function_f__56_97_0
[2025-05-07 17:27:01,057 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_10_function_f__56_97_0
[2025-05-07 17:27:01,057 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_15_function_f__56_97_0 given in one single declaration
[2025-05-07 17:27:01,057 INFO  L130     BoogieDeclarations]: Found specification of procedure block_15_function_f__56_97_0
[2025-05-07 17:27:01,057 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_15_function_f__56_97_0
[2025-05-07 17:27:01,057 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_12_function_f__56_97_0 given in one single declaration
[2025-05-07 17:27:01,057 INFO  L130     BoogieDeclarations]: Found specification of procedure block_12_function_f__56_97_0
[2025-05-07 17:27:01,058 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_12_function_f__56_97_0
[2025-05-07 17:27:01,058 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_20_function_f__56_97_0 given in one single declaration
[2025-05-07 17:27:01,058 INFO  L130     BoogieDeclarations]: Found specification of procedure block_20_function_f__56_97_0
[2025-05-07 17:27:01,058 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_20_function_f__56_97_0
[2025-05-07 17:27:01,058 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_0_C_97_0 given in one single declaration
[2025-05-07 17:27:01,058 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_0_C_97_0
[2025-05-07 17:27:01,058 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_0_C_97_0
[2025-05-07 17:27:01,058 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_2_C_97_0 given in one single declaration
[2025-05-07 17:27:01,058 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_2_C_97_0
[2025-05-07 17:27:01,058 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_2_C_97_0
[2025-05-07 17:27:01,058 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_36_C_97_0 given in one single declaration
[2025-05-07 17:27:01,058 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_36_C_97_0
[2025-05-07 17:27:01,058 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_36_C_97_0
[2025-05-07 17:27:01,058 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_33_C_97_0 given in one single declaration
[2025-05-07 17:27:01,058 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_33_C_97_0
[2025-05-07 17:27:01,059 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_33_C_97_0
[2025-05-07 17:27:01,059 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_35_C_97_0 given in one single declaration
[2025-05-07 17:27:01,059 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_35_C_97_0
[2025-05-07 17:27:01,059 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_35_C_97_0
[2025-05-07 17:27:01,059 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_34_C_97_0 given in one single declaration
[2025-05-07 17:27:01,059 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_34_C_97_0
[2025-05-07 17:27:01,059 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_34_C_97_0
[2025-05-07 17:27:01,059 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_6_function_g__96_97_0 given in one single declaration
[2025-05-07 17:27:01,059 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_6_function_g__96_97_0
[2025-05-07 17:27:01,059 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_6_function_g__96_97_0
[2025-05-07 17:27:01,059 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_32_function_g__96_97_0 given in one single declaration
[2025-05-07 17:27:01,059 INFO  L130     BoogieDeclarations]: Found specification of procedure block_32_function_g__96_97_0
[2025-05-07 17:27:01,059 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_32_function_g__96_97_0
[2025-05-07 17:27:01,059 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_5_function_g__96_97_0 given in one single declaration
[2025-05-07 17:27:01,059 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_5_function_g__96_97_0
[2025-05-07 17:27:01,059 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_5_function_g__96_97_0
[2025-05-07 17:27:01,060 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_24_function_g__96_97_0 given in one single declaration
[2025-05-07 17:27:01,060 INFO  L130     BoogieDeclarations]: Found specification of procedure block_24_function_g__96_97_0
[2025-05-07 17:27:01,060 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_24_function_g__96_97_0
[2025-05-07 17:27:01,060 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_22_g_95_97_0 given in one single declaration
[2025-05-07 17:27:01,060 INFO  L130     BoogieDeclarations]: Found specification of procedure block_22_g_95_97_0
[2025-05-07 17:27:01,060 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_22_g_95_97_0
[2025-05-07 17:27:01,060 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_21_function_g__96_97_0 given in one single declaration
[2025-05-07 17:27:01,060 INFO  L130     BoogieDeclarations]: Found specification of procedure block_21_function_g__96_97_0
[2025-05-07 17:27:01,060 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_21_function_g__96_97_0
[2025-05-07 17:27:01,060 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_30_function_g__96_97_0 given in one single declaration
[2025-05-07 17:27:01,060 INFO  L130     BoogieDeclarations]: Found specification of procedure block_30_function_g__96_97_0
[2025-05-07 17:27:01,060 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_30_function_g__96_97_0
[2025-05-07 17:27:01,060 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_29_function_g__96_97_0 given in one single declaration
[2025-05-07 17:27:01,060 INFO  L130     BoogieDeclarations]: Found specification of procedure block_29_function_g__96_97_0
[2025-05-07 17:27:01,060 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_29_function_g__96_97_0
[2025-05-07 17:27:01,060 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_27_function_g__96_97_0 given in one single declaration
[2025-05-07 17:27:01,060 INFO  L130     BoogieDeclarations]: Found specification of procedure block_27_function_g__96_97_0
[2025-05-07 17:27:01,061 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_27_function_g__96_97_0
[2025-05-07 17:27:01,061 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_31_function_g__96_97_0 given in one single declaration
[2025-05-07 17:27:01,061 INFO  L130     BoogieDeclarations]: Found specification of procedure block_31_function_g__96_97_0
[2025-05-07 17:27:01,061 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_31_function_g__96_97_0
[2025-05-07 17:27:01,061 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_28_function_g__96_97_0 given in one single declaration
[2025-05-07 17:27:01,061 INFO  L130     BoogieDeclarations]: Found specification of procedure block_28_function_g__96_97_0
[2025-05-07 17:27:01,061 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_28_function_g__96_97_0
[2025-05-07 17:27:01,061 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_26_function_g__96_97_0 given in one single declaration
[2025-05-07 17:27:01,061 INFO  L130     BoogieDeclarations]: Found specification of procedure block_26_function_g__96_97_0
[2025-05-07 17:27:01,061 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_26_function_g__96_97_0
[2025-05-07 17:27:01,061 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_25_function_g__96_97_0 given in one single declaration
[2025-05-07 17:27:01,061 INFO  L130     BoogieDeclarations]: Found specification of procedure block_25_function_g__96_97_0
[2025-05-07 17:27:01,061 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_25_function_g__96_97_0
[2025-05-07 17:27:01,061 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_23_return_function_g__96_97_0 given in one single declaration
[2025-05-07 17:27:01,061 INFO  L130     BoogieDeclarations]: Found specification of procedure block_23_return_function_g__96_97_0
[2025-05-07 17:27:01,061 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_23_return_function_g__96_97_0
[2025-05-07 17:27:01,061 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:27:01,062 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:27:01,062 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:27:01,256 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:27:01,258 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:27:01,572 INFO  L?                        ?]: Removed 608 outVars from TransFormulas that were not future-live.
[2025-05-07 17:27:01,572 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:27:01,581 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:27:01,581 INFO  L312             CfgBuilder]: Removed 27 assume(true) statements.
[2025-05-07 17:27:01,582 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:27:01 BoogieIcfgContainer
[2025-05-07 17:27:01,582 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:27:01,583 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:27:01,583 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:27:01,586 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:27:01,586 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:27:00" (1/3) ...
[2025-05-07 17:27:01,586 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340ed39c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:27:01, skipping insertion in model container
[2025-05-07 17:27:01,587 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:00" (2/3) ...
[2025-05-07 17:27:01,587 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@340ed39c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:27:01, skipping insertion in model container
[2025-05-07 17:27:01,587 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:27:01" (3/3) ...
[2025-05-07 17:27:01,588 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:27:01,598 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:27:01,600 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 39 procedures, 152 locations, 256 edges, 39 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:27:01,633 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:27:01,642 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;@269dca92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:27:01,642 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:27:01,645 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 152 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 73 states have internal predecessors, (73), 43 states have call successors, (61), 38 states have call predecessors, (61), 38 states have return successors, (61), 40 states have call predecessors, (61), 43 states have call successors, (61)
[2025-05-07 17:27:01,654 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:27:01,654 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:01,655 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:01,655 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:01,659 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:01,659 INFO  L85        PathProgramCache]: Analyzing trace with hash 101910993, now seen corresponding path program 1 times
[2025-05-07 17:27:01,665 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:01,665 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129567612]
[2025-05-07 17:27:01,666 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:01,666 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:01,730 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:27:01,748 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:27:01,748 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:01,748 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:01,921 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:27:01,921 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:01,922 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129567612]
[2025-05-07 17:27:01,922 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129567612] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:01,922 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:01,925 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:27:01,926 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023365998]
[2025-05-07 17:27:01,927 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:01,931 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:27:01,931 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:01,956 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:27:01,956 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:01,958 INFO  L87              Difference]: Start difference. First operand  has 152 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 73 states have internal predecessors, (73), 43 states have call successors, (61), 38 states have call predecessors, (61), 38 states have return successors, (61), 40 states have call predecessors, (61), 43 states have call successors, (61) Second operand  has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:27:02,012 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:02,013 INFO  L93              Difference]: Finished difference Result 154 states and 198 transitions.
[2025-05-07 17:27:02,018 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:27:02,020 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 51
[2025-05-07 17:27:02,020 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:02,026 INFO  L225             Difference]: With dead ends: 154
[2025-05-07 17:27:02,026 INFO  L226             Difference]: Without dead ends: 150
[2025-05-07 17:27:02,028 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:27:02,030 INFO  L437           NwaCegarLoop]: 194 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 574 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:27:02,030 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 574 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:02,041 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 150 states.
[2025-05-07 17:27:02,063 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148.
[2025-05-07 17:27:02,064 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 148 states, 68 states have (on average 1.0294117647058822) internal successors, (70), 70 states have internal predecessors, (70), 41 states have call successors, (59), 38 states have call predecessors, (59), 38 states have return successors, (59), 39 states have call predecessors, (59), 41 states have call successors, (59)
[2025-05-07 17:27:02,068 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 188 transitions.
[2025-05-07 17:27:02,069 INFO  L79                 Accepts]: Start accepts. Automaton has 148 states and 188 transitions. Word has length 51
[2025-05-07 17:27:02,069 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:02,069 INFO  L485      AbstractCegarLoop]: Abstraction has 148 states and 188 transitions.
[2025-05-07 17:27:02,069 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:27:02,069 INFO  L278                IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions.
[2025-05-07 17:27:02,072 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:27:02,072 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:02,072 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:02,072 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:27:02,072 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:02,073 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:02,073 INFO  L85        PathProgramCache]: Analyzing trace with hash 306843019, now seen corresponding path program 1 times
[2025-05-07 17:27:02,073 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:02,073 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802043237]
[2025-05-07 17:27:02,073 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:02,073 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:02,102 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:27:02,131 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:27:02,132 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:02,132 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:02,355 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:27:02,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:02,355 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802043237]
[2025-05-07 17:27:02,355 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802043237] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:02,355 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:02,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:27:02,355 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399543317]
[2025-05-07 17:27:02,355 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:02,356 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:27:02,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:02,357 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:27:02,357 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:27:02,357 INFO  L87              Difference]: Start difference. First operand 148 states and 188 transitions. Second operand  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:02,401 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:02,402 INFO  L93              Difference]: Finished difference Result 150 states and 189 transitions.
[2025-05-07 17:27:02,402 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:27:02,402 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:27:02,403 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:02,404 INFO  L225             Difference]: With dead ends: 150
[2025-05-07 17:27:02,404 INFO  L226             Difference]: Without dead ends: 144
[2025-05-07 17:27:02,404 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:27:02,405 INFO  L437           NwaCegarLoop]: 186 mSDtfsCounter, 1 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:02,405 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 732 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:02,406 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 144 states.
[2025-05-07 17:27:02,412 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144.
[2025-05-07 17:27:02,413 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 144 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 68 states have internal predecessors, (68), 40 states have call successors, (57), 37 states have call predecessors, (57), 37 states have return successors, (57), 38 states have call predecessors, (57), 40 states have call successors, (57)
[2025-05-07 17:27:02,414 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 182 transitions.
[2025-05-07 17:27:02,414 INFO  L79                 Accepts]: Start accepts. Automaton has 144 states and 182 transitions. Word has length 51
[2025-05-07 17:27:02,414 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:02,414 INFO  L485      AbstractCegarLoop]: Abstraction has 144 states and 182 transitions.
[2025-05-07 17:27:02,415 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:02,415 INFO  L278                IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions.
[2025-05-07 17:27:02,416 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:27:02,416 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:02,416 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:02,416 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:27:02,416 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:02,417 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:02,417 INFO  L85        PathProgramCache]: Analyzing trace with hash 365953111, now seen corresponding path program 1 times
[2025-05-07 17:27:02,417 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:02,417 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836332014]
[2025-05-07 17:27:02,417 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:02,417 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:02,439 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:27:02,450 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:27:02,450 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:02,450 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:02,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:27:02,616 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:02,616 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836332014]
[2025-05-07 17:27:02,616 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836332014] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:02,616 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:02,616 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:27:02,616 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239012539]
[2025-05-07 17:27:02,616 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:02,617 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:27:02,617 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:02,618 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:27:02,618 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:27:02,618 INFO  L87              Difference]: Start difference. First operand 144 states and 182 transitions. Second operand  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:02,660 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:02,660 INFO  L93              Difference]: Finished difference Result 146 states and 183 transitions.
[2025-05-07 17:27:02,661 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:27:02,661 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:27:02,661 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:02,662 INFO  L225             Difference]: With dead ends: 146
[2025-05-07 17:27:02,662 INFO  L226             Difference]: Without dead ends: 140
[2025-05-07 17:27:02,662 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:27:02,663 INFO  L437           NwaCegarLoop]: 180 mSDtfsCounter, 1 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:02,663 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 708 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:02,663 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2025-05-07 17:27:02,669 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140.
[2025-05-07 17:27:02,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 140 states, 64 states have (on average 1.03125) internal successors, (66), 66 states have internal predecessors, (66), 39 states have call successors, (55), 36 states have call predecessors, (55), 36 states have return successors, (55), 37 states have call predecessors, (55), 39 states have call successors, (55)
[2025-05-07 17:27:02,670 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 176 transitions.
[2025-05-07 17:27:02,670 INFO  L79                 Accepts]: Start accepts. Automaton has 140 states and 176 transitions. Word has length 51
[2025-05-07 17:27:02,670 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:02,670 INFO  L485      AbstractCegarLoop]: Abstraction has 140 states and 176 transitions.
[2025-05-07 17:27:02,670 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:02,670 INFO  L278                IsEmpty]: Start isEmpty. Operand 140 states and 176 transitions.
[2025-05-07 17:27:02,671 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:27:02,672 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:02,672 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:02,672 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:27:02,672 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:02,672 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:02,672 INFO  L85        PathProgramCache]: Analyzing trace with hash -1403442739, now seen corresponding path program 1 times
[2025-05-07 17:27:02,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:02,672 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684421038]
[2025-05-07 17:27:02,672 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:02,672 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:02,694 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:27:02,705 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:27:02,705 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:02,705 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:02,820 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:27:02,820 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:02,820 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684421038]
[2025-05-07 17:27:02,820 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684421038] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:02,820 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:02,821 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:27:02,821 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521040481]
[2025-05-07 17:27:02,821 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:02,821 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:27:02,821 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:02,822 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:27:02,822 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:27:02,822 INFO  L87              Difference]: Start difference. First operand 140 states and 176 transitions. Second operand  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:02,855 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:02,855 INFO  L93              Difference]: Finished difference Result 142 states and 177 transitions.
[2025-05-07 17:27:02,856 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:27:02,856 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:27:02,856 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:02,857 INFO  L225             Difference]: With dead ends: 142
[2025-05-07 17:27:02,857 INFO  L226             Difference]: Without dead ends: 136
[2025-05-07 17:27:02,857 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:27:02,858 INFO  L437           NwaCegarLoop]: 174 mSDtfsCounter, 1 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:02,858 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 684 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:02,858 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 136 states.
[2025-05-07 17:27:02,862 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136.
[2025-05-07 17:27:02,863 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 136 states, 62 states have (on average 1.032258064516129) internal successors, (64), 64 states have internal predecessors, (64), 38 states have call successors, (53), 35 states have call predecessors, (53), 35 states have return successors, (53), 36 states have call predecessors, (53), 38 states have call successors, (53)
[2025-05-07 17:27:02,864 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 170 transitions.
[2025-05-07 17:27:02,864 INFO  L79                 Accepts]: Start accepts. Automaton has 136 states and 170 transitions. Word has length 51
[2025-05-07 17:27:02,864 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:02,864 INFO  L485      AbstractCegarLoop]: Abstraction has 136 states and 170 transitions.
[2025-05-07 17:27:02,864 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:02,864 INFO  L278                IsEmpty]: Start isEmpty. Operand 136 states and 170 transitions.
[2025-05-07 17:27:02,865 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:27:02,865 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:02,865 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:02,865 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:27:02,865 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:02,865 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:02,865 INFO  L85        PathProgramCache]: Analyzing trace with hash -1707134451, now seen corresponding path program 1 times
[2025-05-07 17:27:02,865 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:02,865 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765612686]
[2025-05-07 17:27:02,865 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:02,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:02,881 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:27:02,889 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:27:02,889 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:02,889 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:02,951 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:27:02,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:02,951 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765612686]
[2025-05-07 17:27:02,951 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765612686] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:02,951 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:02,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:27:02,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060559490]
[2025-05-07 17:27:02,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:02,951 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:27:02,951 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:02,952 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:27:02,952 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:27:02,952 INFO  L87              Difference]: Start difference. First operand 136 states and 170 transitions. Second operand  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:02,984 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:02,985 INFO  L93              Difference]: Finished difference Result 140 states and 174 transitions.
[2025-05-07 17:27:02,985 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:27:02,985 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:27:02,985 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:02,986 INFO  L225             Difference]: With dead ends: 140
[2025-05-07 17:27:02,986 INFO  L226             Difference]: Without dead ends: 140
[2025-05-07 17:27:02,986 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:27:02,987 INFO  L437           NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:02,987 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 830 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:02,987 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 140 states.
[2025-05-07 17:27:02,992 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140.
[2025-05-07 17:27:02,992 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 140 states, 64 states have (on average 1.03125) internal successors, (66), 66 states have internal predecessors, (66), 38 states have call successors, (53), 35 states have call predecessors, (53), 37 states have return successors, (55), 38 states have call predecessors, (55), 38 states have call successors, (55)
[2025-05-07 17:27:02,993 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions.
[2025-05-07 17:27:02,993 INFO  L79                 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 51
[2025-05-07 17:27:02,993 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:02,994 INFO  L485      AbstractCegarLoop]: Abstraction has 140 states and 174 transitions.
[2025-05-07 17:27:02,994 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:02,994 INFO  L278                IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions.
[2025-05-07 17:27:02,994 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:27:02,994 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:02,995 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:02,995 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:27:02,995 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:02,995 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:02,995 INFO  L85        PathProgramCache]: Analyzing trace with hash -512892809, now seen corresponding path program 1 times
[2025-05-07 17:27:02,995 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:02,995 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944945116]
[2025-05-07 17:27:02,995 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:02,995 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:03,016 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:27:03,023 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:27:03,023 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:03,023 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:03,104 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:27:03,104 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:03,104 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944945116]
[2025-05-07 17:27:03,104 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944945116] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:03,104 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:03,105 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:27:03,105 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083527848]
[2025-05-07 17:27:03,105 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:03,105 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:27:03,105 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:03,106 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:27:03,106 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:27:03,106 INFO  L87              Difference]: Start difference. First operand 140 states and 174 transitions. Second operand  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:03,142 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:03,142 INFO  L93              Difference]: Finished difference Result 144 states and 178 transitions.
[2025-05-07 17:27:03,143 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:27:03,143 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:27:03,143 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:03,144 INFO  L225             Difference]: With dead ends: 144
[2025-05-07 17:27:03,144 INFO  L226             Difference]: Without dead ends: 144
[2025-05-07 17:27:03,144 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:27:03,145 INFO  L437           NwaCegarLoop]: 171 mSDtfsCounter, 1 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:03,145 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 842 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:03,146 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 144 states.
[2025-05-07 17:27:03,152 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140.
[2025-05-07 17:27:03,153 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 140 states, 64 states have (on average 1.03125) internal successors, (66), 66 states have internal predecessors, (66), 38 states have call successors, (53), 35 states have call predecessors, (53), 37 states have return successors, (55), 38 states have call predecessors, (55), 38 states have call successors, (55)
[2025-05-07 17:27:03,154 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions.
[2025-05-07 17:27:03,154 INFO  L79                 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 51
[2025-05-07 17:27:03,154 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:03,154 INFO  L485      AbstractCegarLoop]: Abstraction has 140 states and 174 transitions.
[2025-05-07 17:27:03,155 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:03,155 INFO  L278                IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions.
[2025-05-07 17:27:03,156 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:27:03,156 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:03,156 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:03,156 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:27:03,156 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:03,156 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:03,157 INFO  L85        PathProgramCache]: Analyzing trace with hash 478718331, now seen corresponding path program 1 times
[2025-05-07 17:27:03,157 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:03,157 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964067556]
[2025-05-07 17:27:03,157 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:03,157 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:03,179 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:27:03,189 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:27:03,190 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:03,190 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:03,295 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:27:03,295 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:03,295 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964067556]
[2025-05-07 17:27:03,295 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964067556] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:03,295 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:03,295 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:27:03,295 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318169504]
[2025-05-07 17:27:03,295 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:03,296 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:27:03,296 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:03,296 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:27:03,296 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:27:03,297 INFO  L87              Difference]: Start difference. First operand 140 states and 174 transitions. Second operand  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:03,327 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:03,327 INFO  L93              Difference]: Finished difference Result 142 states and 175 transitions.
[2025-05-07 17:27:03,327 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:27:03,327 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:27:03,328 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:03,328 INFO  L225             Difference]: With dead ends: 142
[2025-05-07 17:27:03,328 INFO  L226             Difference]: Without dead ends: 136
[2025-05-07 17:27:03,329 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:27:03,329 INFO  L437           NwaCegarLoop]: 168 mSDtfsCounter, 1 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:03,329 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 660 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:03,330 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 136 states.
[2025-05-07 17:27:03,336 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136.
[2025-05-07 17:27:03,337 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 136 states, 62 states have (on average 1.032258064516129) internal successors, (64), 64 states have internal predecessors, (64), 37 states have call successors, (51), 34 states have call predecessors, (51), 36 states have return successors, (53), 37 states have call predecessors, (53), 37 states have call successors, (53)
[2025-05-07 17:27:03,338 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 168 transitions.
[2025-05-07 17:27:03,338 INFO  L79                 Accepts]: Start accepts. Automaton has 136 states and 168 transitions. Word has length 51
[2025-05-07 17:27:03,338 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:03,338 INFO  L485      AbstractCegarLoop]: Abstraction has 136 states and 168 transitions.
[2025-05-07 17:27:03,339 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:03,339 INFO  L278                IsEmpty]: Start isEmpty. Operand 136 states and 168 transitions.
[2025-05-07 17:27:03,340 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:27:03,340 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:03,340 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:03,340 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:27:03,341 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:03,341 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:03,341 INFO  L85        PathProgramCache]: Analyzing trace with hash -1111734705, now seen corresponding path program 1 times
[2025-05-07 17:27:03,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:03,341 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061362456]
[2025-05-07 17:27:03,341 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:03,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:03,364 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:27:03,371 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:27:03,371 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:03,371 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:03,516 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:27:03,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:03,516 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061362456]
[2025-05-07 17:27:03,516 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061362456] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:03,516 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:03,516 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:27:03,516 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683116284]
[2025-05-07 17:27:03,516 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:03,516 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:27:03,516 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:03,517 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:27:03,517 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:27:03,517 INFO  L87              Difference]: Start difference. First operand 136 states and 168 transitions. Second operand  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:03,549 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:03,549 INFO  L93              Difference]: Finished difference Result 138 states and 169 transitions.
[2025-05-07 17:27:03,549 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:27:03,549 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:27:03,550 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:03,550 INFO  L225             Difference]: With dead ends: 138
[2025-05-07 17:27:03,550 INFO  L226             Difference]: Without dead ends: 132
[2025-05-07 17:27:03,550 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:27:03,551 INFO  L437           NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:03,551 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 636 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:03,551 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 132 states.
[2025-05-07 17:27:03,555 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132.
[2025-05-07 17:27:03,555 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 132 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 62 states have internal predecessors, (62), 36 states have call successors, (49), 33 states have call predecessors, (49), 35 states have return successors, (51), 36 states have call predecessors, (51), 36 states have call successors, (51)
[2025-05-07 17:27:03,556 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 162 transitions.
[2025-05-07 17:27:03,556 INFO  L79                 Accepts]: Start accepts. Automaton has 132 states and 162 transitions. Word has length 51
[2025-05-07 17:27:03,556 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:03,556 INFO  L485      AbstractCegarLoop]: Abstraction has 132 states and 162 transitions.
[2025-05-07 17:27:03,556 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:03,556 INFO  L278                IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions.
[2025-05-07 17:27:03,557 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:27:03,557 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:03,557 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:03,557 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:27:03,557 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:03,557 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:03,558 INFO  L85        PathProgramCache]: Analyzing trace with hash -1004603825, now seen corresponding path program 1 times
[2025-05-07 17:27:03,558 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:03,558 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224577141]
[2025-05-07 17:27:03,558 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:03,558 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:03,579 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:27:03,587 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:27:03,587 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:03,587 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:03,660 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:27:03,660 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:03,660 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224577141]
[2025-05-07 17:27:03,660 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224577141] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:03,660 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:03,660 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:27:03,660 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582661428]
[2025-05-07 17:27:03,661 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:03,661 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:27:03,661 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:03,661 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:27:03,661 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:27:03,661 INFO  L87              Difference]: Start difference. First operand 132 states and 162 transitions. Second operand  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:03,687 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:03,687 INFO  L93              Difference]: Finished difference Result 134 states and 163 transitions.
[2025-05-07 17:27:03,687 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:27:03,687 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:27:03,687 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:03,688 INFO  L225             Difference]: With dead ends: 134
[2025-05-07 17:27:03,688 INFO  L226             Difference]: Without dead ends: 128
[2025-05-07 17:27:03,688 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:27:03,688 INFO  L437           NwaCegarLoop]: 156 mSDtfsCounter, 1 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:03,688 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 612 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:03,689 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 128 states.
[2025-05-07 17:27:03,691 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128.
[2025-05-07 17:27:03,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 128 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 60 states have internal predecessors, (60), 35 states have call successors, (47), 32 states have call predecessors, (47), 34 states have return successors, (49), 35 states have call predecessors, (49), 35 states have call successors, (49)
[2025-05-07 17:27:03,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 156 transitions.
[2025-05-07 17:27:03,692 INFO  L79                 Accepts]: Start accepts. Automaton has 128 states and 156 transitions. Word has length 51
[2025-05-07 17:27:03,692 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:03,692 INFO  L485      AbstractCegarLoop]: Abstraction has 128 states and 156 transitions.
[2025-05-07 17:27:03,692 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:03,692 INFO  L278                IsEmpty]: Start isEmpty. Operand 128 states and 156 transitions.
[2025-05-07 17:27:03,693 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:27:03,693 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:03,693 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:03,693 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:27:03,693 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:03,693 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:03,693 INFO  L85        PathProgramCache]: Analyzing trace with hash -1114645059, now seen corresponding path program 1 times
[2025-05-07 17:27:03,693 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:03,694 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018189961]
[2025-05-07 17:27:03,694 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:03,694 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:03,711 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:27:03,717 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:27:03,717 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:03,717 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:03,812 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:27:03,812 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:03,812 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018189961]
[2025-05-07 17:27:03,812 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018189961] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:03,812 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:03,812 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:27:03,812 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896817826]
[2025-05-07 17:27:03,812 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:03,813 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:27:03,813 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:03,813 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:27:03,813 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:27:03,813 INFO  L87              Difference]: Start difference. First operand 128 states and 156 transitions. Second operand  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:03,842 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:03,842 INFO  L93              Difference]: Finished difference Result 130 states and 157 transitions.
[2025-05-07 17:27:03,843 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:27:03,843 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:27:03,843 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:03,844 INFO  L225             Difference]: With dead ends: 130
[2025-05-07 17:27:03,844 INFO  L226             Difference]: Without dead ends: 124
[2025-05-07 17:27:03,844 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:27:03,845 INFO  L437           NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:03,845 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 585 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:03,845 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2025-05-07 17:27:03,849 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124.
[2025-05-07 17:27:03,850 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 124 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 58 states have internal predecessors, (58), 34 states have call successors, (45), 31 states have call predecessors, (45), 33 states have return successors, (47), 34 states have call predecessors, (47), 34 states have call successors, (47)
[2025-05-07 17:27:03,851 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions.
[2025-05-07 17:27:03,851 INFO  L79                 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 51
[2025-05-07 17:27:03,851 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:03,851 INFO  L485      AbstractCegarLoop]: Abstraction has 124 states and 150 transitions.
[2025-05-07 17:27:03,851 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 4 states have return successors, (14), 5 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:03,852 INFO  L278                IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions.
[2025-05-07 17:27:03,852 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:27:03,852 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:03,853 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:03,853 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:27:03,853 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:03,853 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:03,853 INFO  L85        PathProgramCache]: Analyzing trace with hash -864066521, now seen corresponding path program 1 times
[2025-05-07 17:27:03,853 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:03,853 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968000784]
[2025-05-07 17:27:03,853 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:03,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:03,871 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:27:03,877 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:27:03,878 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:03,878 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:04,018 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:27:04,018 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:04,018 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968000784]
[2025-05-07 17:27:04,018 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968000784] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:04,019 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:04,019 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:27:04,019 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428458004]
[2025-05-07 17:27:04,019 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:04,019 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:27:04,019 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:04,019 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:27:04,019 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:27:04,019 INFO  L87              Difference]: Start difference. First operand 124 states and 150 transitions. Second operand  has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (14), 7 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:27:04,093 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:04,094 INFO  L93              Difference]: Finished difference Result 128 states and 154 transitions.
[2025-05-07 17:27:04,094 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:27:04,094 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (14), 7 states have call predecessors, (14), 4 states have call successors, (14) Word has length 51
[2025-05-07 17:27:04,094 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:04,095 INFO  L225             Difference]: With dead ends: 128
[2025-05-07 17:27:04,095 INFO  L226             Difference]: Without dead ends: 128
[2025-05-07 17:27:04,095 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:27:04,096 INFO  L437           NwaCegarLoop]: 139 mSDtfsCounter, 1 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:04,096 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 954 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:27:04,096 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 128 states.
[2025-05-07 17:27:04,099 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124.
[2025-05-07 17:27:04,099 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 124 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 58 states have internal predecessors, (58), 34 states have call successors, (45), 31 states have call predecessors, (45), 33 states have return successors, (47), 34 states have call predecessors, (47), 34 states have call successors, (47)
[2025-05-07 17:27:04,099 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions.
[2025-05-07 17:27:04,100 INFO  L79                 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 51
[2025-05-07 17:27:04,100 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:04,100 INFO  L485      AbstractCegarLoop]: Abstraction has 124 states and 150 transitions.
[2025-05-07 17:27:04,100 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 4 states have call successors, (14), 1 states have call predecessors, (14), 6 states have return successors, (14), 7 states have call predecessors, (14), 4 states have call successors, (14)
[2025-05-07 17:27:04,100 INFO  L278                IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions.
[2025-05-07 17:27:04,100 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:27:04,101 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:04,101 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:04,101 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:27:04,101 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:04,101 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:04,101 INFO  L85        PathProgramCache]: Analyzing trace with hash -1915036715, now seen corresponding path program 1 times
[2025-05-07 17:27:04,101 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:04,101 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438465521]
[2025-05-07 17:27:04,101 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:04,101 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:04,121 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:27:04,127 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:27:04,127 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:04,128 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:04,182 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:27:04,182 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:04,182 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438465521]
[2025-05-07 17:27:04,182 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438465521] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:04,182 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:04,183 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:27:04,183 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69611129]
[2025-05-07 17:27:04,183 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:04,183 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:27:04,183 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:04,183 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:27:04,184 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:27:04,184 INFO  L87              Difference]: Start difference. First operand 124 states and 150 transitions. Second operand  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:04,219 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:04,219 INFO  L93              Difference]: Finished difference Result 118 states and 144 transitions.
[2025-05-07 17:27:04,220 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:27:04,220 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14) Word has length 51
[2025-05-07 17:27:04,220 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:04,220 INFO  L225             Difference]: With dead ends: 118
[2025-05-07 17:27:04,220 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:27:04,220 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:27:04,221 INFO  L437           NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:04,221 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 694 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:04,221 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:27:04,221 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:27:04,221 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:27:04,221 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:27:04,221 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51
[2025-05-07 17:27:04,222 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:04,222 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:27:04,222 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (14), 1 states have call predecessors, (14), 5 states have return successors, (14), 6 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:27:04,222 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:27:04,222 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:27:04,224 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:27:04,224 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-05-07 17:27:04,227 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:04,228 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:27:04,231 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:27:04 BoogieIcfgContainer
[2025-05-07 17:27:04,231 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:27:04,232 INFO  L158              Benchmark]: Toolchain (without parser) took 3328.79ms. Allocated memory is still 234.9MB. Free memory was 127.7MB in the beginning and 181.4MB in the end (delta: -53.7MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:04,232 INFO  L158              Benchmark]: SmtParser took 0.19ms. Allocated memory is still 234.9MB. Free memory is still 175.8MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:04,232 INFO  L158              Benchmark]: ChcToBoogie took 45.92ms. Allocated memory is still 234.9MB. Free memory was 127.6MB in the beginning and 121.6MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:04,232 INFO  L158              Benchmark]: Boogie Preprocessor took 70.87ms. Allocated memory is still 234.9MB. Free memory was 121.6MB in the beginning and 190.5MB in the end (delta: -68.9MB). Peak memory consumption was 25.4MB. Max. memory is 33.6GB.
[2025-05-07 17:27:04,232 INFO  L158              Benchmark]: RCFGBuilder took 560.84ms. Allocated memory is still 234.9MB. Free memory was 190.5MB in the beginning and 122.9MB in the end (delta: 67.6MB). Peak memory consumption was 67.1MB. Max. memory is 33.6GB.
[2025-05-07 17:27:04,232 INFO  L158              Benchmark]: TraceAbstraction took 2648.00ms. Allocated memory is still 234.9MB. Free memory was 122.4MB in the beginning and 181.4MB in the end (delta: -58.9MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:27:04,233 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.19ms. Allocated memory is still 234.9MB. Free memory is still 175.8MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 45.92ms. Allocated memory is still 234.9MB. Free memory was 127.6MB in the beginning and 121.6MB in the end (delta: 6.0MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 70.87ms. Allocated memory is still 234.9MB. Free memory was 121.6MB in the beginning and 190.5MB in the end (delta: -68.9MB). Peak memory consumption was 25.4MB. Max. memory is 33.6GB.
 * RCFGBuilder took 560.84ms. Allocated memory is still 234.9MB. Free memory was 190.5MB in the beginning and 122.9MB in the end (delta: 67.6MB). Peak memory consumption was 67.1MB. Max. memory is 33.6GB.
 * TraceAbstraction took 2648.00ms. Allocated memory is still 234.9MB. Free memory was 122.4MB in the beginning and 181.4MB in the end (delta: -58.9MB). There was no memory consumed. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Unknown line] : the set of constraint Horn clauses is satisfiable
    For all program executions holds that the set of constraint Horn clauses is satisfiable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 39 procedures, 152 locations, 256 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 8511 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6523 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 213 IncrementalHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 1988 mSDtfsCounter, 213 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=0, InterpolantAutomatonStates: 65, 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, 12 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 612 NumberOfCodeBlocks, 612 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 600 ConstructedInterpolants, 0 QuantifiedInterpolants, 867 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-05-07 17:27:04,245 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
