./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/external_calls/external_inc.sol_0_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:29:16,872 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:29:16,914 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060462f-eb69-44fb-bce1-c549ed366263/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:29:16,919 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:29:16,919 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:29:16,935 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:29:16,936 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:29:16,936 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:29:16,936 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:29:16,936 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:29:16,936 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:29:16,936 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:29:16,936 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:29:16,936 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:29:16,937 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:29:16,937 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:29:16,937 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:29:16,937 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:29:16,937 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:29:16,937 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:29:16,937 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:29:16,937 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:29:16,938 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:29:16,938 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:29:16,938 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:29:16,938 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:29:16,938 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:29:17,154 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:29:17,160 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:29:17,162 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:29:17,163 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:29:17,163 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:29:17,164 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060462f-eb69-44fb-bce1-c549ed366263/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/external_calls/external_inc.sol_0_no_adts_000.smt2
[2025-05-07 17:29:17,165 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:29:17,167 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:29:17,392 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6060462f-eb69-44fb-bce1-c549ed366263/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/external_calls/external_inc.sol_0_no_adts_000.smt2
[2025-05-07 17:29:17,394 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:29:17,395 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:29:17,396 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:29:17,396 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:29:17,396 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:29:17,398 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,424 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17 Unit
[2025-05-07 17:29:17,424 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:29:17,424 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:29:17,425 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:29:17,425 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:29:17,436 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,436 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,456 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,456 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,460 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,461 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,463 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,465 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,466 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,476 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:29:17,477 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:29:17,477 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:29:17,477 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:29:17,478 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (1/1) ...
[2025-05-07 17:29:17,480 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:29:17,490 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:17,500 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-05-07 17:29:17,503 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:29:17,515 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:29:17,515 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:29:17,515 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:29:17,515 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_3_0 given in one single declaration
[2025-05-07 17:29:17,516 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_3_0
[2025-05-07 17:29:17,516 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_3_0
[2025-05-07 17:29:17,516 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_5_C_32_0 given in one single declaration
[2025-05-07 17:29:17,516 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_5_C_32_0
[2025-05-07 17:29:17,516 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_5_C_32_0
[2025-05-07 17:29:17,516 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_7_C_32_0 given in one single declaration
[2025-05-07 17:29:17,516 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_7_C_32_0
[2025-05-07 17:29:17,516 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_7_C_32_0
[2025-05-07 17:29:17,516 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_26_C_32_0 given in one single declaration
[2025-05-07 17:29:17,516 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_26_C_32_0
[2025-05-07 17:29:17,516 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_26_C_32_0
[2025-05-07 17:29:17,517 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_28_C_32_0 given in one single declaration
[2025-05-07 17:29:17,517 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_28_C_32_0
[2025-05-07 17:29:17,517 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_28_C_32_0
[2025-05-07 17:29:17,517 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_27_C_32_0 given in one single declaration
[2025-05-07 17:29:17,517 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_27_C_32_0
[2025-05-07 17:29:17,517 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_27_C_32_0
[2025-05-07 17:29:17,517 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_29_C_32_0 given in one single declaration
[2025-05-07 17:29:17,517 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_29_C_32_0
[2025-05-07 17:29:17,517 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_29_C_32_0
[2025-05-07 17:29:17,517 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_9_function_inc__16_32_0 given in one single declaration
[2025-05-07 17:29:17,517 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_9_function_inc__16_32_0
[2025-05-07 17:29:17,517 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_9_function_inc__16_32_0
[2025-05-07 17:29:17,518 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_19_function_inc__16_32_0 given in one single declaration
[2025-05-07 17:29:17,518 INFO  L130     BoogieDeclarations]: Found specification of procedure block_19_function_inc__16_32_0
[2025-05-07 17:29:17,518 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_19_function_inc__16_32_0
[2025-05-07 17:29:17,518 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_8_function_inc__16_32_0 given in one single declaration
[2025-05-07 17:29:17,518 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_8_function_inc__16_32_0
[2025-05-07 17:29:17,518 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_8_function_inc__16_32_0
[2025-05-07 17:29:17,518 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_18_return_function_inc__16_32_0 given in one single declaration
[2025-05-07 17:29:17,518 INFO  L130     BoogieDeclarations]: Found specification of procedure block_18_return_function_inc__16_32_0
[2025-05-07 17:29:17,518 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_18_return_function_inc__16_32_0
[2025-05-07 17:29:17,518 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_17_inc_15_32_0 given in one single declaration
[2025-05-07 17:29:17,518 INFO  L130     BoogieDeclarations]: Found specification of procedure block_17_inc_15_32_0
[2025-05-07 17:29:17,518 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_17_inc_15_32_0
[2025-05-07 17:29:17,518 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_16_function_inc__16_32_0 given in one single declaration
[2025-05-07 17:29:17,519 INFO  L130     BoogieDeclarations]: Found specification of procedure block_16_function_inc__16_32_0
[2025-05-07 17:29:17,519 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_16_function_inc__16_32_0
[2025-05-07 17:29:17,519 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_11_function_f__31_32_0 given in one single declaration
[2025-05-07 17:29:17,519 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_11_function_f__31_32_0
[2025-05-07 17:29:17,519 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_11_function_f__31_32_0
[2025-05-07 17:29:17,519 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_10_function_f__31_32_0 given in one single declaration
[2025-05-07 17:29:17,519 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_10_function_f__31_32_0
[2025-05-07 17:29:17,519 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_10_function_f__31_32_0
[2025-05-07 17:29:17,519 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_21_f_30_32_0 given in one single declaration
[2025-05-07 17:29:17,519 INFO  L130     BoogieDeclarations]: Found specification of procedure block_21_f_30_32_0
[2025-05-07 17:29:17,519 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_21_f_30_32_0
[2025-05-07 17:29:17,519 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_20_function_f__31_32_0 given in one single declaration
[2025-05-07 17:29:17,519 INFO  L130     BoogieDeclarations]: Found specification of procedure block_20_function_f__31_32_0
[2025-05-07 17:29:17,519 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_20_function_f__31_32_0
[2025-05-07 17:29:17,520 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure nondet_call_23_0 given in one single declaration
[2025-05-07 17:29:17,520 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_call_23_0
[2025-05-07 17:29:17,520 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_call_23_0
[2025-05-07 17:29:17,520 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure nondet_interface_6_C_32_0 given in one single declaration
[2025-05-07 17:29:17,520 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_interface_6_C_32_0
[2025-05-07 17:29:17,520 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_interface_6_C_32_0
[2025-05-07 17:29:17,520 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_22_return_function_f__31_32_0 given in one single declaration
[2025-05-07 17:29:17,520 INFO  L130     BoogieDeclarations]: Found specification of procedure block_22_return_function_f__31_32_0
[2025-05-07 17:29:17,520 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_22_return_function_f__31_32_0
[2025-05-07 17:29:17,520 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_24_function_f__31_32_0 given in one single declaration
[2025-05-07 17:29:17,520 INFO  L130     BoogieDeclarations]: Found specification of procedure block_24_function_f__31_32_0
[2025-05-07 17:29:17,520 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_24_function_f__31_32_0
[2025-05-07 17:29:17,520 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_25_function_f__31_32_0 given in one single declaration
[2025-05-07 17:29:17,521 INFO  L130     BoogieDeclarations]: Found specification of procedure block_25_function_f__31_32_0
[2025-05-07 17:29:17,521 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_25_function_f__31_32_0
[2025-05-07 17:29:17,521 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:29:17,521 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:29:17,521 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:29:17,648 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:29:17,651 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:29:17,877 INFO  L?                        ?]: Removed 177 outVars from TransFormulas that were not future-live.
[2025-05-07 17:29:17,877 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:29:17,885 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:29:17,886 INFO  L312             CfgBuilder]: Removed 11 assume(true) statements.
[2025-05-07 17:29:17,886 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:29:17 BoogieIcfgContainer
[2025-05-07 17:29:17,886 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:29:17,887 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:29:17,887 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:29:17,890 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:29:17,890 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:29:17" (1/3) ...
[2025-05-07 17:29:17,890 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7435cae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:29:17, skipping insertion in model container
[2025-05-07 17:29:17,891 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:29:17" (2/3) ...
[2025-05-07 17:29:17,891 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7435cae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:29:17, skipping insertion in model container
[2025-05-07 17:29:17,891 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:29:17" (3/3) ...
[2025-05-07 17:29:17,892 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:29:17,901 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:29:17,903 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 24 procedures, 98 locations, 153 edges, 24 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:29:17,933 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:29:17,941 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;@3d6ff1ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:29:17,941 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:29:17,944 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 98 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 45 states have internal predecessors, (45), 35 states have call successors, (36), 23 states have call predecessors, (36), 23 states have return successors, (36), 30 states have call predecessors, (36), 35 states have call successors, (36)
[2025-05-07 17:29:17,950 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2025-05-07 17:29:17,950 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:17,951 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:17,951 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:17,954 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:17,955 INFO  L85        PathProgramCache]: Analyzing trace with hash -130553855, now seen corresponding path program 1 times
[2025-05-07 17:29:17,959 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:17,960 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749644279]
[2025-05-07 17:29:17,960 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:17,960 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:18,000 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes.
[2025-05-07 17:29:18,054 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements.
[2025-05-07 17:29:18,054 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:18,054 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:18,210 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:18,211 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:18,211 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749644279]
[2025-05-07 17:29:18,212 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749644279] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:18,212 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:18,214 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:29:18,216 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86687919]
[2025-05-07 17:29:18,216 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:18,220 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:29:18,220 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:18,245 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:29:18,246 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:29:18,248 INFO  L87              Difference]: Start difference. First operand  has 98 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 45 states have internal predecessors, (45), 35 states have call successors, (36), 23 states have call predecessors, (36), 23 states have return successors, (36), 30 states have call predecessors, (36), 35 states have call successors, (36) Second operand  has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)
[2025-05-07 17:29:18,349 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:18,350 INFO  L93              Difference]: Finished difference Result 102 states and 124 transitions.
[2025-05-07 17:29:18,351 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:29:18,352 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 55
[2025-05-07 17:29:18,352 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:18,358 INFO  L225             Difference]: With dead ends: 102
[2025-05-07 17:29:18,358 INFO  L226             Difference]: Without dead ends: 102
[2025-05-07 17:29:18,359 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:29:18,361 INFO  L437           NwaCegarLoop]: 111 mSDtfsCounter, 1 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:18,362 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 433 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:18,372 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2025-05-07 17:29:18,389 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100.
[2025-05-07 17:29:18,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 100 states, 40 states have (on average 1.125) internal successors, (45), 45 states have internal predecessors, (45), 35 states have call successors, (36), 23 states have call predecessors, (36), 25 states have return successors, (41), 31 states have call predecessors, (41), 35 states have call successors, (41)
[2025-05-07 17:29:18,394 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions.
[2025-05-07 17:29:18,395 INFO  L79                 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 55
[2025-05-07 17:29:18,395 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:18,395 INFO  L485      AbstractCegarLoop]: Abstraction has 100 states and 122 transitions.
[2025-05-07 17:29:18,396 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)
[2025-05-07 17:29:18,396 INFO  L278                IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions.
[2025-05-07 17:29:18,397 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:29:18,398 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:18,398 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:18,398 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:29:18,398 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:18,398 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:18,399 INFO  L85        PathProgramCache]: Analyzing trace with hash -1096715330, now seen corresponding path program 1 times
[2025-05-07 17:29:18,399 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:18,399 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460982794]
[2025-05-07 17:29:18,399 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:18,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:18,431 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:29:18,447 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:29:18,447 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:18,447 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:18,553 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:18,553 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:18,553 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460982794]
[2025-05-07 17:29:18,553 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460982794] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:18,553 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:18,553 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:18,553 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351974165]
[2025-05-07 17:29:18,553 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:18,554 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:18,555 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:18,555 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:18,555 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:18,555 INFO  L87              Difference]: Start difference. First operand 100 states and 122 transitions. Second operand  has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:29:18,567 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:18,568 INFO  L93              Difference]: Finished difference Result 104 states and 127 transitions.
[2025-05-07 17:29:18,568 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:18,568 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 58
[2025-05-07 17:29:18,568 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:18,569 INFO  L225             Difference]: With dead ends: 104
[2025-05-07 17:29:18,569 INFO  L226             Difference]: Without dead ends: 100
[2025-05-07 17:29:18,570 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:18,570 INFO  L437           NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 338 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:29:18,570 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 338 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:18,571 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 100 states.
[2025-05-07 17:29:18,577 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98.
[2025-05-07 17:29:18,577 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 98 states, 40 states have (on average 1.1) internal successors, (44), 44 states have internal predecessors, (44), 33 states have call successors, (34), 23 states have call predecessors, (34), 25 states have return successors, (39), 30 states have call predecessors, (39), 33 states have call successors, (39)
[2025-05-07 17:29:18,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions.
[2025-05-07 17:29:18,578 INFO  L79                 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 58
[2025-05-07 17:29:18,579 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:18,579 INFO  L485      AbstractCegarLoop]: Abstraction has 98 states and 117 transitions.
[2025-05-07 17:29:18,579 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:29:18,579 INFO  L278                IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions.
[2025-05-07 17:29:18,581 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:29:18,581 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:18,581 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:18,581 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:29:18,581 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:18,581 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:18,581 INFO  L85        PathProgramCache]: Analyzing trace with hash -8507838, now seen corresponding path program 1 times
[2025-05-07 17:29:18,582 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:18,582 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600037196]
[2025-05-07 17:29:18,582 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:18,582 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:18,606 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:29:18,619 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:29:18,619 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:18,619 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:18,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:18,711 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:18,711 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600037196]
[2025-05-07 17:29:18,711 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600037196] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:18,711 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:18,711 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:29:18,711 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882435087]
[2025-05-07 17:29:18,711 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:18,712 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:29:18,712 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:18,712 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:29:18,712 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:18,713 INFO  L87              Difference]: Start difference. First operand 98 states and 117 transitions. Second operand  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:29:18,764 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:18,765 INFO  L93              Difference]: Finished difference Result 102 states and 122 transitions.
[2025-05-07 17:29:18,765 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:29:18,765 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) Word has length 58
[2025-05-07 17:29:18,766 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:18,766 INFO  L225             Difference]: With dead ends: 102
[2025-05-07 17:29:18,767 INFO  L226             Difference]: Without dead ends: 102
[2025-05-07 17:29:18,767 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:29:18,767 INFO  L437           NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:18,767 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 527 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:29:18,768 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 102 states.
[2025-05-07 17:29:18,772 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102.
[2025-05-07 17:29:18,773 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 102 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 46 states have internal predecessors, (46), 33 states have call successors, (34), 23 states have call predecessors, (34), 27 states have return successors, (42), 32 states have call predecessors, (42), 33 states have call successors, (42)
[2025-05-07 17:29:18,773 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions.
[2025-05-07 17:29:18,773 INFO  L79                 Accepts]: Start accepts. Automaton has 102 states and 122 transitions. Word has length 58
[2025-05-07 17:29:18,774 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:18,774 INFO  L485      AbstractCegarLoop]: Abstraction has 102 states and 122 transitions.
[2025-05-07 17:29:18,774 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:29:18,774 INFO  L278                IsEmpty]: Start isEmpty. Operand 102 states and 122 transitions.
[2025-05-07 17:29:18,775 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:29:18,775 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:18,775 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:18,775 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:29:18,775 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:18,776 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:18,776 INFO  L85        PathProgramCache]: Analyzing trace with hash -1603170558, now seen corresponding path program 1 times
[2025-05-07 17:29:18,776 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:18,776 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842500978]
[2025-05-07 17:29:18,776 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:18,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:18,793 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:29:18,802 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:29:18,802 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:18,802 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:19,168 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:29:19,169 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:19,169 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842500978]
[2025-05-07 17:29:19,169 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842500978] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:19,169 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:19,169 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19
[2025-05-07 17:29:19,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331183009]
[2025-05-07 17:29:19,169 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:19,169 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2025-05-07 17:29:19,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:19,170 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2025-05-07 17:29:19,170 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342
[2025-05-07 17:29:19,171 INFO  L87              Difference]: Start difference. First operand 102 states and 122 transitions. Second operand  has 19 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 16 states have internal predecessors, (26), 7 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16)
[2025-05-07 17:29:19,570 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:19,571 INFO  L93              Difference]: Finished difference Result 113 states and 138 transitions.
[2025-05-07 17:29:19,571 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2025-05-07 17:29:19,571 INFO  L79                 Accepts]: Start accepts. Automaton has  has 19 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 16 states have internal predecessors, (26), 7 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16) Word has length 58
[2025-05-07 17:29:19,571 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:19,573 INFO  L225             Difference]: With dead ends: 113
[2025-05-07 17:29:19,573 INFO  L226             Difference]: Without dead ends: 113
[2025-05-07 17:29:19,573 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462
[2025-05-07 17:29:19,574 INFO  L437           NwaCegarLoop]: 99 mSDtfsCounter, 4 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:19,574 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1721 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:29:19,575 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 113 states.
[2025-05-07 17:29:19,585 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111.
[2025-05-07 17:29:19,585 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 111 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 50 states have internal predecessors, (50), 34 states have call successors, (35), 23 states have call predecessors, (35), 31 states have return successors, (51), 37 states have call predecessors, (51), 34 states have call successors, (51)
[2025-05-07 17:29:19,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 136 transitions.
[2025-05-07 17:29:19,586 INFO  L79                 Accepts]: Start accepts. Automaton has 111 states and 136 transitions. Word has length 58
[2025-05-07 17:29:19,587 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:19,587 INFO  L485      AbstractCegarLoop]: Abstraction has 111 states and 136 transitions.
[2025-05-07 17:29:19,587 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 16 states have internal predecessors, (26), 7 states have call successors, (16), 1 states have call predecessors, (16), 14 states have return successors, (16), 14 states have call predecessors, (16), 7 states have call successors, (16)
[2025-05-07 17:29:19,587 INFO  L278                IsEmpty]: Start isEmpty. Operand 111 states and 136 transitions.
[2025-05-07 17:29:19,589 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-05-07 17:29:19,589 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:19,590 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:19,590 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:29:19,590 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:19,590 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:19,590 INFO  L85        PathProgramCache]: Analyzing trace with hash 1155008254, now seen corresponding path program 1 times
[2025-05-07 17:29:19,590 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:19,591 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122690186]
[2025-05-07 17:29:19,591 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:19,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:19,629 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:29:19,641 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:29:19,641 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:19,642 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:19,772 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-05-07 17:29:19,772 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:19,772 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122690186]
[2025-05-07 17:29:19,772 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122690186] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:19,772 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73285801]
[2025-05-07 17:29:19,772 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:19,772 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:19,775 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:19,776 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:29:19,777 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:29:19,992 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:29:20,118 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:29:20,118 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:20,118 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:20,123 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:20,132 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:20,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-05-07 17:29:20,239 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:29:21,281 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-05-07 17:29:21,281 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [73285801] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:29:21,281 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:29:21,281 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14
[2025-05-07 17:29:21,281 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033030997]
[2025-05-07 17:29:21,281 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:29:21,282 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:29:21,282 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:21,283 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:29:21,283 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:29:21,284 INFO  L87              Difference]: Start difference. First operand 111 states and 136 transitions. Second operand  has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 6 states have call successors, (30), 2 states have call predecessors, (30), 12 states have return successors, (37), 14 states have call predecessors, (37), 6 states have call successors, (37)
[2025-05-07 17:29:21,498 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:21,498 INFO  L93              Difference]: Finished difference Result 139 states and 196 transitions.
[2025-05-07 17:29:21,499 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-05-07 17:29:21,499 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 6 states have call successors, (30), 2 states have call predecessors, (30), 12 states have return successors, (37), 14 states have call predecessors, (37), 6 states have call successors, (37) Word has length 90
[2025-05-07 17:29:21,499 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:21,500 INFO  L225             Difference]: With dead ends: 139
[2025-05-07 17:29:21,500 INFO  L226             Difference]: Without dead ends: 139
[2025-05-07 17:29:21,500 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 169 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:29:21,501 INFO  L437           NwaCegarLoop]: 115 mSDtfsCounter, 5 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:21,501 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1205 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:29:21,502 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 139 states.
[2025-05-07 17:29:21,516 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 129.
[2025-05-07 17:29:21,516 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 57 states have internal predecessors, (58), 42 states have call successors, (44), 27 states have call predecessors, (44), 35 states have return successors, (73), 44 states have call predecessors, (73), 42 states have call successors, (73)
[2025-05-07 17:29:21,517 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 175 transitions.
[2025-05-07 17:29:21,518 INFO  L79                 Accepts]: Start accepts. Automaton has 129 states and 175 transitions. Word has length 90
[2025-05-07 17:29:21,518 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:21,518 INFO  L485      AbstractCegarLoop]: Abstraction has 129 states and 175 transitions.
[2025-05-07 17:29:21,518 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 6 states have call successors, (30), 2 states have call predecessors, (30), 12 states have return successors, (37), 14 states have call predecessors, (37), 6 states have call successors, (37)
[2025-05-07 17:29:21,518 INFO  L278                IsEmpty]: Start isEmpty. Operand 129 states and 175 transitions.
[2025-05-07 17:29:21,519 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-05-07 17:29:21,519 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:21,519 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:21,524 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:29:21,720 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2025-05-07 17:29:21,721 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:21,724 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:21,724 INFO  L85        PathProgramCache]: Analyzing trace with hash -1995008450, now seen corresponding path program 1 times
[2025-05-07 17:29:21,724 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:21,724 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928581067]
[2025-05-07 17:29:21,725 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:21,725 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:21,822 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:29:21,835 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:29:21,836 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:21,836 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:22,376 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2025-05-07 17:29:22,376 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:22,376 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928581067]
[2025-05-07 17:29:22,376 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928581067] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:22,376 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333966550]
[2025-05-07 17:29:22,376 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:22,376 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:22,378 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:22,379 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:29:22,380 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-05-07 17:29:22,556 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:29:22,662 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:29:22,662 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:22,662 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:22,667 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 44 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:22,672 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:23,202 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2025-05-07 17:29:23,202 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:29:34,959 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-05-07 17:29:34,959 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333966550] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:29:34,959 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:29:34,959 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 26] total 59
[2025-05-07 17:29:34,959 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729300462]
[2025-05-07 17:29:34,959 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:29:34,960 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 59 states
[2025-05-07 17:29:34,960 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:34,961 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants.
[2025-05-07 17:29:34,963 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=3246, Unknown=0, NotChecked=0, Total=3422
[2025-05-07 17:29:34,963 INFO  L87              Difference]: Start difference. First operand 129 states and 175 transitions. Second operand  has 59 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 44 states have internal predecessors, (62), 26 states have call successors, (41), 1 states have call predecessors, (41), 37 states have return successors, (59), 50 states have call predecessors, (59), 26 states have call successors, (59)
[2025-05-07 17:29:35,671 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:35,671 INFO  L93              Difference]: Finished difference Result 164 states and 244 transitions.
[2025-05-07 17:29:35,672 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-05-07 17:29:35,672 INFO  L79                 Accepts]: Start accepts. Automaton has  has 59 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 44 states have internal predecessors, (62), 26 states have call successors, (41), 1 states have call predecessors, (41), 37 states have return successors, (59), 50 states have call predecessors, (59), 26 states have call successors, (59) Word has length 90
[2025-05-07 17:29:35,672 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:35,674 INFO  L225             Difference]: With dead ends: 164
[2025-05-07 17:29:35,674 INFO  L226             Difference]: Without dead ends: 164
[2025-05-07 17:29:35,675 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 137 SyntacticMatches, 14 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1144 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=233, Invalid=4057, Unknown=0, NotChecked=0, Total=4290
[2025-05-07 17:29:35,676 INFO  L437           NwaCegarLoop]: 96 mSDtfsCounter, 21 mSDsluCounter, 3144 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3240 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:35,676 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3240 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-05-07 17:29:35,677 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 164 states.
[2025-05-07 17:29:35,691 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 145.
[2025-05-07 17:29:35,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 145 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 64 states have internal predecessors, (65), 44 states have call successors, (46), 27 states have call predecessors, (46), 42 states have return successors, (90), 54 states have call predecessors, (90), 44 states have call successors, (90)
[2025-05-07 17:29:35,693 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 201 transitions.
[2025-05-07 17:29:35,693 INFO  L79                 Accepts]: Start accepts. Automaton has 145 states and 201 transitions. Word has length 90
[2025-05-07 17:29:35,693 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:35,693 INFO  L485      AbstractCegarLoop]: Abstraction has 145 states and 201 transitions.
[2025-05-07 17:29:35,694 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 59 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 44 states have internal predecessors, (62), 26 states have call successors, (41), 1 states have call predecessors, (41), 37 states have return successors, (59), 50 states have call predecessors, (59), 26 states have call successors, (59)
[2025-05-07 17:29:35,694 INFO  L278                IsEmpty]: Start isEmpty. Operand 145 states and 201 transitions.
[2025-05-07 17:29:35,695 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-05-07 17:29:35,695 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:35,695 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:35,700 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-05-07 17:29:35,896 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:35,897 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:35,897 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:35,898 INFO  L85        PathProgramCache]: Analyzing trace with hash -530810299, now seen corresponding path program 1 times
[2025-05-07 17:29:35,898 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:35,898 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389650129]
[2025-05-07 17:29:35,898 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:35,898 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:35,995 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-05-07 17:29:36,008 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-05-07 17:29:36,008 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:36,008 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:36,101 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-05-07 17:29:36,101 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:36,101 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389650129]
[2025-05-07 17:29:36,101 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389650129] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:36,101 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:36,101 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:29:36,101 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602858619]
[2025-05-07 17:29:36,101 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:36,102 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:29:36,102 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:36,102 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:29:36,102 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:29:36,102 INFO  L87              Difference]: Start difference. First operand 145 states and 201 transitions. Second operand  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22)
[2025-05-07 17:29:36,180 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:36,180 INFO  L93              Difference]: Finished difference Result 155 states and 215 transitions.
[2025-05-07 17:29:36,181 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:29:36,181 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22) Word has length 87
[2025-05-07 17:29:36,181 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:36,182 INFO  L225             Difference]: With dead ends: 155
[2025-05-07 17:29:36,182 INFO  L226             Difference]: Without dead ends: 139
[2025-05-07 17:29:36,182 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:29:36,182 INFO  L437           NwaCegarLoop]: 105 mSDtfsCounter, 1 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:36,183 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 712 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:29:36,183 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 139 states.
[2025-05-07 17:29:36,189 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132.
[2025-05-07 17:29:36,189 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 132 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 58 states have internal predecessors, (59), 43 states have call successors, (44), 27 states have call predecessors, (44), 36 states have return successors, (78), 47 states have call predecessors, (78), 43 states have call successors, (78)
[2025-05-07 17:29:36,190 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 181 transitions.
[2025-05-07 17:29:36,190 INFO  L79                 Accepts]: Start accepts. Automaton has 132 states and 181 transitions. Word has length 87
[2025-05-07 17:29:36,190 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:36,190 INFO  L485      AbstractCegarLoop]: Abstraction has 132 states and 181 transitions.
[2025-05-07 17:29:36,190 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 4 states have call successors, (20), 1 states have call predecessors, (20), 7 states have return successors, (22), 7 states have call predecessors, (22), 4 states have call successors, (22)
[2025-05-07 17:29:36,190 INFO  L278                IsEmpty]: Start isEmpty. Operand 132 states and 181 transitions.
[2025-05-07 17:29:36,191 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-05-07 17:29:36,191 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:36,191 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:36,191 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:29:36,191 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:36,191 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:36,191 INFO  L85        PathProgramCache]: Analyzing trace with hash -1146912379, now seen corresponding path program 1 times
[2025-05-07 17:29:36,192 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:36,192 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045849819]
[2025-05-07 17:29:36,192 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:36,192 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:36,216 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-05-07 17:29:36,223 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-05-07 17:29:36,223 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:36,223 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:36,645 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-05-07 17:29:36,645 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:36,645 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045849819]
[2025-05-07 17:29:36,645 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045849819] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:36,645 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033193637]
[2025-05-07 17:29:36,645 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:36,645 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:36,648 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:36,649 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:29:36,650 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-05-07 17:29:36,888 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-05-07 17:29:36,978 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-05-07 17:29:36,978 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:36,978 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:36,982 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 38 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:36,984 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:37,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-05-07 17:29:37,368 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:29:45,742 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-05-07 17:29:45,742 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033193637] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:29:45,743 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:29:45,743 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 26] total 58
[2025-05-07 17:29:45,743 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058176927]
[2025-05-07 17:29:45,743 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:29:45,744 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 58 states
[2025-05-07 17:29:45,744 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:45,745 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants.
[2025-05-07 17:29:45,746 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3133, Unknown=0, NotChecked=0, Total=3306
[2025-05-07 17:29:45,747 INFO  L87              Difference]: Start difference. First operand 132 states and 181 transitions. Second operand  has 58 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 43 states have internal predecessors, (62), 26 states have call successors, (40), 1 states have call predecessors, (40), 36 states have return successors, (57), 46 states have call predecessors, (57), 26 states have call successors, (57)
[2025-05-07 17:29:46,334 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:46,334 INFO  L93              Difference]: Finished difference Result 179 states and 302 transitions.
[2025-05-07 17:29:46,334 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2025-05-07 17:29:46,334 INFO  L79                 Accepts]: Start accepts. Automaton has  has 58 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 43 states have internal predecessors, (62), 26 states have call successors, (40), 1 states have call predecessors, (40), 36 states have return successors, (57), 46 states have call predecessors, (57), 26 states have call successors, (57) Word has length 87
[2025-05-07 17:29:46,335 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:46,336 INFO  L225             Difference]: With dead ends: 179
[2025-05-07 17:29:46,336 INFO  L226             Difference]: Without dead ends: 179
[2025-05-07 17:29:46,336 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 134 SyntacticMatches, 11 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1052 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=223, Invalid=3809, Unknown=0, NotChecked=0, Total=4032
[2025-05-07 17:29:46,337 INFO  L437           NwaCegarLoop]: 101 mSDtfsCounter, 16 mSDsluCounter, 3408 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3509 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:46,337 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3509 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-05-07 17:29:46,337 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 179 states.
[2025-05-07 17:29:46,347 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 157.
[2025-05-07 17:29:46,347 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 157 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 67 states have internal predecessors, (68), 50 states have call successors, (51), 27 states have call predecessors, (51), 45 states have return successors, (128), 62 states have call predecessors, (128), 50 states have call successors, (128)
[2025-05-07 17:29:46,348 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 247 transitions.
[2025-05-07 17:29:46,348 INFO  L79                 Accepts]: Start accepts. Automaton has 157 states and 247 transitions. Word has length 87
[2025-05-07 17:29:46,348 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:46,348 INFO  L485      AbstractCegarLoop]: Abstraction has 157 states and 247 transitions.
[2025-05-07 17:29:46,348 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 58 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 43 states have internal predecessors, (62), 26 states have call successors, (40), 1 states have call predecessors, (40), 36 states have return successors, (57), 46 states have call predecessors, (57), 26 states have call successors, (57)
[2025-05-07 17:29:46,348 INFO  L278                IsEmpty]: Start isEmpty. Operand 157 states and 247 transitions.
[2025-05-07 17:29:46,349 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-05-07 17:29:46,349 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:46,350 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:46,354 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-05-07 17:29:46,550 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:46,551 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:46,552 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:46,552 INFO  L85        PathProgramCache]: Analyzing trace with hash -199907739, now seen corresponding path program 1 times
[2025-05-07 17:29:46,552 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:46,552 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268459733]
[2025-05-07 17:29:46,553 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:46,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:46,656 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-05-07 17:29:46,668 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-05-07 17:29:46,668 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:46,668 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:47,263 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:29:47,263 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:47,263 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268459733]
[2025-05-07 17:29:47,263 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268459733] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:47,263 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644901464]
[2025-05-07 17:29:47,264 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:47,264 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:47,266 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:47,267 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:29:47,268 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-05-07 17:29:47,701 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-05-07 17:29:47,779 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-05-07 17:29:47,779 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:47,779 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:47,784 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 41 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:47,786 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:48,247 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:29:48,247 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:29:56,506 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:29:56,506 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [644901464] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:29:56,506 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:29:56,507 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 63
[2025-05-07 17:29:56,507 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116681532]
[2025-05-07 17:29:56,507 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:29:56,507 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 63 states
[2025-05-07 17:29:56,507 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:56,508 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants.
[2025-05-07 17:29:56,509 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=3718, Unknown=0, NotChecked=0, Total=3906
[2025-05-07 17:29:56,510 INFO  L87              Difference]: Start difference. First operand 157 states and 247 transitions. Second operand  has 63 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 51 states have internal predecessors, (72), 30 states have call successors, (43), 1 states have call predecessors, (43), 41 states have return successors, (59), 48 states have call predecessors, (59), 30 states have call successors, (59)
[2025-05-07 17:29:57,175 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:57,175 INFO  L93              Difference]: Finished difference Result 199 states and 348 transitions.
[2025-05-07 17:29:57,175 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. 
[2025-05-07 17:29:57,175 INFO  L79                 Accepts]: Start accepts. Automaton has  has 63 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 51 states have internal predecessors, (72), 30 states have call successors, (43), 1 states have call predecessors, (43), 41 states have return successors, (59), 48 states have call predecessors, (59), 30 states have call successors, (59) Word has length 83
[2025-05-07 17:29:57,176 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:57,177 INFO  L225             Difference]: With dead ends: 199
[2025-05-07 17:29:57,177 INFO  L226             Difference]: Without dead ends: 199
[2025-05-07 17:29:57,178 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 119 SyntacticMatches, 12 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1321 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=243, Invalid=4727, Unknown=0, NotChecked=0, Total=4970
[2025-05-07 17:29:57,178 INFO  L437           NwaCegarLoop]: 87 mSDtfsCounter, 18 mSDsluCounter, 3096 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3183 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:57,179 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3183 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-05-07 17:29:57,179 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 199 states.
[2025-05-07 17:29:57,198 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 167.
[2025-05-07 17:29:57,198 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 167 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 71 states have internal predecessors, (72), 52 states have call successors, (53), 27 states have call predecessors, (53), 49 states have return successors, (139), 68 states have call predecessors, (139), 52 states have call successors, (139)
[2025-05-07 17:29:57,200 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 264 transitions.
[2025-05-07 17:29:57,200 INFO  L79                 Accepts]: Start accepts. Automaton has 167 states and 264 transitions. Word has length 83
[2025-05-07 17:29:57,200 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:57,200 INFO  L485      AbstractCegarLoop]: Abstraction has 167 states and 264 transitions.
[2025-05-07 17:29:57,201 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 63 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 51 states have internal predecessors, (72), 30 states have call successors, (43), 1 states have call predecessors, (43), 41 states have return successors, (59), 48 states have call predecessors, (59), 30 states have call successors, (59)
[2025-05-07 17:29:57,201 INFO  L278                IsEmpty]: Start isEmpty. Operand 167 states and 264 transitions.
[2025-05-07 17:29:57,202 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 84
[2025-05-07 17:29:57,202 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:57,203 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:57,208 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-05-07 17:29:57,403 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2025-05-07 17:29:57,404 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:57,405 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:57,405 INFO  L85        PathProgramCache]: Analyzing trace with hash -1154226153, now seen corresponding path program 1 times
[2025-05-07 17:29:57,405 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:57,405 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115101769]
[2025-05-07 17:29:57,405 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:57,406 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:57,513 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-05-07 17:29:57,532 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-05-07 17:29:57,532 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:57,533 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:58,103 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:29:58,103 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:58,103 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115101769]
[2025-05-07 17:29:58,103 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115101769] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:29:58,103 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794053487]
[2025-05-07 17:29:58,103 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:58,103 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:29:58,105 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:29:58,106 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:29:58,107 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-05-07 17:29:58,561 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes.
[2025-05-07 17:29:58,646 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements.
[2025-05-07 17:29:58,646 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:58,646 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:58,649 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 40 conjuncts are in the unsatisfiable core
[2025-05-07 17:29:58,651 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:29:59,068 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:29:59,068 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:30:03,905 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:30:03,905 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794053487] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:30:03,905 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:30:03,905 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 61
[2025-05-07 17:30:03,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477691131]
[2025-05-07 17:30:03,905 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:30:03,906 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 61 states
[2025-05-07 17:30:03,906 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:03,906 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants.
[2025-05-07 17:30:03,907 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=3474, Unknown=0, NotChecked=0, Total=3660
[2025-05-07 17:30:03,907 INFO  L87              Difference]: Start difference. First operand 167 states and 264 transitions. Second operand  has 61 states, 40 states have (on average 1.775) internal successors, (71), 50 states have internal predecessors, (71), 30 states have call successors, (43), 1 states have call predecessors, (43), 40 states have return successors, (58), 46 states have call predecessors, (58), 30 states have call successors, (58)
[2025-05-07 17:30:04,681 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:04,681 INFO  L93              Difference]: Finished difference Result 183 states and 307 transitions.
[2025-05-07 17:30:04,682 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2025-05-07 17:30:04,682 INFO  L79                 Accepts]: Start accepts. Automaton has  has 61 states, 40 states have (on average 1.775) internal successors, (71), 50 states have internal predecessors, (71), 30 states have call successors, (43), 1 states have call predecessors, (43), 40 states have return successors, (58), 46 states have call predecessors, (58), 30 states have call successors, (58) Word has length 83
[2025-05-07 17:30:04,682 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:04,683 INFO  L225             Difference]: With dead ends: 183
[2025-05-07 17:30:04,683 INFO  L226             Difference]: Without dead ends: 183
[2025-05-07 17:30:04,684 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 124 SyntacticMatches, 9 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=233, Invalid=4323, Unknown=0, NotChecked=0, Total=4556
[2025-05-07 17:30:04,685 INFO  L437           NwaCegarLoop]: 93 mSDtfsCounter, 18 mSDsluCounter, 2811 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2904 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:04,685 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2904 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-05-07 17:30:04,685 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 183 states.
[2025-05-07 17:30:04,694 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 177.
[2025-05-07 17:30:04,694 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 177 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 75 states have internal predecessors, (76), 54 states have call successors, (55), 27 states have call predecessors, (55), 53 states have return successors, (160), 74 states have call predecessors, (160), 54 states have call successors, (160)
[2025-05-07 17:30:04,695 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 291 transitions.
[2025-05-07 17:30:04,695 INFO  L79                 Accepts]: Start accepts. Automaton has 177 states and 291 transitions. Word has length 83
[2025-05-07 17:30:04,695 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:04,695 INFO  L485      AbstractCegarLoop]: Abstraction has 177 states and 291 transitions.
[2025-05-07 17:30:04,695 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 61 states, 40 states have (on average 1.775) internal successors, (71), 50 states have internal predecessors, (71), 30 states have call successors, (43), 1 states have call predecessors, (43), 40 states have return successors, (58), 46 states have call predecessors, (58), 30 states have call successors, (58)
[2025-05-07 17:30:04,695 INFO  L278                IsEmpty]: Start isEmpty. Operand 177 states and 291 transitions.
[2025-05-07 17:30:04,696 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-05-07 17:30:04,696 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:04,697 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:30:04,702 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-05-07 17:30:04,897 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:30:04,898 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:04,899 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:04,899 INFO  L85        PathProgramCache]: Analyzing trace with hash 318330710, now seen corresponding path program 1 times
[2025-05-07 17:30:04,899 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:04,900 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629699922]
[2025-05-07 17:30:04,900 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:04,900 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:05,000 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-05-07 17:30:05,010 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-05-07 17:30:05,010 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:05,010 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:05,132 INFO  L134       CoverageAnalysis]: Checked inductivity of 83 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked.
[2025-05-07 17:30:05,133 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:05,133 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629699922]
[2025-05-07 17:30:05,133 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629699922] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:30:05,133 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:30:05,133 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:30:05,133 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686072279]
[2025-05-07 17:30:05,133 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:30:05,133 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:30:05,133 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:05,134 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:30:05,134 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:30:05,134 INFO  L87              Difference]: Start difference. First operand 177 states and 291 transitions. Second operand  has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 4 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (27), 5 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:30:05,170 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:05,170 INFO  L93              Difference]: Finished difference Result 184 states and 309 transitions.
[2025-05-07 17:30:05,171 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:30:05,171 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 4 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (27), 5 states have call predecessors, (27), 4 states have call successors, (27) Word has length 122
[2025-05-07 17:30:05,171 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:05,172 INFO  L225             Difference]: With dead ends: 184
[2025-05-07 17:30:05,172 INFO  L226             Difference]: Without dead ends: 184
[2025-05-07 17:30:05,172 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:30:05,173 INFO  L437           NwaCegarLoop]: 114 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:05,173 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 548 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:30:05,173 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 184 states.
[2025-05-07 17:30:05,181 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184.
[2025-05-07 17:30:05,181 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 184 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 79 states have internal predecessors, (80), 53 states have call successors, (54), 27 states have call predecessors, (54), 57 states have return successors, (175), 77 states have call predecessors, (175), 53 states have call successors, (175)
[2025-05-07 17:30:05,182 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 309 transitions.
[2025-05-07 17:30:05,182 INFO  L79                 Accepts]: Start accepts. Automaton has 184 states and 309 transitions. Word has length 122
[2025-05-07 17:30:05,183 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:05,183 INFO  L485      AbstractCegarLoop]: Abstraction has 184 states and 309 transitions.
[2025-05-07 17:30:05,183 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 4 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (27), 5 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:30:05,183 INFO  L278                IsEmpty]: Start isEmpty. Operand 184 states and 309 transitions.
[2025-05-07 17:30:05,184 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2025-05-07 17:30:05,184 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:05,184 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:30:05,184 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:30:05,184 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:05,185 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:05,185 INFO  L85        PathProgramCache]: Analyzing trace with hash -966509477, now seen corresponding path program 1 times
[2025-05-07 17:30:05,185 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:05,185 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166008404]
[2025-05-07 17:30:05,185 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:05,185 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:05,220 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-05-07 17:30:05,231 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-05-07 17:30:05,231 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:05,231 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:06,061 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2025-05-07 17:30:06,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:06,061 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166008404]
[2025-05-07 17:30:06,062 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166008404] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:30:06,062 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403167984]
[2025-05-07 17:30:06,062 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:06,062 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:30:06,063 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:30:06,064 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:30:06,065 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-05-07 17:30:06,580 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-05-07 17:30:06,758 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-05-07 17:30:06,759 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:06,759 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:06,764 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1574 conjuncts, 57 conjuncts are in the unsatisfiable core
[2025-05-07 17:30:06,768 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:30:07,335 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked.
[2025-05-07 17:30:07,335 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:30:21,956 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked.
[2025-05-07 17:30:21,956 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403167984] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:30:21,956 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:30:21,956 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 34] total 74
[2025-05-07 17:30:21,956 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255121754]
[2025-05-07 17:30:21,956 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:30:21,957 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 74 states
[2025-05-07 17:30:21,957 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:21,958 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants.
[2025-05-07 17:30:21,958 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=5173, Unknown=0, NotChecked=0, Total=5402
[2025-05-07 17:30:21,959 INFO  L87              Difference]: Start difference. First operand 184 states and 309 transitions. Second operand  has 74 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 57 states have internal predecessors, (80), 37 states have call successors, (54), 1 states have call predecessors, (54), 46 states have return successors, (76), 61 states have call predecessors, (76), 37 states have call successors, (76)
[2025-05-07 17:30:23,159 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:23,159 INFO  L93              Difference]: Finished difference Result 207 states and 378 transitions.
[2025-05-07 17:30:23,160 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2025-05-07 17:30:23,160 INFO  L79                 Accepts]: Start accepts. Automaton has  has 74 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 57 states have internal predecessors, (80), 37 states have call successors, (54), 1 states have call predecessors, (54), 46 states have return successors, (76), 61 states have call predecessors, (76), 37 states have call successors, (76) Word has length 115
[2025-05-07 17:30:23,160 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:23,162 INFO  L225             Difference]: With dead ends: 207
[2025-05-07 17:30:23,162 INFO  L226             Difference]: Without dead ends: 207
[2025-05-07 17:30:23,163 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 178 SyntacticMatches, 16 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1839 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=299, Invalid=6673, Unknown=0, NotChecked=0, Total=6972
[2025-05-07 17:30:23,163 INFO  L437           NwaCegarLoop]: 93 mSDtfsCounter, 25 mSDsluCounter, 3680 mSDsCounter, 0 mSdLazyCounter, 1970 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 3773 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:23,163 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 3773 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1970 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-05-07 17:30:23,164 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 207 states.
[2025-05-07 17:30:23,173 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 191.
[2025-05-07 17:30:23,173 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 191 states, 78 states have (on average 1.064102564102564) internal successors, (83), 82 states have internal predecessors, (83), 54 states have call successors, (55), 27 states have call predecessors, (55), 60 states have return successors, (190), 81 states have call predecessors, (190), 54 states have call successors, (190)
[2025-05-07 17:30:23,174 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 328 transitions.
[2025-05-07 17:30:23,175 INFO  L79                 Accepts]: Start accepts. Automaton has 191 states and 328 transitions. Word has length 115
[2025-05-07 17:30:23,175 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:23,175 INFO  L485      AbstractCegarLoop]: Abstraction has 191 states and 328 transitions.
[2025-05-07 17:30:23,175 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 74 states, 46 states have (on average 1.7391304347826086) internal successors, (80), 57 states have internal predecessors, (80), 37 states have call successors, (54), 1 states have call predecessors, (54), 46 states have return successors, (76), 61 states have call predecessors, (76), 37 states have call successors, (76)
[2025-05-07 17:30:23,175 INFO  L278                IsEmpty]: Start isEmpty. Operand 191 states and 328 transitions.
[2025-05-07 17:30:23,176 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-05-07 17:30:23,176 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:23,176 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:30:23,183 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-05-07 17:30:23,377 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-05-07 17:30:23,377 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:23,377 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:23,377 INFO  L85        PathProgramCache]: Analyzing trace with hash 1139296342, now seen corresponding path program 2 times
[2025-05-07 17:30:23,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:23,377 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622184279]
[2025-05-07 17:30:23,378 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:30:23,378 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:23,429 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes.
[2025-05-07 17:30:23,441 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements.
[2025-05-07 17:30:23,441 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:30:23,441 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:23,583 INFO  L134       CoverageAnalysis]: Checked inductivity of 83 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked.
[2025-05-07 17:30:23,583 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:23,583 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622184279]
[2025-05-07 17:30:23,583 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622184279] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:30:23,583 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:30:23,583 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-05-07 17:30:23,583 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34973290]
[2025-05-07 17:30:23,583 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:30:23,583 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-05-07 17:30:23,583 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:23,584 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-05-07 17:30:23,584 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:30:23,584 INFO  L87              Difference]: Start difference. First operand 191 states and 328 transitions. Second operand  has 10 states, 8 states have (on average 4.625) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (25), 1 states have call predecessors, (25), 8 states have return successors, (28), 9 states have call predecessors, (28), 5 states have call successors, (28)
[2025-05-07 17:30:23,665 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:23,665 INFO  L93              Difference]: Finished difference Result 223 states and 403 transitions.
[2025-05-07 17:30:23,665 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-05-07 17:30:23,665 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 4.625) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (25), 1 states have call predecessors, (25), 8 states have return successors, (28), 9 states have call predecessors, (28), 5 states have call successors, (28) Word has length 122
[2025-05-07 17:30:23,666 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:23,667 INFO  L225             Difference]: With dead ends: 223
[2025-05-07 17:30:23,667 INFO  L226             Difference]: Without dead ends: 223
[2025-05-07 17:30:23,667 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:30:23,667 INFO  L437           NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:23,667 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1019 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:30:23,668 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 223 states.
[2025-05-07 17:30:23,678 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 215.
[2025-05-07 17:30:23,678 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 215 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 93 states have internal predecessors, (94), 56 states have call successors, (57), 27 states have call predecessors, (57), 71 states have return successors, (228), 94 states have call predecessors, (228), 56 states have call successors, (228)
[2025-05-07 17:30:23,679 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 379 transitions.
[2025-05-07 17:30:23,679 INFO  L79                 Accepts]: Start accepts. Automaton has 215 states and 379 transitions. Word has length 122
[2025-05-07 17:30:23,679 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:23,679 INFO  L485      AbstractCegarLoop]: Abstraction has 215 states and 379 transitions.
[2025-05-07 17:30:23,680 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 4.625) internal successors, (37), 10 states have internal predecessors, (37), 5 states have call successors, (25), 1 states have call predecessors, (25), 8 states have return successors, (28), 9 states have call predecessors, (28), 5 states have call successors, (28)
[2025-05-07 17:30:23,680 INFO  L278                IsEmpty]: Start isEmpty. Operand 215 states and 379 transitions.
[2025-05-07 17:30:23,681 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2025-05-07 17:30:23,681 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:23,681 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:30:23,681 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-05-07 17:30:23,681 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:23,681 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:23,682 INFO  L85        PathProgramCache]: Analyzing trace with hash -732875299, now seen corresponding path program 1 times
[2025-05-07 17:30:23,682 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:23,682 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42941060]
[2025-05-07 17:30:23,682 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:23,682 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:23,717 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes.
[2025-05-07 17:30:23,725 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements.
[2025-05-07 17:30:23,725 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:23,725 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:24,344 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-05-07 17:30:24,345 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:24,345 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42941060]
[2025-05-07 17:30:24,345 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42941060] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:30:24,345 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305958448]
[2025-05-07 17:30:24,345 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:24,345 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:30:24,347 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:30:24,349 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:30:24,349 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-05-07 17:30:25,083 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes.
[2025-05-07 17:30:25,225 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements.
[2025-05-07 17:30:25,225 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:25,225 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:25,230 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1568 conjuncts, 54 conjuncts are in the unsatisfiable core
[2025-05-07 17:30:25,233 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:30:25,745 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-05-07 17:30:25,745 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:30:38,171 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked.
[2025-05-07 17:30:38,172 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [305958448] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:30:38,172 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:30:38,172 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 35] total 77
[2025-05-07 17:30:38,172 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253624143]
[2025-05-07 17:30:38,172 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:30:38,172 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 77 states
[2025-05-07 17:30:38,172 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:38,173 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants.
[2025-05-07 17:30:38,173 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=5605, Unknown=0, NotChecked=0, Total=5852
[2025-05-07 17:30:38,174 INFO  L87              Difference]: Start difference. First operand 215 states and 379 transitions. Second operand  has 77 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 56 states have internal predecessors, (79), 34 states have call successors, (52), 1 states have call predecessors, (52), 48 states have return successors, (78), 64 states have call predecessors, (78), 34 states have call successors, (78)
[2025-05-07 17:30:39,302 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:39,303 INFO  L93              Difference]: Finished difference Result 289 states and 617 transitions.
[2025-05-07 17:30:39,303 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. 
[2025-05-07 17:30:39,303 INFO  L79                 Accepts]: Start accepts. Automaton has  has 77 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 56 states have internal predecessors, (79), 34 states have call successors, (52), 1 states have call predecessors, (52), 48 states have return successors, (78), 64 states have call predecessors, (78), 34 states have call successors, (78) Word has length 119
[2025-05-07 17:30:39,303 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:39,305 INFO  L225             Difference]: With dead ends: 289
[2025-05-07 17:30:39,305 INFO  L226             Difference]: Without dead ends: 289
[2025-05-07 17:30:39,306 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 188 SyntacticMatches, 12 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1934 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=347, Invalid=7485, Unknown=0, NotChecked=0, Total=7832
[2025-05-07 17:30:39,306 INFO  L437           NwaCegarLoop]: 105 mSDtfsCounter, 25 mSDsluCounter, 5009 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 5114 SdHoareTripleChecker+Invalid, 2636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:39,307 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 5114 Invalid, 2636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-05-07 17:30:39,307 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 289 states.
[2025-05-07 17:30:39,322 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 209.
[2025-05-07 17:30:39,323 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 209 states, 86 states have (on average 1.058139534883721) internal successors, (91), 90 states have internal predecessors, (91), 56 states have call successors, (57), 27 states have call predecessors, (57), 68 states have return successors, (212), 91 states have call predecessors, (212), 56 states have call successors, (212)
[2025-05-07 17:30:39,324 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 360 transitions.
[2025-05-07 17:30:39,324 INFO  L79                 Accepts]: Start accepts. Automaton has 209 states and 360 transitions. Word has length 119
[2025-05-07 17:30:39,324 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:39,324 INFO  L485      AbstractCegarLoop]: Abstraction has 209 states and 360 transitions.
[2025-05-07 17:30:39,324 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 77 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 56 states have internal predecessors, (79), 34 states have call successors, (52), 1 states have call predecessors, (52), 48 states have return successors, (78), 64 states have call predecessors, (78), 34 states have call successors, (78)
[2025-05-07 17:30:39,324 INFO  L278                IsEmpty]: Start isEmpty. Operand 209 states and 360 transitions.
[2025-05-07 17:30:39,326 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2025-05-07 17:30:39,326 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:39,326 INFO  L218           NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:30:39,335 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-05-07 17:30:39,527 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2025-05-07 17:30:39,527 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:39,527 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:39,527 INFO  L85        PathProgramCache]: Analyzing trace with hash 876198451, now seen corresponding path program 1 times
[2025-05-07 17:30:39,527 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:39,527 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191791617]
[2025-05-07 17:30:39,527 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:39,527 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:39,565 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-05-07 17:30:39,572 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-05-07 17:30:39,572 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:39,572 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:39,649 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked.
[2025-05-07 17:30:39,649 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:39,649 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191791617]
[2025-05-07 17:30:39,649 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191791617] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:30:39,649 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:30:39,649 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:30:39,649 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974836773]
[2025-05-07 17:30:39,649 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:30:39,650 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:30:39,650 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:39,650 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:30:39,650 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:30:39,650 INFO  L87              Difference]: Start difference. First operand 209 states and 360 transitions. Second operand  has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 4 states have call successors, (27), 1 states have call predecessors, (27), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28)
[2025-05-07 17:30:39,677 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:39,677 INFO  L93              Difference]: Finished difference Result 217 states and 380 transitions.
[2025-05-07 17:30:39,677 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:30:39,677 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 4 states have call successors, (27), 1 states have call predecessors, (27), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 137
[2025-05-07 17:30:39,677 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:39,678 INFO  L225             Difference]: With dead ends: 217
[2025-05-07 17:30:39,678 INFO  L226             Difference]: Without dead ends: 217
[2025-05-07 17:30:39,679 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:30:39,679 INFO  L437           NwaCegarLoop]: 115 mSDtfsCounter, 1 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:39,679 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 441 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:30:39,679 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 217 states.
[2025-05-07 17:30:39,687 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 209.
[2025-05-07 17:30:39,687 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 209 states, 86 states have (on average 1.058139534883721) internal successors, (91), 90 states have internal predecessors, (91), 56 states have call successors, (57), 27 states have call predecessors, (57), 68 states have return successors, (210), 91 states have call predecessors, (210), 56 states have call successors, (210)
[2025-05-07 17:30:39,688 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 358 transitions.
[2025-05-07 17:30:39,689 INFO  L79                 Accepts]: Start accepts. Automaton has 209 states and 358 transitions. Word has length 137
[2025-05-07 17:30:39,689 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:39,689 INFO  L485      AbstractCegarLoop]: Abstraction has 209 states and 358 transitions.
[2025-05-07 17:30:39,689 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 10.25) internal successors, (41), 5 states have internal predecessors, (41), 4 states have call successors, (27), 1 states have call predecessors, (27), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28)
[2025-05-07 17:30:39,689 INFO  L278                IsEmpty]: Start isEmpty. Operand 209 states and 358 transitions.
[2025-05-07 17:30:39,691 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2025-05-07 17:30:39,691 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:39,691 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:30:39,691 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-05-07 17:30:39,691 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:39,692 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:39,692 INFO  L85        PathProgramCache]: Analyzing trace with hash 938990269, now seen corresponding path program 1 times
[2025-05-07 17:30:39,692 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:39,692 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493165265]
[2025-05-07 17:30:39,692 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:39,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:39,725 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-05-07 17:30:39,734 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-05-07 17:30:39,734 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:39,734 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:40,456 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-05-07 17:30:40,456 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:40,457 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493165265]
[2025-05-07 17:30:40,457 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493165265] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:30:40,457 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083673703]
[2025-05-07 17:30:40,457 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:40,457 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:30:40,459 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:30:40,460 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:30:40,461 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-05-07 17:30:41,201 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-05-07 17:30:41,316 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-05-07 17:30:41,317 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:41,317 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:41,322 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1574 conjuncts, 57 conjuncts are in the unsatisfiable core
[2025-05-07 17:30:41,325 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:30:42,015 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-05-07 17:30:42,015 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:30:53,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-05-07 17:30:53,471 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083673703] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:30:53,471 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:30:53,471 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 36] total 84
[2025-05-07 17:30:53,471 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158264412]
[2025-05-07 17:30:53,471 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:30:53,472 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 84 states
[2025-05-07 17:30:53,472 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:53,472 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants.
[2025-05-07 17:30:53,474 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=6700, Unknown=0, NotChecked=0, Total=6972
[2025-05-07 17:30:53,474 INFO  L87              Difference]: Start difference. First operand 209 states and 358 transitions. Second operand  has 84 states, 55 states have (on average 1.6545454545454545) internal successors, (91), 66 states have internal predecessors, (91), 38 states have call successors, (55), 1 states have call predecessors, (55), 55 states have return successors, (82), 68 states have call predecessors, (82), 38 states have call successors, (82)
[2025-05-07 17:30:54,669 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:54,669 INFO  L93              Difference]: Finished difference Result 250 states and 462 transitions.
[2025-05-07 17:30:54,670 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2025-05-07 17:30:54,670 INFO  L79                 Accepts]: Start accepts. Automaton has  has 84 states, 55 states have (on average 1.6545454545454545) internal successors, (91), 66 states have internal predecessors, (91), 38 states have call successors, (55), 1 states have call predecessors, (55), 55 states have return successors, (82), 68 states have call predecessors, (82), 38 states have call successors, (82) Word has length 115
[2025-05-07 17:30:54,670 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:54,672 INFO  L225             Difference]: With dead ends: 250
[2025-05-07 17:30:54,672 INFO  L226             Difference]: Without dead ends: 250
[2025-05-07 17:30:54,674 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 171 SyntacticMatches, 13 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2551 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=365, Invalid=8755, Unknown=0, NotChecked=0, Total=9120
[2025-05-07 17:30:54,674 INFO  L437           NwaCegarLoop]: 91 mSDtfsCounter, 27 mSDsluCounter, 4240 mSDsCounter, 0 mSdLazyCounter, 2114 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4331 SdHoareTripleChecker+Invalid, 2135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:54,674 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4331 Invalid, 2135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2114 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-05-07 17:30:54,675 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 250 states.
[2025-05-07 17:30:54,691 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 206.
[2025-05-07 17:30:54,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 206 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 89 states have internal predecessors, (90), 55 states have call successors, (56), 27 states have call predecessors, (56), 67 states have return successors, (202), 90 states have call predecessors, (202), 55 states have call successors, (202)
[2025-05-07 17:30:54,693 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 348 transitions.
[2025-05-07 17:30:54,693 INFO  L79                 Accepts]: Start accepts. Automaton has 206 states and 348 transitions. Word has length 115
[2025-05-07 17:30:54,693 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:54,693 INFO  L485      AbstractCegarLoop]: Abstraction has 206 states and 348 transitions.
[2025-05-07 17:30:54,693 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 84 states, 55 states have (on average 1.6545454545454545) internal successors, (91), 66 states have internal predecessors, (91), 38 states have call successors, (55), 1 states have call predecessors, (55), 55 states have return successors, (82), 68 states have call predecessors, (82), 38 states have call successors, (82)
[2025-05-07 17:30:54,693 INFO  L278                IsEmpty]: Start isEmpty. Operand 206 states and 348 transitions.
[2025-05-07 17:30:54,694 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2025-05-07 17:30:54,695 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:54,695 INFO  L218           NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:30:54,705 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2025-05-07 17:30:54,895 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2025-05-07 17:30:54,896 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:54,896 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:54,897 INFO  L85        PathProgramCache]: Analyzing trace with hash -1399020862, now seen corresponding path program 1 times
[2025-05-07 17:30:54,897 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:54,897 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131544309]
[2025-05-07 17:30:54,897 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:54,897 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:54,973 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes.
[2025-05-07 17:30:54,982 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements.
[2025-05-07 17:30:54,982 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:54,982 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:56,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-05-07 17:30:56,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:56,079 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131544309]
[2025-05-07 17:30:56,079 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131544309] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:30:56,079 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376748837]
[2025-05-07 17:30:56,079 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:56,079 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:30:56,080 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:30:56,082 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:30:56,088 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-05-07 17:30:56,875 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes.
[2025-05-07 17:30:56,992 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements.
[2025-05-07 17:30:56,992 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:56,992 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:56,998 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1957 conjuncts, 68 conjuncts are in the unsatisfiable core
[2025-05-07 17:30:57,002 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:30:57,764 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked.
[2025-05-07 17:30:57,764 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:31:16,484 INFO  L134       CoverageAnalysis]: Checked inductivity of 90 backedges. 8 proven. 42 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2025-05-07 17:31:16,485 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [376748837] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:31:16,485 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:31:16,485 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 44] total 92
[2025-05-07 17:31:16,485 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793361881]
[2025-05-07 17:31:16,485 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:31:16,485 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 92 states
[2025-05-07 17:31:16,485 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:31:16,486 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants.
[2025-05-07 17:31:16,486 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=8052, Unknown=0, NotChecked=0, Total=8372
[2025-05-07 17:31:16,487 INFO  L87              Difference]: Start difference. First operand 206 states and 348 transitions. Second operand  has 92 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 72 states have internal predecessors, (100), 42 states have call successors, (64), 1 states have call predecessors, (64), 60 states have return successors, (95), 75 states have call predecessors, (95), 42 states have call successors, (95)
[2025-05-07 17:31:18,005 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:31:18,005 INFO  L93              Difference]: Finished difference Result 337 states and 718 transitions.
[2025-05-07 17:31:18,005 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. 
[2025-05-07 17:31:18,006 INFO  L79                 Accepts]: Start accepts. Automaton has  has 92 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 72 states have internal predecessors, (100), 42 states have call successors, (64), 1 states have call predecessors, (64), 60 states have return successors, (95), 75 states have call predecessors, (95), 42 states have call successors, (95) Word has length 144
[2025-05-07 17:31:18,006 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:31:18,008 INFO  L225             Difference]: With dead ends: 337
[2025-05-07 17:31:18,008 INFO  L226             Difference]: Without dead ends: 337
[2025-05-07 17:31:18,009 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 230 SyntacticMatches, 13 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3319 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=439, Invalid=10903, Unknown=0, NotChecked=0, Total=11342
[2025-05-07 17:31:18,009 INFO  L437           NwaCegarLoop]: 95 mSDtfsCounter, 25 mSDsluCounter, 5094 mSDsCounter, 0 mSdLazyCounter, 3123 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 5189 SdHoareTripleChecker+Invalid, 3151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 3123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:31:18,009 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 5189 Invalid, 3151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 3123 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-05-07 17:31:18,009 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 337 states.
[2025-05-07 17:31:18,024 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 263.
[2025-05-07 17:31:18,025 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 263 states, 108 states have (on average 1.0462962962962963) internal successors, (113), 112 states have internal predecessors, (113), 66 states have call successors, (67), 27 states have call predecessors, (67), 90 states have return successors, (336), 123 states have call predecessors, (336), 66 states have call successors, (336)
[2025-05-07 17:31:18,026 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 516 transitions.
[2025-05-07 17:31:18,026 INFO  L79                 Accepts]: Start accepts. Automaton has 263 states and 516 transitions. Word has length 144
[2025-05-07 17:31:18,026 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:31:18,026 INFO  L485      AbstractCegarLoop]: Abstraction has 263 states and 516 transitions.
[2025-05-07 17:31:18,026 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 92 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 72 states have internal predecessors, (100), 42 states have call successors, (64), 1 states have call predecessors, (64), 60 states have return successors, (95), 75 states have call predecessors, (95), 42 states have call successors, (95)
[2025-05-07 17:31:18,026 INFO  L278                IsEmpty]: Start isEmpty. Operand 263 states and 516 transitions.
[2025-05-07 17:31:18,028 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2025-05-07 17:31:18,028 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:31:18,028 INFO  L218           NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:31:18,036 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2025-05-07 17:31:18,229 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2025-05-07 17:31:18,229 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:31:18,230 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:31:18,230 INFO  L85        PathProgramCache]: Analyzing trace with hash 1730099682, now seen corresponding path program 2 times
[2025-05-07 17:31:18,230 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:31:18,230 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023456567]
[2025-05-07 17:31:18,230 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:31:18,230 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:31:18,333 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 140 statements into 2 equivalence classes.
[2025-05-07 17:31:18,353 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 140 of 140 statements.
[2025-05-07 17:31:18,353 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:31:18,353 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:31:19,564 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2025-05-07 17:31:19,564 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:31:19,564 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023456567]
[2025-05-07 17:31:19,564 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023456567] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:31:19,564 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936337357]
[2025-05-07 17:31:19,565 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:31:19,565 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:31:19,566 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:31:19,567 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:31:19,568 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-05-07 17:31:20,524 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 140 statements into 2 equivalence classes.
[2025-05-07 17:31:20,651 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 140 of 140 statements.
[2025-05-07 17:31:20,651 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:31:20,651 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:31:20,658 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1963 conjuncts, 71 conjuncts are in the unsatisfiable core
[2025-05-07 17:31:20,661 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:31:21,085 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2025-05-07 17:31:21,085 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:31:39,903 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-05-07 17:31:39,903 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936337357] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:31:39,903 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:31:39,903 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 33, 44] total 87
[2025-05-07 17:31:39,903 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341479479]
[2025-05-07 17:31:39,903 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:31:39,904 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 87 states
[2025-05-07 17:31:39,904 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:31:39,905 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants.
[2025-05-07 17:31:39,906 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=7179, Unknown=0, NotChecked=0, Total=7482
[2025-05-07 17:31:39,906 INFO  L87              Difference]: Start difference. First operand 263 states and 516 transitions. Second operand  has 87 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 69 states have internal predecessors, (95), 42 states have call successors, (59), 1 states have call predecessors, (59), 56 states have return successors, (87), 69 states have call predecessors, (87), 42 states have call successors, (87)
[2025-05-07 17:31:41,149 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:31:41,149 INFO  L93              Difference]: Finished difference Result 368 states and 811 transitions.
[2025-05-07 17:31:41,149 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. 
[2025-05-07 17:31:41,149 INFO  L79                 Accepts]: Start accepts. Automaton has  has 87 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 69 states have internal predecessors, (95), 42 states have call successors, (59), 1 states have call predecessors, (59), 56 states have return successors, (87), 69 states have call predecessors, (87), 42 states have call successors, (87) Word has length 140
[2025-05-07 17:31:41,150 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:31:41,152 INFO  L225             Difference]: With dead ends: 368
[2025-05-07 17:31:41,152 INFO  L226             Difference]: Without dead ends: 368
[2025-05-07 17:31:41,153 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 225 SyntacticMatches, 14 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3014 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=401, Invalid=9301, Unknown=0, NotChecked=0, Total=9702
[2025-05-07 17:31:41,153 INFO  L437           NwaCegarLoop]: 88 mSDtfsCounter, 20 mSDsluCounter, 4883 mSDsCounter, 0 mSdLazyCounter, 2585 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4971 SdHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:31:41,153 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4971 Invalid, 2596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2585 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-05-07 17:31:41,154 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 368 states.
[2025-05-07 17:31:41,170 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 309.
[2025-05-07 17:31:41,170 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 309 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 133 states have internal predecessors, (134), 70 states have call successors, (71), 27 states have call predecessors, (71), 111 states have return successors, (442), 148 states have call predecessors, (442), 70 states have call successors, (442)
[2025-05-07 17:31:41,172 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 647 transitions.
[2025-05-07 17:31:41,172 INFO  L79                 Accepts]: Start accepts. Automaton has 309 states and 647 transitions. Word has length 140
[2025-05-07 17:31:41,172 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:31:41,172 INFO  L485      AbstractCegarLoop]: Abstraction has 309 states and 647 transitions.
[2025-05-07 17:31:41,173 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 87 states, 56 states have (on average 1.6964285714285714) internal successors, (95), 69 states have internal predecessors, (95), 42 states have call successors, (59), 1 states have call predecessors, (59), 56 states have return successors, (87), 69 states have call predecessors, (87), 42 states have call successors, (87)
[2025-05-07 17:31:41,173 INFO  L278                IsEmpty]: Start isEmpty. Operand 309 states and 647 transitions.
[2025-05-07 17:31:41,174 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2025-05-07 17:31:41,174 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:31:41,174 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:31:41,183 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2025-05-07 17:31:41,375 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:31:41,376 INFO  L403      AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:31:41,377 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:31:41,377 INFO  L85        PathProgramCache]: Analyzing trace with hash 1714107768, now seen corresponding path program 1 times
[2025-05-07 17:31:41,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:31:41,377 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738204620]
[2025-05-07 17:31:41,377 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:31:41,377 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:31:41,443 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes.
[2025-05-07 17:31:41,462 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements.
[2025-05-07 17:31:41,462 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:31:41,462 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:31:41,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:31:41,528 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:31:41,528 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738204620]
[2025-05-07 17:31:41,528 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738204620] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:31:41,528 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:31:41,528 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-05-07 17:31:41,528 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825863934]
[2025-05-07 17:31:41,528 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:31:41,528 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-05-07 17:31:41,528 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:31:41,528 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-05-07 17:31:41,529 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-05-07 17:31:41,529 INFO  L87              Difference]: Start difference. First operand 309 states and 647 transitions. Second operand  has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 5 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (22), 8 states have call predecessors, (22), 5 states have call successors, (22)
[2025-05-07 17:31:41,603 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:31:41,603 INFO  L93              Difference]: Finished difference Result 312 states and 610 transitions.
[2025-05-07 17:31:41,603 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-05-07 17:31:41,603 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 5 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (22), 8 states have call predecessors, (22), 5 states have call successors, (22) Word has length 80
[2025-05-07 17:31:41,603 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:31:41,605 INFO  L225             Difference]: With dead ends: 312
[2025-05-07 17:31:41,605 INFO  L226             Difference]: Without dead ends: 291
[2025-05-07 17:31:41,605 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-05-07 17:31:41,605 INFO  L437           NwaCegarLoop]: 101 mSDtfsCounter, 1 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:31:41,605 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 785 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:31:41,606 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 291 states.
[2025-05-07 17:31:41,617 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 273.
[2025-05-07 17:31:41,617 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 273 states, 115 states have (on average 1.0347826086956522) internal successors, (119), 118 states have internal predecessors, (119), 62 states have call successors, (63), 27 states have call predecessors, (63), 97 states have return successors, (354), 127 states have call predecessors, (354), 62 states have call successors, (354)
[2025-05-07 17:31:41,618 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 536 transitions.
[2025-05-07 17:31:41,619 INFO  L79                 Accepts]: Start accepts. Automaton has 273 states and 536 transitions. Word has length 80
[2025-05-07 17:31:41,619 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:31:41,619 INFO  L485      AbstractCegarLoop]: Abstraction has 273 states and 536 transitions.
[2025-05-07 17:31:41,619 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 5 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (22), 8 states have call predecessors, (22), 5 states have call successors, (22)
[2025-05-07 17:31:41,619 INFO  L278                IsEmpty]: Start isEmpty. Operand 273 states and 536 transitions.
[2025-05-07 17:31:41,620 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2025-05-07 17:31:41,620 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:31:41,620 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:31:41,621 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-05-07 17:31:41,621 INFO  L403      AbstractCegarLoop]: === Iteration 20 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:31:41,621 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:31:41,621 INFO  L85        PathProgramCache]: Analyzing trace with hash 681823798, now seen corresponding path program 2 times
[2025-05-07 17:31:41,621 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:31:41,621 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476310513]
[2025-05-07 17:31:41,621 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:31:41,621 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:31:41,669 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 140 statements into 2 equivalence classes.
[2025-05-07 17:31:41,682 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 140 of 140 statements.
[2025-05-07 17:31:41,682 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:31:41,682 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:31:42,988 INFO  L134       CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2025-05-07 17:31:42,988 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:31:42,988 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476310513]
[2025-05-07 17:31:42,988 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476310513] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:31:42,988 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247352921]
[2025-05-07 17:31:42,988 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:31:42,988 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:31:42,991 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:31:42,992 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:31:42,993 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-05-07 17:31:44,248 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 140 statements into 2 equivalence classes.
[2025-05-07 17:31:44,383 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 140 of 140 statements.
[2025-05-07 17:31:44,383 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:31:44,383 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:31:44,389 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1956 conjuncts, 70 conjuncts are in the unsatisfiable core
[2025-05-07 17:31:44,393 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:31:44,726 INFO  L134       CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked.
[2025-05-07 17:31:44,726 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:32:01,952 INFO  L134       CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2025-05-07 17:32:01,952 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [247352921] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:32:01,952 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:32:01,953 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 33, 41] total 79
[2025-05-07 17:32:01,953 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753351321]
[2025-05-07 17:32:01,953 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:32:01,953 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 79 states
[2025-05-07 17:32:01,953 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:32:01,954 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants.
[2025-05-07 17:32:01,955 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=5904, Unknown=0, NotChecked=0, Total=6162
[2025-05-07 17:32:01,956 INFO  L87              Difference]: Start difference. First operand 273 states and 536 transitions. Second operand  has 79 states, 48 states have (on average 1.7708333333333333) internal successors, (85), 61 states have internal predecessors, (85), 42 states have call successors, (59), 1 states have call predecessors, (59), 48 states have return successors, (85), 63 states have call predecessors, (85), 42 states have call successors, (85)
[2025-05-07 17:32:03,186 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:32:03,186 INFO  L93              Difference]: Finished difference Result 311 states and 661 transitions.
[2025-05-07 17:32:03,186 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2025-05-07 17:32:03,187 INFO  L79                 Accepts]: Start accepts. Automaton has  has 79 states, 48 states have (on average 1.7708333333333333) internal successors, (85), 61 states have internal predecessors, (85), 42 states have call successors, (59), 1 states have call predecessors, (59), 48 states have return successors, (85), 63 states have call predecessors, (85), 42 states have call successors, (85) Word has length 140
[2025-05-07 17:32:03,187 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:32:03,188 INFO  L225             Difference]: With dead ends: 311
[2025-05-07 17:32:03,188 INFO  L226             Difference]: Without dead ends: 311
[2025-05-07 17:32:03,189 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 230 SyntacticMatches, 18 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=341, Invalid=7669, Unknown=0, NotChecked=0, Total=8010
[2025-05-07 17:32:03,189 INFO  L437           NwaCegarLoop]: 91 mSDtfsCounter, 26 mSDsluCounter, 4220 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 4311 SdHoareTripleChecker+Invalid, 2262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:32:03,189 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 4311 Invalid, 2262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2235 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-05-07 17:32:03,190 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 311 states.
[2025-05-07 17:32:03,202 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 285.
[2025-05-07 17:32:03,202 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 285 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 123 states have internal predecessors, (124), 64 states have call successors, (65), 27 states have call predecessors, (65), 102 states have return successors, (391), 134 states have call predecessors, (391), 64 states have call successors, (391)
[2025-05-07 17:32:03,203 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 580 transitions.
[2025-05-07 17:32:03,204 INFO  L79                 Accepts]: Start accepts. Automaton has 285 states and 580 transitions. Word has length 140
[2025-05-07 17:32:03,204 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:32:03,204 INFO  L485      AbstractCegarLoop]: Abstraction has 285 states and 580 transitions.
[2025-05-07 17:32:03,204 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 79 states, 48 states have (on average 1.7708333333333333) internal successors, (85), 61 states have internal predecessors, (85), 42 states have call successors, (59), 1 states have call predecessors, (59), 48 states have return successors, (85), 63 states have call predecessors, (85), 42 states have call successors, (85)
[2025-05-07 17:32:03,204 INFO  L278                IsEmpty]: Start isEmpty. Operand 285 states and 580 transitions.
[2025-05-07 17:32:03,205 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 145
[2025-05-07 17:32:03,206 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:32:03,206 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:03,217 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2025-05-07 17:32:03,406 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:32:03,406 INFO  L403      AbstractCegarLoop]: === Iteration 21 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:32:03,407 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:32:03,407 INFO  L85        PathProgramCache]: Analyzing trace with hash 1300001100, now seen corresponding path program 1 times
[2025-05-07 17:32:03,407 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:32:03,407 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719579897]
[2025-05-07 17:32:03,407 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:32:03,407 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:32:03,487 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes.
[2025-05-07 17:32:03,497 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements.
[2025-05-07 17:32:03,497 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:32:03,497 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:32:04,444 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked.
[2025-05-07 17:32:04,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:32:04,444 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719579897]
[2025-05-07 17:32:04,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719579897] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:32:04,444 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941662045]
[2025-05-07 17:32:04,444 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:32:04,444 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:32:04,446 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:32:04,447 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:32:04,448 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2025-05-07 17:32:05,721 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes.
[2025-05-07 17:32:05,883 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements.
[2025-05-07 17:32:05,884 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:32:05,884 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:32:05,891 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1950 conjuncts, 67 conjuncts are in the unsatisfiable core
[2025-05-07 17:32:05,894 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:32:06,516 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked.
[2025-05-07 17:32:06,516 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:32:20,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2025-05-07 17:32:20,803 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [941662045] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:32:20,803 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:32:20,803 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 43] total 89
[2025-05-07 17:32:20,803 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446140467]
[2025-05-07 17:32:20,803 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:32:20,804 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 89 states
[2025-05-07 17:32:20,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:32:20,805 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants.
[2025-05-07 17:32:20,805 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=7533, Unknown=0, NotChecked=0, Total=7832
[2025-05-07 17:32:20,806 INFO  L87              Difference]: Start difference. First operand 285 states and 580 transitions. Second operand  has 89 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 67 states have internal predecessors, (95), 44 states have call successors, (64), 1 states have call predecessors, (64), 55 states have return successors, (93), 72 states have call predecessors, (93), 44 states have call successors, (93)
[2025-05-07 17:32:22,392 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:32:22,392 INFO  L93              Difference]: Finished difference Result 314 states and 697 transitions.
[2025-05-07 17:32:22,392 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. 
[2025-05-07 17:32:22,393 INFO  L79                 Accepts]: Start accepts. Automaton has  has 89 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 67 states have internal predecessors, (95), 44 states have call successors, (64), 1 states have call predecessors, (64), 55 states have return successors, (93), 72 states have call predecessors, (93), 44 states have call successors, (93) Word has length 144
[2025-05-07 17:32:22,393 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:32:22,394 INFO  L225             Difference]: With dead ends: 314
[2025-05-07 17:32:22,394 INFO  L226             Difference]: Without dead ends: 314
[2025-05-07 17:32:22,395 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 232 SyntacticMatches, 14 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2565 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=411, Invalid=10095, Unknown=0, NotChecked=0, Total=10506
[2025-05-07 17:32:22,395 INFO  L437           NwaCegarLoop]: 98 mSDtfsCounter, 25 mSDsluCounter, 5348 mSDsCounter, 0 mSdLazyCounter, 3297 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5446 SdHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:32:22,395 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5446 Invalid, 3324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3297 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-05-07 17:32:22,396 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 314 states.
[2025-05-07 17:32:22,408 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 286.
[2025-05-07 17:32:22,409 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 286 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 123 states have internal predecessors, (124), 65 states have call successors, (66), 27 states have call predecessors, (66), 102 states have return successors, (397), 135 states have call predecessors, (397), 65 states have call successors, (397)
[2025-05-07 17:32:22,410 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 587 transitions.
[2025-05-07 17:32:22,410 INFO  L79                 Accepts]: Start accepts. Automaton has 286 states and 587 transitions. Word has length 144
[2025-05-07 17:32:22,410 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:32:22,410 INFO  L485      AbstractCegarLoop]: Abstraction has 286 states and 587 transitions.
[2025-05-07 17:32:22,410 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 89 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 67 states have internal predecessors, (95), 44 states have call successors, (64), 1 states have call predecessors, (64), 55 states have return successors, (93), 72 states have call predecessors, (93), 44 states have call successors, (93)
[2025-05-07 17:32:22,411 INFO  L278                IsEmpty]: Start isEmpty. Operand 286 states and 587 transitions.
[2025-05-07 17:32:22,412 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2025-05-07 17:32:22,412 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:32:22,412 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:32:22,429 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2025-05-07 17:32:22,613 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:32:22,613 INFO  L403      AbstractCegarLoop]: === Iteration 22 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:32:22,615 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:32:22,615 INFO  L85        PathProgramCache]: Analyzing trace with hash 134154348, now seen corresponding path program 1 times
[2025-05-07 17:32:22,615 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:32:22,615 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304030297]
[2025-05-07 17:32:22,615 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:32:22,615 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:32:22,668 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes.
[2025-05-07 17:32:22,677 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements.
[2025-05-07 17:32:22,677 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:32:22,677 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:32:23,811 INFO  L134       CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked.
[2025-05-07 17:32:23,811 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:32:23,811 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304030297]
[2025-05-07 17:32:23,811 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304030297] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:32:23,812 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140437134]
[2025-05-07 17:32:23,812 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:32:23,812 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:32:23,813 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:32:23,814 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:32:23,815 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2025-05-07 17:32:25,478 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes.
[2025-05-07 17:32:25,612 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements.
[2025-05-07 17:32:25,612 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:32:25,612 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:32:25,619 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1956 conjuncts, 70 conjuncts are in the unsatisfiable core
[2025-05-07 17:32:25,622 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:32:26,225 INFO  L134       CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked.
[2025-05-07 17:32:26,226 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:32:41,284 INFO  L134       CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-05-07 17:32:41,284 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [140437134] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:32:41,284 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:32:41,284 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 35, 43] total 88
[2025-05-07 17:32:41,285 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403776635]
[2025-05-07 17:32:41,285 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:32:41,285 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 88 states
[2025-05-07 17:32:41,285 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:32:41,285 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants.
[2025-05-07 17:32:41,286 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=7354, Unknown=0, NotChecked=0, Total=7656
[2025-05-07 17:32:41,286 INFO  L87              Difference]: Start difference. First operand 286 states and 587 transitions. Second operand  has 88 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 68 states have internal predecessors, (95), 44 states have call successors, (62), 1 states have call predecessors, (62), 55 states have return successors, (91), 70 states have call predecessors, (91), 44 states have call successors, (91)
[2025-05-07 17:32:42,704 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:32:42,704 INFO  L93              Difference]: Finished difference Result 304 states and 655 transitions.
[2025-05-07 17:32:42,704 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. 
[2025-05-07 17:32:42,705 INFO  L79                 Accepts]: Start accepts. Automaton has  has 88 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 68 states have internal predecessors, (95), 44 states have call successors, (62), 1 states have call predecessors, (62), 55 states have return successors, (91), 70 states have call predecessors, (91), 44 states have call successors, (91) Word has length 140
[2025-05-07 17:32:42,705 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:32:42,706 INFO  L225             Difference]: With dead ends: 304
[2025-05-07 17:32:42,706 INFO  L226             Difference]: Without dead ends: 304
[2025-05-07 17:32:42,707 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 223 SyntacticMatches, 15 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2930 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=405, Invalid=9495, Unknown=0, NotChecked=0, Total=9900
[2025-05-07 17:32:42,708 INFO  L437           NwaCegarLoop]: 93 mSDtfsCounter, 32 mSDsluCounter, 4283 mSDsCounter, 0 mSdLazyCounter, 2701 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 4376 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:32:42,708 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 4376 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2701 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-05-07 17:32:42,709 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 304 states.
[2025-05-07 17:32:42,720 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 285.
[2025-05-07 17:32:42,720 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 285 states, 120 states have (on average 1.0333333333333334) internal successors, (124), 123 states have internal predecessors, (124), 64 states have call successors, (65), 27 states have call predecessors, (65), 102 states have return successors, (390), 134 states have call predecessors, (390), 64 states have call successors, (390)
[2025-05-07 17:32:42,722 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 579 transitions.
[2025-05-07 17:32:42,722 INFO  L79                 Accepts]: Start accepts. Automaton has 285 states and 579 transitions. Word has length 140
[2025-05-07 17:32:42,722 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:32:42,722 INFO  L485      AbstractCegarLoop]: Abstraction has 285 states and 579 transitions.
[2025-05-07 17:32:42,722 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 88 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 68 states have internal predecessors, (95), 44 states have call successors, (62), 1 states have call predecessors, (62), 55 states have return successors, (91), 70 states have call predecessors, (91), 44 states have call successors, (91)
[2025-05-07 17:32:42,722 INFO  L278                IsEmpty]: Start isEmpty. Operand 285 states and 579 transitions.
[2025-05-07 17:32:42,723 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2025-05-07 17:32:42,724 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:32:42,724 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:32:42,736 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2025-05-07 17:32:42,924 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2025-05-07 17:32:42,924 INFO  L403      AbstractCegarLoop]: === Iteration 23 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:32:42,925 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:32:42,925 INFO  L85        PathProgramCache]: Analyzing trace with hash 96764695, now seen corresponding path program 2 times
[2025-05-07 17:32:42,925 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:32:42,925 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367751691]
[2025-05-07 17:32:42,925 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:32:42,925 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:32:42,996 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 165 statements into 2 equivalence classes.
[2025-05-07 17:32:43,009 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 165 of 165 statements.
[2025-05-07 17:32:43,009 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:32:43,009 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:32:44,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 108 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked.
[2025-05-07 17:32:44,397 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:32:44,397 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367751691]
[2025-05-07 17:32:44,397 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367751691] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:32:44,397 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058739625]
[2025-05-07 17:32:44,397 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:32:44,397 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:32:44,398 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:32:44,400 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:32:44,400 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2025-05-07 17:32:46,736 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 165 statements into 2 equivalence classes.
[2025-05-07 17:32:46,885 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 165 of 165 statements.
[2025-05-07 17:32:46,885 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:32:46,885 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:32:46,894 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2345 conjuncts, 84 conjuncts are in the unsatisfiable core
[2025-05-07 17:32:46,897 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:32:47,377 INFO  L134       CoverageAnalysis]: Checked inductivity of 108 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2025-05-07 17:32:47,377 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:33:09,547 INFO  L134       CoverageAnalysis]: Checked inductivity of 108 backedges. 5 proven. 52 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked.
[2025-05-07 17:33:09,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058739625] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:33:09,548 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:33:09,548 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 34, 51] total 89
[2025-05-07 17:33:09,548 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718721662]
[2025-05-07 17:33:09,548 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:33:09,548 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 89 states
[2025-05-07 17:33:09,548 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:33:09,549 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants.
[2025-05-07 17:33:09,550 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=7517, Unknown=0, NotChecked=0, Total=7832
[2025-05-07 17:33:09,550 INFO  L87              Difference]: Start difference. First operand 285 states and 579 transitions. Second operand  has 89 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 70 states have internal predecessors, (97), 46 states have call successors, (65), 1 states have call predecessors, (65), 55 states have return successors, (92), 69 states have call predecessors, (92), 46 states have call successors, (92)
[2025-05-07 17:33:10,812 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:33:10,812 INFO  L93              Difference]: Finished difference Result 311 states and 672 transitions.
[2025-05-07 17:33:10,812 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. 
[2025-05-07 17:33:10,812 INFO  L79                 Accepts]: Start accepts. Automaton has  has 89 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 70 states have internal predecessors, (97), 46 states have call successors, (65), 1 states have call predecessors, (65), 55 states have return successors, (92), 69 states have call predecessors, (92), 46 states have call successors, (92) Word has length 165
[2025-05-07 17:33:10,813 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:33:10,814 INFO  L225             Difference]: With dead ends: 311
[2025-05-07 17:33:10,814 INFO  L226             Difference]: Without dead ends: 311
[2025-05-07 17:33:10,815 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 279 SyntacticMatches, 16 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2867 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=399, Invalid=9303, Unknown=0, NotChecked=0, Total=9702
[2025-05-07 17:33:10,815 INFO  L437           NwaCegarLoop]: 90 mSDtfsCounter, 23 mSDsluCounter, 4401 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 4491 SdHoareTripleChecker+Invalid, 2091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:33:10,815 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 4491 Invalid, 2091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-05-07 17:33:10,815 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 311 states.
[2025-05-07 17:33:10,828 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 290.
[2025-05-07 17:33:10,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 290 states, 123 states have (on average 1.032520325203252) internal successors, (127), 126 states have internal predecessors, (127), 63 states have call successors, (64), 27 states have call predecessors, (64), 105 states have return successors, (410), 136 states have call predecessors, (410), 63 states have call successors, (410)
[2025-05-07 17:33:10,829 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 601 transitions.
[2025-05-07 17:33:10,830 INFO  L79                 Accepts]: Start accepts. Automaton has 290 states and 601 transitions. Word has length 165
[2025-05-07 17:33:10,830 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:33:10,830 INFO  L485      AbstractCegarLoop]: Abstraction has 290 states and 601 transitions.
[2025-05-07 17:33:10,830 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 89 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 70 states have internal predecessors, (97), 46 states have call successors, (65), 1 states have call predecessors, (65), 55 states have return successors, (92), 69 states have call predecessors, (92), 46 states have call successors, (92)
[2025-05-07 17:33:10,830 INFO  L278                IsEmpty]: Start isEmpty. Operand 290 states and 601 transitions.
[2025-05-07 17:33:10,831 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 177
[2025-05-07 17:33:10,831 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:33:10,831 INFO  L218           NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:33:10,844 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0
[2025-05-07 17:33:11,032 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:33:11,032 INFO  L403      AbstractCegarLoop]: === Iteration 24 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:33:11,032 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:33:11,032 INFO  L85        PathProgramCache]: Analyzing trace with hash 980266266, now seen corresponding path program 2 times
[2025-05-07 17:33:11,032 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:33:11,032 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843616608]
[2025-05-07 17:33:11,032 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:33:11,032 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:33:11,110 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 176 statements into 2 equivalence classes.
[2025-05-07 17:33:11,123 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 176 of 176 statements.
[2025-05-07 17:33:11,123 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:33:11,123 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:33:12,677 INFO  L134       CoverageAnalysis]: Checked inductivity of 175 backedges. 11 proven. 44 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked.
[2025-05-07 17:33:12,677 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:33:12,678 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843616608]
[2025-05-07 17:33:12,678 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843616608] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:33:12,678 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822388723]
[2025-05-07 17:33:12,678 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:33:12,678 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:33:12,679 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:33:12,680 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:33:12,681 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2025-05-07 17:33:14,908 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 176 statements into 2 equivalence classes.
[2025-05-07 17:33:15,141 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 176 of 176 statements.
[2025-05-07 17:33:15,142 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:33:15,142 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:33:15,150 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2394 conjuncts, 84 conjuncts are in the unsatisfiable core
[2025-05-07 17:33:15,153 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:33:15,947 INFO  L134       CoverageAnalysis]: Checked inductivity of 175 backedges. 11 proven. 44 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked.
[2025-05-07 17:33:15,947 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:33:38,900 INFO  L134       CoverageAnalysis]: Checked inductivity of 175 backedges. 21 proven. 73 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked.
[2025-05-07 17:33:38,901 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822388723] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:33:38,901 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:33:38,901 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 51] total 107
[2025-05-07 17:33:38,901 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550091701]
[2025-05-07 17:33:38,901 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:33:38,901 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 107 states
[2025-05-07 17:33:38,901 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:33:38,902 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants.
[2025-05-07 17:33:38,902 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=10922, Unknown=0, NotChecked=0, Total=11342
[2025-05-07 17:33:38,902 INFO  L87              Difference]: Start difference. First operand 290 states and 601 transitions. Second operand  has 107 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 83 states have internal predecessors, (111), 47 states have call successors, (70), 1 states have call predecessors, (70), 70 states have return successors, (113), 90 states have call predecessors, (113), 47 states have call successors, (113)
[2025-05-07 17:33:40,868 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:33:40,868 INFO  L93              Difference]: Finished difference Result 358 states and 846 transitions.
[2025-05-07 17:33:40,868 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. 
[2025-05-07 17:33:40,869 INFO  L79                 Accepts]: Start accepts. Automaton has  has 107 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 83 states have internal predecessors, (111), 47 states have call successors, (70), 1 states have call predecessors, (70), 70 states have return successors, (113), 90 states have call predecessors, (113), 47 states have call successors, (113) Word has length 176
[2025-05-07 17:33:40,869 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:33:40,871 INFO  L225             Difference]: With dead ends: 358
[2025-05-07 17:33:40,871 INFO  L226             Difference]: Without dead ends: 358
[2025-05-07 17:33:40,872 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 288 SyntacticMatches, 14 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5540 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=613, Invalid=15389, Unknown=0, NotChecked=0, Total=16002
[2025-05-07 17:33:40,872 INFO  L437           NwaCegarLoop]: 96 mSDtfsCounter, 35 mSDsluCounter, 4878 mSDsCounter, 0 mSdLazyCounter, 3328 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 4974 SdHoareTripleChecker+Invalid, 3374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:33:40,873 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 4974 Invalid, 3374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3328 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-05-07 17:33:40,873 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 358 states.
[2025-05-07 17:33:40,889 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 261.
[2025-05-07 17:33:40,889 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 261 states, 111 states have (on average 1.0360360360360361) internal successors, (115), 114 states have internal predecessors, (115), 58 states have call successors, (59), 27 states have call predecessors, (59), 93 states have return successors, (336), 119 states have call predecessors, (336), 58 states have call successors, (336)
[2025-05-07 17:33:40,890 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 510 transitions.
[2025-05-07 17:33:40,890 INFO  L79                 Accepts]: Start accepts. Automaton has 261 states and 510 transitions. Word has length 176
[2025-05-07 17:33:40,890 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:33:40,890 INFO  L485      AbstractCegarLoop]: Abstraction has 261 states and 510 transitions.
[2025-05-07 17:33:40,891 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 107 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 83 states have internal predecessors, (111), 47 states have call successors, (70), 1 states have call predecessors, (70), 70 states have return successors, (113), 90 states have call predecessors, (113), 47 states have call successors, (113)
[2025-05-07 17:33:40,891 INFO  L278                IsEmpty]: Start isEmpty. Operand 261 states and 510 transitions.
[2025-05-07 17:33:40,892 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2025-05-07 17:33:40,892 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:33:40,892 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:33:40,907 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0
[2025-05-07 17:33:41,092 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24
[2025-05-07 17:33:41,093 INFO  L403      AbstractCegarLoop]: === Iteration 25 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:33:41,093 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:33:41,093 INFO  L85        PathProgramCache]: Analyzing trace with hash -1877657155, now seen corresponding path program 1 times
[2025-05-07 17:33:41,093 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:33:41,093 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243536446]
[2025-05-07 17:33:41,093 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:33:41,093 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:33:41,174 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-05-07 17:33:41,183 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-05-07 17:33:41,183 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:33:41,183 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:33:42,261 INFO  L134       CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2025-05-07 17:33:42,261 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:33:42,262 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243536446]
[2025-05-07 17:33:42,262 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243536446] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:33:42,262 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834643200]
[2025-05-07 17:33:42,262 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:33:42,262 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:33:42,264 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:33:42,265 INFO  L229       MonitoredProcess]: Starting monitored process 17 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:33:42,266 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process
[2025-05-07 17:33:44,510 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-05-07 17:33:44,662 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-05-07 17:33:44,662 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:33:44,662 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:33:44,668 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1895 conjuncts, 64 conjuncts are in the unsatisfiable core
[2025-05-07 17:33:44,672 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:33:45,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked.
[2025-05-07 17:33:45,110 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:33:58,830 INFO  L134       CoverageAnalysis]: Checked inductivity of 59 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2025-05-07 17:33:58,830 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834643200] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:33:58,830 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:33:58,830 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 32, 41] total 78
[2025-05-07 17:33:58,831 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562919749]
[2025-05-07 17:33:58,831 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:33:58,831 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 78 states
[2025-05-07 17:33:58,832 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:33:58,832 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants.
[2025-05-07 17:33:58,833 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=5749, Unknown=0, NotChecked=0, Total=6006
[2025-05-07 17:33:58,833 INFO  L87              Difference]: Start difference. First operand 261 states and 510 transitions. Second operand  has 78 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 61 states have internal predecessors, (86), 41 states have call successors, (57), 1 states have call predecessors, (57), 48 states have return successors, (82), 60 states have call predecessors, (82), 41 states have call successors, (82)
[2025-05-07 17:33:59,927 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:33:59,927 INFO  L93              Difference]: Finished difference Result 320 states and 701 transitions.
[2025-05-07 17:33:59,927 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. 
[2025-05-07 17:33:59,927 INFO  L79                 Accepts]: Start accepts. Automaton has  has 78 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 61 states have internal predecessors, (86), 41 states have call successors, (57), 1 states have call predecessors, (57), 48 states have return successors, (82), 60 states have call predecessors, (82), 41 states have call successors, (82) Word has length 137
[2025-05-07 17:33:59,928 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:33:59,929 INFO  L225             Difference]: With dead ends: 320
[2025-05-07 17:33:59,929 INFO  L226             Difference]: Without dead ends: 320
[2025-05-07 17:33:59,930 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 226 SyntacticMatches, 15 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1931 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=327, Invalid=7155, Unknown=0, NotChecked=0, Total=7482
[2025-05-07 17:33:59,930 INFO  L437           NwaCegarLoop]: 98 mSDtfsCounter, 17 mSDsluCounter, 4214 mSDsCounter, 0 mSdLazyCounter, 2146 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 4312 SdHoareTripleChecker+Invalid, 2162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:33:59,930 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 4312 Invalid, 2162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2146 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-05-07 17:33:59,930 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 320 states.
[2025-05-07 17:33:59,943 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 292.
[2025-05-07 17:33:59,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 292 states, 124 states have (on average 1.032258064516129) internal successors, (128), 127 states have internal predecessors, (128), 63 states have call successors, (64), 27 states have call predecessors, (64), 106 states have return successors, (416), 137 states have call predecessors, (416), 63 states have call successors, (416)
[2025-05-07 17:33:59,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 608 transitions.
[2025-05-07 17:33:59,945 INFO  L79                 Accepts]: Start accepts. Automaton has 292 states and 608 transitions. Word has length 137
[2025-05-07 17:33:59,945 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:33:59,945 INFO  L485      AbstractCegarLoop]: Abstraction has 292 states and 608 transitions.
[2025-05-07 17:33:59,945 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 78 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 61 states have internal predecessors, (86), 41 states have call successors, (57), 1 states have call predecessors, (57), 48 states have return successors, (82), 60 states have call predecessors, (82), 41 states have call successors, (82)
[2025-05-07 17:33:59,945 INFO  L278                IsEmpty]: Start isEmpty. Operand 292 states and 608 transitions.
[2025-05-07 17:33:59,946 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2025-05-07 17:33:59,946 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:33:59,946 INFO  L218           NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:33:59,962 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0
[2025-05-07 17:34:00,147 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2025-05-07 17:34:00,147 INFO  L403      AbstractCegarLoop]: === Iteration 26 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:34:00,147 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:34:00,147 INFO  L85        PathProgramCache]: Analyzing trace with hash -556476873, now seen corresponding path program 1 times
[2025-05-07 17:34:00,147 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:34:00,147 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124319037]
[2025-05-07 17:34:00,147 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:34:00,148 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:34:00,218 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-05-07 17:34:00,228 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-05-07 17:34:00,228 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:34:00,229 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:34:01,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2025-05-07 17:34:01,820 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:34:01,820 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124319037]
[2025-05-07 17:34:01,820 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124319037] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:34:01,820 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59547397]
[2025-05-07 17:34:01,820 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:34:01,820 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:34:01,823 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:34:01,824 INFO  L229       MonitoredProcess]: Starting monitored process 18 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:34:01,825 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process
[2025-05-07 17:34:04,532 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes.
[2025-05-07 17:34:04,731 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements.
[2025-05-07 17:34:04,731 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:34:04,731 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:34:04,740 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2339 conjuncts, 81 conjuncts are in the unsatisfiable core
[2025-05-07 17:34:04,744 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:34:05,254 INFO  L134       CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked.
[2025-05-07 17:34:05,254 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:34:29,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 116 backedges. 13 proven. 50 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked.
[2025-05-07 17:34:29,627 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [59547397] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:34:29,627 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:34:29,627 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 38, 51] total 95
[2025-05-07 17:34:29,628 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938060589]
[2025-05-07 17:34:29,628 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:34:29,628 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 95 states
[2025-05-07 17:34:29,628 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:34:29,628 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants.
[2025-05-07 17:34:29,629 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=8600, Unknown=0, NotChecked=0, Total=8930
[2025-05-07 17:34:29,629 INFO  L87              Difference]: Start difference. First operand 292 states and 608 transitions. Second operand  has 95 states, 60 states have (on average 1.7333333333333334) internal successors, (104), 74 states have internal predecessors, (104), 47 states have call successors, (71), 1 states have call predecessors, (71), 60 states have return successors, (104), 76 states have call predecessors, (104), 47 states have call successors, (104)
[2025-05-07 17:34:31,108 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:34:31,108 INFO  L93              Difference]: Finished difference Result 320 states and 700 transitions.
[2025-05-07 17:34:31,108 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2025-05-07 17:34:31,109 INFO  L79                 Accepts]: Start accepts. Automaton has  has 95 states, 60 states have (on average 1.7333333333333334) internal successors, (104), 74 states have internal predecessors, (104), 47 states have call successors, (71), 1 states have call predecessors, (71), 60 states have return successors, (104), 76 states have call predecessors, (104), 47 states have call successors, (104) Word has length 169
[2025-05-07 17:34:31,109 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:34:31,110 INFO  L225             Difference]: With dead ends: 320
[2025-05-07 17:34:31,110 INFO  L226             Difference]: Without dead ends: 320
[2025-05-07 17:34:31,111 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 283 SyntacticMatches, 15 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=427, Invalid=10915, Unknown=0, NotChecked=0, Total=11342
[2025-05-07 17:34:31,111 INFO  L437           NwaCegarLoop]: 96 mSDtfsCounter, 31 mSDsluCounter, 4708 mSDsCounter, 0 mSdLazyCounter, 2778 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4804 SdHoareTripleChecker+Invalid, 2807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:34:31,111 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4804 Invalid, 2807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2778 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-05-07 17:34:31,112 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 320 states.
[2025-05-07 17:34:31,127 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 286.
[2025-05-07 17:34:31,128 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 286 states, 121 states have (on average 1.0330578512396693) internal successors, (125), 124 states have internal predecessors, (125), 63 states have call successors, (64), 27 states have call predecessors, (64), 103 states have return successors, (401), 134 states have call predecessors, (401), 63 states have call successors, (401)
[2025-05-07 17:34:31,130 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 590 transitions.
[2025-05-07 17:34:31,130 INFO  L79                 Accepts]: Start accepts. Automaton has 286 states and 590 transitions. Word has length 169
[2025-05-07 17:34:31,130 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:34:31,130 INFO  L485      AbstractCegarLoop]: Abstraction has 286 states and 590 transitions.
[2025-05-07 17:34:31,130 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 95 states, 60 states have (on average 1.7333333333333334) internal successors, (104), 74 states have internal predecessors, (104), 47 states have call successors, (71), 1 states have call predecessors, (71), 60 states have return successors, (104), 76 states have call predecessors, (104), 47 states have call successors, (104)
[2025-05-07 17:34:31,130 INFO  L278                IsEmpty]: Start isEmpty. Operand 286 states and 590 transitions.
[2025-05-07 17:34:31,133 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 237
[2025-05-07 17:34:31,133 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:34:31,133 INFO  L218           NwaCegarLoop]: trace histogram [9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:34:31,150 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0
[2025-05-07 17:34:31,334 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2025-05-07 17:34:31,334 INFO  L403      AbstractCegarLoop]: === Iteration 27 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:34:31,335 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:34:31,335 INFO  L85        PathProgramCache]: Analyzing trace with hash -474266054, now seen corresponding path program 1 times
[2025-05-07 17:34:31,335 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:34:31,336 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012451139]
[2025-05-07 17:34:31,336 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:34:31,336 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:34:31,470 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes.
[2025-05-07 17:34:31,486 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements.
[2025-05-07 17:34:31,486 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:34:31,486 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:34:34,315 INFO  L134       CoverageAnalysis]: Checked inductivity of 363 backedges. 18 proven. 120 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked.
[2025-05-07 17:34:34,316 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:34:34,316 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012451139]
[2025-05-07 17:34:34,316 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012451139] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:34:34,316 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686538228]
[2025-05-07 17:34:34,316 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:34:34,316 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:34:34,318 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:34:34,319 INFO  L229       MonitoredProcess]: Starting monitored process 19 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:34:34,320 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process
[2025-05-07 17:34:36,927 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes.
[2025-05-07 17:34:37,287 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements.
[2025-05-07 17:34:37,287 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:34:37,287 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:34:37,300 INFO  L256         TraceCheckSpWp]: Trace formula consists of 3288 conjuncts, 121 conjuncts are in the unsatisfiable core
[2025-05-07 17:34:37,310 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:34:37,928 INFO  L134       CoverageAnalysis]: Checked inductivity of 363 backedges. 2 proven. 84 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked.
[2025-05-07 17:34:37,928 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:35:34,405 INFO  L134       CoverageAnalysis]: Checked inductivity of 363 backedges. 32 proven. 147 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked.
[2025-05-07 17:35:34,405 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [686538228] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:35:34,405 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:35:34,405 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 38, 61] total 112
[2025-05-07 17:35:34,405 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250726240]
[2025-05-07 17:35:34,405 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:35:34,406 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 112 states
[2025-05-07 17:35:34,406 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:35:34,406 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants.
[2025-05-07 17:35:34,407 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=11965, Unknown=0, NotChecked=0, Total=12432
[2025-05-07 17:35:34,407 INFO  L87              Difference]: Start difference. First operand 286 states and 590 transitions. Second operand  has 112 states, 75 states have (on average 1.5866666666666667) internal successors, (119), 90 states have internal predecessors, (119), 50 states have call successors, (72), 1 states have call predecessors, (72), 75 states have return successors, (122), 94 states have call predecessors, (122), 50 states have call successors, (122)
[2025-05-07 17:35:36,076 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:35:36,076 INFO  L93              Difference]: Finished difference Result 350 states and 804 transitions.
[2025-05-07 17:35:36,076 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. 
[2025-05-07 17:35:36,076 INFO  L79                 Accepts]: Start accepts. Automaton has  has 112 states, 75 states have (on average 1.5866666666666667) internal successors, (119), 90 states have internal predecessors, (119), 50 states have call successors, (72), 1 states have call predecessors, (72), 75 states have return successors, (122), 94 states have call predecessors, (122), 50 states have call successors, (122) Word has length 236
[2025-05-07 17:35:36,077 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:35:36,078 INFO  L225             Difference]: With dead ends: 350
[2025-05-07 17:35:36,078 INFO  L226             Difference]: Without dead ends: 350
[2025-05-07 17:35:36,079 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 563 GetRequests, 412 SyntacticMatches, 25 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5693 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=641, Invalid=15615, Unknown=0, NotChecked=0, Total=16256
[2025-05-07 17:35:36,080 INFO  L437           NwaCegarLoop]: 91 mSDtfsCounter, 27 mSDsluCounter, 5135 mSDsCounter, 0 mSdLazyCounter, 2697 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 5226 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:35:36,080 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 5226 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2697 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-05-07 17:35:36,080 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 350 states.
[2025-05-07 17:35:36,095 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 299.
[2025-05-07 17:35:36,095 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 299 states, 127 states have (on average 1.031496062992126) internal successors, (131), 130 states have internal predecessors, (131), 64 states have call successors, (65), 27 states have call predecessors, (65), 109 states have return successors, (441), 141 states have call predecessors, (441), 64 states have call successors, (441)
[2025-05-07 17:35:36,096 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 637 transitions.
[2025-05-07 17:35:36,097 INFO  L79                 Accepts]: Start accepts. Automaton has 299 states and 637 transitions. Word has length 236
[2025-05-07 17:35:36,097 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:35:36,097 INFO  L485      AbstractCegarLoop]: Abstraction has 299 states and 637 transitions.
[2025-05-07 17:35:36,097 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 112 states, 75 states have (on average 1.5866666666666667) internal successors, (119), 90 states have internal predecessors, (119), 50 states have call successors, (72), 1 states have call predecessors, (72), 75 states have return successors, (122), 94 states have call predecessors, (122), 50 states have call successors, (122)
[2025-05-07 17:35:36,097 INFO  L278                IsEmpty]: Start isEmpty. Operand 299 states and 637 transitions.
[2025-05-07 17:35:36,099 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 205
[2025-05-07 17:35:36,099 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:35:36,099 INFO  L218           NwaCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:35:36,124 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0
[2025-05-07 17:35:36,299 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2025-05-07 17:35:36,300 INFO  L403      AbstractCegarLoop]: === Iteration 28 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:35:36,300 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:35:36,300 INFO  L85        PathProgramCache]: Analyzing trace with hash -1609382362, now seen corresponding path program 2 times
[2025-05-07 17:35:36,300 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:35:36,300 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766361513]
[2025-05-07 17:35:36,300 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:35:36,300 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:35:36,386 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 204 statements into 2 equivalence classes.
[2025-05-07 17:35:36,401 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 204 of 204 statements.
[2025-05-07 17:35:36,401 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:35:36,401 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:35:38,592 INFO  L134       CoverageAnalysis]: Checked inductivity of 225 backedges. 17 proven. 69 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked.
[2025-05-07 17:35:38,593 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:35:38,593 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766361513]
[2025-05-07 17:35:38,593 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766361513] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:35:38,593 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319019004]
[2025-05-07 17:35:38,593 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:35:38,593 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:35:38,595 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:35:38,597 INFO  L229       MonitoredProcess]: Starting monitored process 20 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:35:38,598 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process
[2025-05-07 17:35:42,307 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 204 statements into 2 equivalence classes.
[2025-05-07 17:35:42,508 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 204 of 204 statements.
[2025-05-07 17:35:42,509 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:35:42,509 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:35:42,520 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2844 conjuncts, 104 conjuncts are in the unsatisfiable core
[2025-05-07 17:35:42,526 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:35:43,044 INFO  L134       CoverageAnalysis]: Checked inductivity of 225 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked.
[2025-05-07 17:35:43,044 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:36:26,187 INFO  L134       CoverageAnalysis]: Checked inductivity of 225 backedges. 8 proven. 118 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked.
[2025-05-07 17:36:26,187 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319019004] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:36:26,187 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:36:26,187 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 38, 61] total 109
[2025-05-07 17:36:26,187 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470991003]
[2025-05-07 17:36:26,187 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:36:26,188 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 109 states
[2025-05-07 17:36:26,188 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:36:26,188 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants.
[2025-05-07 17:36:26,189 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=11324, Unknown=0, NotChecked=0, Total=11772
[2025-05-07 17:36:26,189 INFO  L87              Difference]: Start difference. First operand 299 states and 637 transitions. Second operand  has 109 states, 70 states have (on average 1.6285714285714286) internal successors, (114), 85 states have internal predecessors, (114), 51 states have call successors, (73), 1 states have call predecessors, (73), 70 states have return successors, (119), 91 states have call predecessors, (119), 51 states have call successors, (119)
[2025-05-07 17:36:28,086 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:36:28,086 INFO  L93              Difference]: Finished difference Result 356 states and 818 transitions.
[2025-05-07 17:36:28,086 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. 
[2025-05-07 17:36:28,087 INFO  L79                 Accepts]: Start accepts. Automaton has  has 109 states, 70 states have (on average 1.6285714285714286) internal successors, (114), 85 states have internal predecessors, (114), 51 states have call successors, (73), 1 states have call predecessors, (73), 70 states have return successors, (119), 91 states have call predecessors, (119), 51 states have call successors, (119) Word has length 204
[2025-05-07 17:36:28,087 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:36:28,089 INFO  L225             Difference]: With dead ends: 356
[2025-05-07 17:36:28,089 INFO  L226             Difference]: Without dead ends: 356
[2025-05-07 17:36:28,090 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 344 SyntacticMatches, 22 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6022 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=630, Invalid=15120, Unknown=0, NotChecked=0, Total=15750
[2025-05-07 17:36:28,090 INFO  L437           NwaCegarLoop]: 91 mSDtfsCounter, 30 mSDsluCounter, 4400 mSDsCounter, 0 mSdLazyCounter, 2615 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4491 SdHoareTripleChecker+Invalid, 2641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:36:28,090 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4491 Invalid, 2641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2615 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-05-07 17:36:28,090 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 356 states.
[2025-05-07 17:36:28,106 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 263.
[2025-05-07 17:36:28,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 263 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 113 states have internal predecessors, (114), 62 states have call successors, (63), 27 states have call predecessors, (63), 92 states have return successors, (341), 122 states have call predecessors, (341), 62 states have call successors, (341)
[2025-05-07 17:36:28,108 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 518 transitions.
[2025-05-07 17:36:28,108 INFO  L79                 Accepts]: Start accepts. Automaton has 263 states and 518 transitions. Word has length 204
[2025-05-07 17:36:28,108 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:36:28,108 INFO  L485      AbstractCegarLoop]: Abstraction has 263 states and 518 transitions.
[2025-05-07 17:36:28,108 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 109 states, 70 states have (on average 1.6285714285714286) internal successors, (114), 85 states have internal predecessors, (114), 51 states have call successors, (73), 1 states have call predecessors, (73), 70 states have return successors, (119), 91 states have call predecessors, (119), 51 states have call successors, (119)
[2025-05-07 17:36:28,108 INFO  L278                IsEmpty]: Start isEmpty. Operand 263 states and 518 transitions.
[2025-05-07 17:36:28,109 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2025-05-07 17:36:28,109 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:36:28,109 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:36:28,130 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0
[2025-05-07 17:36:28,310 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28
[2025-05-07 17:36:28,310 INFO  L403      AbstractCegarLoop]: === Iteration 29 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:36:28,310 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:36:28,310 INFO  L85        PathProgramCache]: Analyzing trace with hash -275586335, now seen corresponding path program 1 times
[2025-05-07 17:36:28,310 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:36:28,310 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267341646]
[2025-05-07 17:36:28,310 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:36:28,310 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:36:28,420 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes.
[2025-05-07 17:36:28,460 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements.
[2025-05-07 17:36:28,460 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:36:28,460 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:36:30,077 INFO  L134       CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked.
[2025-05-07 17:36:30,077 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:36:30,077 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267341646]
[2025-05-07 17:36:30,077 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267341646] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:36:30,078 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835653421]
[2025-05-07 17:36:30,078 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:36:30,078 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:36:30,079 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:36:30,081 INFO  L229       MonitoredProcess]: Starting monitored process 21 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:36:30,081 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process
[2025-05-07 17:36:34,026 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes.
[2025-05-07 17:36:34,241 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements.
[2025-05-07 17:36:34,241 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:36:34,241 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:36:34,250 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2345 conjuncts, 84 conjuncts are in the unsatisfiable core
[2025-05-07 17:36:34,253 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:36:34,641 INFO  L134       CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2025-05-07 17:36:34,641 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:37:03,620 INFO  L134       CoverageAnalysis]: Checked inductivity of 108 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked.
[2025-05-07 17:37:03,621 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835653421] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:37:03,621 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:37:03,621 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 35, 49] total 84
[2025-05-07 17:37:03,621 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604796931]
[2025-05-07 17:37:03,621 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:37:03,621 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 84 states
[2025-05-07 17:37:03,621 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:37:03,622 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants.
[2025-05-07 17:37:03,622 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=6686, Unknown=0, NotChecked=0, Total=6972
[2025-05-07 17:37:03,623 INFO  L87              Difference]: Start difference. First operand 263 states and 518 transitions. Second operand  has 84 states, 50 states have (on average 1.8) internal successors, (90), 65 states have internal predecessors, (90), 45 states have call successors, (64), 1 states have call predecessors, (64), 50 states have return successors, (92), 66 states have call predecessors, (92), 45 states have call successors, (92)
[2025-05-07 17:37:04,937 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:37:04,937 INFO  L93              Difference]: Finished difference Result 331 states and 748 transitions.
[2025-05-07 17:37:04,937 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2025-05-07 17:37:04,938 INFO  L79                 Accepts]: Start accepts. Automaton has  has 84 states, 50 states have (on average 1.8) internal successors, (90), 65 states have internal predecessors, (90), 45 states have call successors, (64), 1 states have call predecessors, (64), 50 states have return successors, (92), 66 states have call predecessors, (92), 45 states have call successors, (92) Word has length 165
[2025-05-07 17:37:04,938 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:37:04,939 INFO  L225             Difference]: With dead ends: 331
[2025-05-07 17:37:04,939 INFO  L226             Difference]: Without dead ends: 331
[2025-05-07 17:37:04,940 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 278 SyntacticMatches, 23 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2723 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=392, Invalid=8920, Unknown=0, NotChecked=0, Total=9312
[2025-05-07 17:37:04,940 INFO  L437           NwaCegarLoop]: 91 mSDtfsCounter, 28 mSDsluCounter, 4196 mSDsCounter, 0 mSdLazyCounter, 2194 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 4287 SdHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:37:04,940 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 4287 Invalid, 2215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2194 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-05-07 17:37:04,941 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 331 states.
[2025-05-07 17:37:04,960 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 278.
[2025-05-07 17:37:04,960 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 278 states, 117 states have (on average 1.0341880341880343) internal successors, (121), 120 states have internal predecessors, (121), 63 states have call successors, (64), 27 states have call predecessors, (64), 99 states have return successors, (382), 130 states have call predecessors, (382), 63 states have call successors, (382)
[2025-05-07 17:37:04,962 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 567 transitions.
[2025-05-07 17:37:04,962 INFO  L79                 Accepts]: Start accepts. Automaton has 278 states and 567 transitions. Word has length 165
[2025-05-07 17:37:04,962 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:37:04,962 INFO  L485      AbstractCegarLoop]: Abstraction has 278 states and 567 transitions.
[2025-05-07 17:37:04,962 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 84 states, 50 states have (on average 1.8) internal successors, (90), 65 states have internal predecessors, (90), 45 states have call successors, (64), 1 states have call predecessors, (64), 50 states have return successors, (92), 66 states have call predecessors, (92), 45 states have call successors, (92)
[2025-05-07 17:37:04,963 INFO  L278                IsEmpty]: Start isEmpty. Operand 278 states and 567 transitions.
[2025-05-07 17:37:04,965 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 230
[2025-05-07 17:37:04,965 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:37:04,965 INFO  L218           NwaCegarLoop]: trace histogram [8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:37:04,990 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0
[2025-05-07 17:37:05,165 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:37:05,166 INFO  L403      AbstractCegarLoop]: === Iteration 30 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:37:05,166 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:37:05,166 INFO  L85        PathProgramCache]: Analyzing trace with hash -1903887447, now seen corresponding path program 3 times
[2025-05-07 17:37:05,166 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:37:05,166 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178704579]
[2025-05-07 17:37:05,166 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:37:05,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:37:05,281 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 229 statements into 5 equivalence classes.
[2025-05-07 17:37:05,386 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 229 of 229 statements.
[2025-05-07 17:37:05,386 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2025-05-07 17:37:05,387 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:37:08,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 290 backedges. 12 proven. 101 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked.
[2025-05-07 17:37:08,158 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:37:08,158 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178704579]
[2025-05-07 17:37:08,158 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178704579] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:37:08,158 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041158929]
[2025-05-07 17:37:08,158 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:37:08,158 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:37:08,160 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:37:08,161 INFO  L229       MonitoredProcess]: Starting monitored process 22 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:37:08,162 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process
[2025-05-07 17:37:11,689 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 229 statements into 5 equivalence classes.
[2025-05-07 17:37:12,034 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 229 of 229 statements.
[2025-05-07 17:37:12,034 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2025-05-07 17:37:12,034 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:37:12,047 INFO  L256         TraceCheckSpWp]: Trace formula consists of 3233 conjuncts, 118 conjuncts are in the unsatisfiable core
[2025-05-07 17:37:12,051 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:37:12,626 INFO  L134       CoverageAnalysis]: Checked inductivity of 290 backedges. 6 proven. 60 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked.
[2025-05-07 17:37:12,626 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:38:06,237 INFO  L134       CoverageAnalysis]: Checked inductivity of 290 backedges. 29 proven. 133 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked.
[2025-05-07 17:38:06,238 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041158929] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:38:06,238 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:38:06,238 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 38, 69] total 113
[2025-05-07 17:38:06,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948962727]
[2025-05-07 17:38:06,238 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:38:06,238 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 113 states
[2025-05-07 17:38:06,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:38:06,239 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants.
[2025-05-07 17:38:06,240 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=12191, Unknown=0, NotChecked=0, Total=12656
[2025-05-07 17:38:06,240 INFO  L87              Difference]: Start difference. First operand 278 states and 567 transitions. Second operand  has 113 states, 72 states have (on average 1.6527777777777777) internal successors, (119), 90 states have internal predecessors, (119), 54 states have call successors, (76), 1 states have call predecessors, (76), 72 states have return successors, (122), 92 states have call predecessors, (122), 54 states have call successors, (122)
[2025-05-07 17:38:07,888 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:38:07,888 INFO  L93              Difference]: Finished difference Result 340 states and 734 transitions.
[2025-05-07 17:38:07,888 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. 
[2025-05-07 17:38:07,888 INFO  L79                 Accepts]: Start accepts. Automaton has  has 113 states, 72 states have (on average 1.6527777777777777) internal successors, (119), 90 states have internal predecessors, (119), 54 states have call successors, (76), 1 states have call predecessors, (76), 72 states have return successors, (122), 92 states have call predecessors, (122), 54 states have call successors, (122) Word has length 229
[2025-05-07 17:38:07,889 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:38:07,890 INFO  L225             Difference]: With dead ends: 340
[2025-05-07 17:38:07,890 INFO  L226             Difference]: Without dead ends: 340
[2025-05-07 17:38:07,891 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 399 SyntacticMatches, 23 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5973 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=684, Invalid=16608, Unknown=0, NotChecked=0, Total=17292
[2025-05-07 17:38:07,892 INFO  L437           NwaCegarLoop]: 90 mSDtfsCounter, 45 mSDsluCounter, 5007 mSDsCounter, 0 mSdLazyCounter, 2611 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 5097 SdHoareTripleChecker+Invalid, 2660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:38:07,892 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 5097 Invalid, 2660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2611 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-05-07 17:38:07,892 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 340 states.
[2025-05-07 17:38:07,905 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 256.
[2025-05-07 17:38:07,905 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 256 states, 107 states have (on average 1.0373831775700935) internal successors, (111), 110 states have internal predecessors, (111), 61 states have call successors, (62), 27 states have call predecessors, (62), 89 states have return successors, (321), 118 states have call predecessors, (321), 61 states have call successors, (321)
[2025-05-07 17:38:07,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 494 transitions.
[2025-05-07 17:38:07,908 INFO  L79                 Accepts]: Start accepts. Automaton has 256 states and 494 transitions. Word has length 229
[2025-05-07 17:38:07,908 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:38:07,908 INFO  L485      AbstractCegarLoop]: Abstraction has 256 states and 494 transitions.
[2025-05-07 17:38:07,908 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 113 states, 72 states have (on average 1.6527777777777777) internal successors, (119), 90 states have internal predecessors, (119), 54 states have call successors, (76), 1 states have call predecessors, (76), 72 states have return successors, (122), 92 states have call predecessors, (122), 54 states have call successors, (122)
[2025-05-07 17:38:07,908 INFO  L278                IsEmpty]: Start isEmpty. Operand 256 states and 494 transitions.
[2025-05-07 17:38:07,910 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 230
[2025-05-07 17:38:07,910 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:38:07,910 INFO  L218           NwaCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:07,936 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0
[2025-05-07 17:38:08,110 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:38:08,111 INFO  L403      AbstractCegarLoop]: === Iteration 31 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:38:08,112 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:38:08,112 INFO  L85        PathProgramCache]: Analyzing trace with hash 250177469, now seen corresponding path program 3 times
[2025-05-07 17:38:08,112 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:38:08,112 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733336554]
[2025-05-07 17:38:08,113 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:38:08,113 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:38:08,284 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 229 statements into 5 equivalence classes.
[2025-05-07 17:38:08,331 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 229 of 229 statements.
[2025-05-07 17:38:08,331 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2025-05-07 17:38:08,331 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:38:11,082 INFO  L134       CoverageAnalysis]: Checked inductivity of 282 backedges. 32 proven. 71 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked.
[2025-05-07 17:38:11,082 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:38:11,082 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733336554]
[2025-05-07 17:38:11,083 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733336554] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:38:11,083 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870755430]
[2025-05-07 17:38:11,083 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:38:11,083 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:38:11,085 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:38:11,087 INFO  L229       MonitoredProcess]: Starting monitored process 23 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:38:11,087 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process
[2025-05-07 17:38:14,561 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 229 statements into 5 equivalence classes.
[2025-05-07 17:38:14,788 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 229 of 229 statements.
[2025-05-07 17:38:14,788 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2025-05-07 17:38:14,788 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:38:14,800 INFO  L256         TraceCheckSpWp]: Trace formula consists of 3226 conjuncts, 117 conjuncts are in the unsatisfiable core
[2025-05-07 17:38:14,804 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:38:15,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 282 backedges. 32 proven. 34 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked.
[2025-05-07 17:38:15,435 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:39:03,563 INFO  L134       CoverageAnalysis]: Checked inductivity of 282 backedges. 50 proven. 105 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked.
[2025-05-07 17:39:03,564 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870755430] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:39:03,564 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:39:03,564 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 39, 68] total 122
[2025-05-07 17:39:03,564 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209851605]
[2025-05-07 17:39:03,564 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:39:03,565 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 122 states
[2025-05-07 17:39:03,565 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:39:03,566 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants.
[2025-05-07 17:39:03,566 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=14219, Unknown=0, NotChecked=0, Total=14762
[2025-05-07 17:39:03,567 INFO  L87              Difference]: Start difference. First operand 256 states and 494 transitions. Second operand  has 122 states, 79 states have (on average 1.5822784810126582) internal successors, (125), 97 states have internal predecessors, (125), 56 states have call successors, (75), 1 states have call predecessors, (75), 79 states have return successors, (125), 100 states have call predecessors, (125), 56 states have call successors, (125)
[2025-05-07 17:39:05,789 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:39:05,789 INFO  L93              Difference]: Finished difference Result 302 states and 630 transitions.
[2025-05-07 17:39:05,789 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. 
[2025-05-07 17:39:05,790 INFO  L79                 Accepts]: Start accepts. Automaton has  has 122 states, 79 states have (on average 1.5822784810126582) internal successors, (125), 97 states have internal predecessors, (125), 56 states have call successors, (75), 1 states have call predecessors, (75), 79 states have return successors, (125), 100 states have call predecessors, (125), 56 states have call successors, (125) Word has length 229
[2025-05-07 17:39:05,790 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:39:05,791 INFO  L225             Difference]: With dead ends: 302
[2025-05-07 17:39:05,791 INFO  L226             Difference]: Without dead ends: 302
[2025-05-07 17:39:05,792 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 395 SyntacticMatches, 17 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7224 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=765, Invalid=18975, Unknown=0, NotChecked=0, Total=19740
[2025-05-07 17:39:05,793 INFO  L437           NwaCegarLoop]: 92 mSDtfsCounter, 33 mSDsluCounter, 5150 mSDsCounter, 0 mSdLazyCounter, 3413 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 5242 SdHoareTripleChecker+Invalid, 3439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-05-07 17:39:05,793 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 5242 Invalid, 3439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3413 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-05-07 17:39:05,793 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 302 states.
[2025-05-07 17:39:05,803 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 254.
[2025-05-07 17:39:05,803 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 254 states, 106 states have (on average 1.0377358490566038) internal successors, (110), 109 states have internal predecessors, (110), 61 states have call successors, (62), 27 states have call predecessors, (62), 88 states have return successors, (314), 117 states have call predecessors, (314), 61 states have call successors, (314)
[2025-05-07 17:39:05,804 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 486 transitions.
[2025-05-07 17:39:05,804 INFO  L79                 Accepts]: Start accepts. Automaton has 254 states and 486 transitions. Word has length 229
[2025-05-07 17:39:05,804 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:39:05,805 INFO  L485      AbstractCegarLoop]: Abstraction has 254 states and 486 transitions.
[2025-05-07 17:39:05,805 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 122 states, 79 states have (on average 1.5822784810126582) internal successors, (125), 97 states have internal predecessors, (125), 56 states have call successors, (75), 1 states have call predecessors, (75), 79 states have return successors, (125), 100 states have call predecessors, (125), 56 states have call successors, (125)
[2025-05-07 17:39:05,805 INFO  L278                IsEmpty]: Start isEmpty. Operand 254 states and 486 transitions.
[2025-05-07 17:39:05,806 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 170
[2025-05-07 17:39:05,806 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:39:05,806 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:39:05,834 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0
[2025-05-07 17:39:06,006 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31
[2025-05-07 17:39:06,007 INFO  L403      AbstractCegarLoop]: === Iteration 32 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:39:06,007 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:39:06,007 INFO  L85        PathProgramCache]: Analyzing trace with hash 1794540053, now seen corresponding path program 2 times
[2025-05-07 17:39:06,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:39:06,008 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694734560]
[2025-05-07 17:39:06,008 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:39:06,008 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:39:06,148 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 169 statements into 2 equivalence classes.
[2025-05-07 17:39:06,160 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 169 of 169 statements.
[2025-05-07 17:39:06,160 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:39:06,160 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:39:07,565 INFO  L134       CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked.
[2025-05-07 17:39:07,565 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:39:07,565 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694734560]
[2025-05-07 17:39:07,565 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694734560] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:39:07,565 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433818755]
[2025-05-07 17:39:07,565 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:39:07,565 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:39:07,566 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:39:07,568 INFO  L229       MonitoredProcess]: Starting monitored process 24 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:39:07,568 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process
[2025-05-07 17:39:11,609 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 169 statements into 2 equivalence classes.
[2025-05-07 17:39:11,775 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 169 of 169 statements.
[2025-05-07 17:39:11,775 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:39:11,775 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:39:11,783 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2332 conjuncts, 80 conjuncts are in the unsatisfiable core
[2025-05-07 17:39:11,786 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:39:12,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked.
[2025-05-07 17:39:12,443 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:39:31,468 INFO  L134       CoverageAnalysis]: Checked inductivity of 115 backedges. 13 proven. 47 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked.
[2025-05-07 17:39:31,468 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [433818755] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:39:31,468 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:39:31,468 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 37, 50] total 97
[2025-05-07 17:39:31,468 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881343468]
[2025-05-07 17:39:31,468 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:39:31,468 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 97 states
[2025-05-07 17:39:31,468 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:39:31,469 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants.
[2025-05-07 17:39:31,469 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=8971, Unknown=0, NotChecked=0, Total=9312
[2025-05-07 17:39:31,470 INFO  L87              Difference]: Start difference. First operand 254 states and 486 transitions. Second operand  has 97 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 74 states have internal predecessors, (103), 49 states have call successors, (69), 1 states have call predecessors, (69), 60 states have return successors, (103), 78 states have call predecessors, (103), 49 states have call successors, (103)
[2025-05-07 17:39:33,264 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:39:33,264 INFO  L93              Difference]: Finished difference Result 296 states and 640 transitions.
[2025-05-07 17:39:33,264 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. 
[2025-05-07 17:39:33,265 INFO  L79                 Accepts]: Start accepts. Automaton has  has 97 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 74 states have internal predecessors, (103), 49 states have call successors, (69), 1 states have call predecessors, (69), 60 states have return successors, (103), 78 states have call predecessors, (103), 49 states have call successors, (103) Word has length 169
[2025-05-07 17:39:33,265 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:39:33,266 INFO  L225             Difference]: With dead ends: 296
[2025-05-07 17:39:33,266 INFO  L226             Difference]: Without dead ends: 296
[2025-05-07 17:39:33,267 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 280 SyntacticMatches, 16 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3255 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=482, Invalid=11950, Unknown=0, NotChecked=0, Total=12432
[2025-05-07 17:39:33,267 INFO  L437           NwaCegarLoop]: 97 mSDtfsCounter, 30 mSDsluCounter, 5666 mSDsCounter, 0 mSdLazyCounter, 3762 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 5763 SdHoareTripleChecker+Invalid, 3786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:39:33,267 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 5763 Invalid, 3786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3762 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-05-07 17:39:33,269 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 296 states.
[2025-05-07 17:39:33,280 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 260.
[2025-05-07 17:39:33,281 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 260 states, 109 states have (on average 1.036697247706422) internal successors, (113), 112 states have internal predecessors, (113), 61 states have call successors, (62), 27 states have call predecessors, (62), 91 states have return successors, (335), 120 states have call predecessors, (335), 61 states have call successors, (335)
[2025-05-07 17:39:33,282 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 510 transitions.
[2025-05-07 17:39:33,282 INFO  L79                 Accepts]: Start accepts. Automaton has 260 states and 510 transitions. Word has length 169
[2025-05-07 17:39:33,282 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:39:33,282 INFO  L485      AbstractCegarLoop]: Abstraction has 260 states and 510 transitions.
[2025-05-07 17:39:33,282 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 97 states, 60 states have (on average 1.7166666666666666) internal successors, (103), 74 states have internal predecessors, (103), 49 states have call successors, (69), 1 states have call predecessors, (69), 60 states have return successors, (103), 78 states have call predecessors, (103), 49 states have call successors, (103)
[2025-05-07 17:39:33,282 INFO  L278                IsEmpty]: Start isEmpty. Operand 260 states and 510 transitions.
[2025-05-07 17:39:33,283 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2025-05-07 17:39:33,283 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:39:33,283 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:39:33,313 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0
[2025-05-07 17:39:33,484 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:39:33,484 INFO  L403      AbstractCegarLoop]: === Iteration 33 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:39:33,485 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:39:33,485 INFO  L85        PathProgramCache]: Analyzing trace with hash 1155881580, now seen corresponding path program 2 times
[2025-05-07 17:39:33,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:39:33,486 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856360751]
[2025-05-07 17:39:33,486 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:39:33,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:39:33,630 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 162 statements into 2 equivalence classes.
[2025-05-07 17:39:33,642 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 162 of 162 statements.
[2025-05-07 17:39:33,642 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:39:33,642 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:39:34,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2025-05-07 17:39:34,854 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:39:34,854 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856360751]
[2025-05-07 17:39:34,854 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856360751] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:39:34,854 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369180790]
[2025-05-07 17:39:34,854 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:39:34,854 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:39:34,855 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:39:34,857 INFO  L229       MonitoredProcess]: Starting monitored process 25 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:39:34,858 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process
[2025-05-07 17:39:39,420 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 162 statements into 2 equivalence classes.
[2025-05-07 17:39:39,582 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 162 of 162 statements.
[2025-05-07 17:39:39,582 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:39:39,582 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:39:39,590 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2277 conjuncts, 77 conjuncts are in the unsatisfiable core
[2025-05-07 17:39:39,593 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:39:39,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked.
[2025-05-07 17:39:39,970 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:39:58,445 INFO  L134       CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 33 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked.
[2025-05-07 17:39:58,445 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369180790] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:39:58,445 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:39:58,445 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 33, 48] total 85
[2025-05-07 17:39:58,446 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508274841]
[2025-05-07 17:39:58,446 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:39:58,446 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 85 states
[2025-05-07 17:39:58,446 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:39:58,446 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants.
[2025-05-07 17:39:58,447 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=6841, Unknown=0, NotChecked=0, Total=7140
[2025-05-07 17:39:58,447 INFO  L87              Difference]: Start difference. First operand 260 states and 510 transitions. Second operand  has 85 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 67 states have internal predecessors, (92), 45 states have call successors, (61), 1 states have call predecessors, (61), 52 states have return successors, (89), 65 states have call predecessors, (89), 45 states have call successors, (89)
[2025-05-07 17:39:59,678 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:39:59,678 INFO  L93              Difference]: Finished difference Result 295 states and 627 transitions.
[2025-05-07 17:39:59,678 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2025-05-07 17:39:59,678 INFO  L79                 Accepts]: Start accepts. Automaton has  has 85 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 67 states have internal predecessors, (92), 45 states have call successors, (61), 1 states have call predecessors, (61), 52 states have return successors, (89), 65 states have call predecessors, (89), 45 states have call successors, (89) Word has length 162
[2025-05-07 17:39:59,679 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:39:59,680 INFO  L225             Difference]: With dead ends: 295
[2025-05-07 17:39:59,680 INFO  L226             Difference]: Without dead ends: 295
[2025-05-07 17:39:59,681 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 275 SyntacticMatches, 17 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2442 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=387, Invalid=8543, Unknown=0, NotChecked=0, Total=8930
[2025-05-07 17:39:59,681 INFO  L437           NwaCegarLoop]: 95 mSDtfsCounter, 21 mSDsluCounter, 4606 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 4701 SdHoareTripleChecker+Invalid, 2478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:39:59,681 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 4701 Invalid, 2478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-05-07 17:39:59,681 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 295 states.
[2025-05-07 17:39:59,691 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 265.
[2025-05-07 17:39:59,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 265 states, 111 states have (on average 1.0360360360360361) internal successors, (115), 114 states have internal predecessors, (115), 62 states have call successors, (63), 27 states have call predecessors, (63), 93 states have return successors, (353), 123 states have call predecessors, (353), 62 states have call successors, (353)
[2025-05-07 17:39:59,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 531 transitions.
[2025-05-07 17:39:59,693 INFO  L79                 Accepts]: Start accepts. Automaton has 265 states and 531 transitions. Word has length 162
[2025-05-07 17:39:59,693 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:39:59,693 INFO  L485      AbstractCegarLoop]: Abstraction has 265 states and 531 transitions.
[2025-05-07 17:39:59,693 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 85 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 67 states have internal predecessors, (92), 45 states have call successors, (61), 1 states have call predecessors, (61), 52 states have return successors, (89), 65 states have call predecessors, (89), 45 states have call successors, (89)
[2025-05-07 17:39:59,693 INFO  L278                IsEmpty]: Start isEmpty. Operand 265 states and 531 transitions.
[2025-05-07 17:39:59,694 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 202
[2025-05-07 17:39:59,694 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:39:59,694 INFO  L218           NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:39:59,726 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0
[2025-05-07 17:39:59,895 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33
[2025-05-07 17:39:59,895 INFO  L403      AbstractCegarLoop]: === Iteration 34 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:39:59,896 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:39:59,896 INFO  L85        PathProgramCache]: Analyzing trace with hash 705218191, now seen corresponding path program 2 times
[2025-05-07 17:39:59,897 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:39:59,897 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191258401]
[2025-05-07 17:39:59,897 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:39:59,897 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:40:00,053 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 201 statements into 2 equivalence classes.
[2025-05-07 17:40:00,067 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 201 of 201 statements.
[2025-05-07 17:40:00,067 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:40:00,067 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:40:01,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 204 backedges. 11 proven. 60 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked.
[2025-05-07 17:40:01,881 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:40:01,881 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191258401]
[2025-05-07 17:40:01,881 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191258401] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:40:01,881 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174977515]
[2025-05-07 17:40:01,881 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:40:01,881 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:40:01,882 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:40:01,884 INFO  L229       MonitoredProcess]: Starting monitored process 26 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:40:01,884 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process
[2025-05-07 17:40:06,345 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 201 statements into 2 equivalence classes.
[2025-05-07 17:40:06,514 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 201 of 201 statements.
[2025-05-07 17:40:06,515 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:40:06,515 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:40:06,525 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2776 conjuncts, 97 conjuncts are in the unsatisfiable core
[2025-05-07 17:40:06,528 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:40:07,181 INFO  L134       CoverageAnalysis]: Checked inductivity of 204 backedges. 11 proven. 50 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked.
[2025-05-07 17:40:07,181 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:40:36,569 INFO  L134       CoverageAnalysis]: Checked inductivity of 204 backedges. 28 proven. 86 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2025-05-07 17:40:36,569 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [174977515] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:40:36,569 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:40:36,569 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 42, 60] total 112
[2025-05-07 17:40:36,569 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687991126]
[2025-05-07 17:40:36,569 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:40:36,570 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 112 states
[2025-05-07 17:40:36,570 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:40:36,570 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants.
[2025-05-07 17:40:36,571 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=11999, Unknown=0, NotChecked=0, Total=12432
[2025-05-07 17:40:36,571 INFO  L87              Difference]: Start difference. First operand 265 states and 531 transitions. Second operand  has 112 states, 72 states have (on average 1.6527777777777777) internal successors, (119), 87 states have internal predecessors, (119), 53 states have call successors, (78), 1 states have call predecessors, (78), 72 states have return successors, (123), 92 states have call predecessors, (123), 53 states have call successors, (123)
[2025-05-07 17:40:38,614 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:40:38,614 INFO  L93              Difference]: Finished difference Result 295 states and 631 transitions.
[2025-05-07 17:40:38,615 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. 
[2025-05-07 17:40:38,615 INFO  L79                 Accepts]: Start accepts. Automaton has  has 112 states, 72 states have (on average 1.6527777777777777) internal successors, (119), 87 states have internal predecessors, (119), 53 states have call successors, (78), 1 states have call predecessors, (78), 72 states have return successors, (123), 92 states have call predecessors, (123), 53 states have call successors, (123) Word has length 201
[2025-05-07 17:40:38,615 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:40:38,617 INFO  L225             Difference]: With dead ends: 295
[2025-05-07 17:40:38,617 INFO  L226             Difference]: Without dead ends: 295
[2025-05-07 17:40:38,618 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 339 SyntacticMatches, 16 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5130 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=616, Invalid=16154, Unknown=0, NotChecked=0, Total=16770
[2025-05-07 17:40:38,618 INFO  L437           NwaCegarLoop]: 98 mSDtfsCounter, 31 mSDsluCounter, 5857 mSDsCounter, 0 mSdLazyCounter, 3761 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 5955 SdHoareTripleChecker+Invalid, 3798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 3761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:40:38,618 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 5955 Invalid, 3798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 3761 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-05-07 17:40:38,618 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 295 states.
[2025-05-07 17:40:38,630 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 231.
[2025-05-07 17:40:38,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 231 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 99 states have internal predecessors, (100), 58 states have call successors, (59), 27 states have call predecessors, (59), 78 states have return successors, (265), 104 states have call predecessors, (265), 58 states have call successors, (265)
[2025-05-07 17:40:38,630 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 424 transitions.
[2025-05-07 17:40:38,630 INFO  L79                 Accepts]: Start accepts. Automaton has 231 states and 424 transitions. Word has length 201
[2025-05-07 17:40:38,631 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:40:38,631 INFO  L485      AbstractCegarLoop]: Abstraction has 231 states and 424 transitions.
[2025-05-07 17:40:38,631 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 112 states, 72 states have (on average 1.6527777777777777) internal successors, (119), 87 states have internal predecessors, (119), 53 states have call successors, (78), 1 states have call predecessors, (78), 72 states have return successors, (123), 92 states have call predecessors, (123), 53 states have call successors, (123)
[2025-05-07 17:40:38,631 INFO  L278                IsEmpty]: Start isEmpty. Operand 231 states and 424 transitions.
[2025-05-07 17:40:38,632 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 159
[2025-05-07 17:40:38,632 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:40:38,632 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:40:38,666 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0
[2025-05-07 17:40:38,832 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34
[2025-05-07 17:40:38,833 INFO  L403      AbstractCegarLoop]: === Iteration 35 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:40:38,834 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:40:38,834 INFO  L85        PathProgramCache]: Analyzing trace with hash 1474062732, now seen corresponding path program 1 times
[2025-05-07 17:40:38,834 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:40:38,834 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322494778]
[2025-05-07 17:40:38,834 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:40:38,835 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:40:39,003 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes.
[2025-05-07 17:40:39,016 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements.
[2025-05-07 17:40:39,016 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:40:39,017 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:40:40,263 INFO  L134       CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked.
[2025-05-07 17:40:40,264 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:40:40,264 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322494778]
[2025-05-07 17:40:40,264 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322494778] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:40:40,264 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994378363]
[2025-05-07 17:40:40,264 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:40:40,264 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:40:40,266 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:40:40,267 INFO  L229       MonitoredProcess]: Starting monitored process 27 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:40:40,268 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process
[2025-05-07 17:40:45,467 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes.
[2025-05-07 17:40:45,609 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements.
[2025-05-07 17:40:45,609 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:40:45,610 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:40:45,618 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2283 conjuncts, 80 conjuncts are in the unsatisfiable core
[2025-05-07 17:40:45,621 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:40:45,923 INFO  L134       CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked.
[2025-05-07 17:40:45,923 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:41:07,169 INFO  L134       CoverageAnalysis]: Checked inductivity of 147 backedges. 15 proven. 56 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked.
[2025-05-07 17:41:07,169 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994378363] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:41:07,169 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:41:07,169 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 31, 48] total 81
[2025-05-07 17:41:07,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952151844]
[2025-05-07 17:41:07,169 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:41:07,170 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 81 states
[2025-05-07 17:41:07,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:41:07,170 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants.
[2025-05-07 17:41:07,171 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=6184, Unknown=0, NotChecked=0, Total=6480
[2025-05-07 17:41:07,171 INFO  L87              Difference]: Start difference. First operand 231 states and 424 transitions. Second operand  has 81 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 65 states have internal predecessors, (88), 44 states have call successors, (58), 1 states have call predecessors, (58), 49 states have return successors, (82), 60 states have call predecessors, (82), 44 states have call successors, (82)
[2025-05-07 17:41:08,066 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:41:08,066 INFO  L93              Difference]: Finished difference Result 274 states and 546 transitions.
[2025-05-07 17:41:08,066 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2025-05-07 17:41:08,066 INFO  L79                 Accepts]: Start accepts. Automaton has  has 81 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 65 states have internal predecessors, (88), 44 states have call successors, (58), 1 states have call predecessors, (58), 49 states have return successors, (82), 60 states have call predecessors, (82), 44 states have call successors, (82) Word has length 158
[2025-05-07 17:41:08,066 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:41:08,067 INFO  L225             Difference]: With dead ends: 274
[2025-05-07 17:41:08,068 INFO  L226             Difference]: Without dead ends: 274
[2025-05-07 17:41:08,068 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 269 SyntacticMatches, 18 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2577 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=379, Invalid=7631, Unknown=0, NotChecked=0, Total=8010
[2025-05-07 17:41:08,068 INFO  L437           NwaCegarLoop]: 92 mSDtfsCounter, 21 mSDsluCounter, 3939 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4031 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-05-07 17:41:08,068 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4031 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-05-07 17:41:08,069 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 274 states.
[2025-05-07 17:41:08,079 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 243.
[2025-05-07 17:41:08,079 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 243 states, 101 states have (on average 1.0396039603960396) internal successors, (105), 104 states have internal predecessors, (105), 60 states have call successors, (61), 27 states have call predecessors, (61), 83 states have return successors, (289), 111 states have call predecessors, (289), 60 states have call successors, (289)
[2025-05-07 17:41:08,080 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 455 transitions.
[2025-05-07 17:41:08,080 INFO  L79                 Accepts]: Start accepts. Automaton has 243 states and 455 transitions. Word has length 158
[2025-05-07 17:41:08,080 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:41:08,081 INFO  L485      AbstractCegarLoop]: Abstraction has 243 states and 455 transitions.
[2025-05-07 17:41:08,081 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 81 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 65 states have internal predecessors, (88), 44 states have call successors, (58), 1 states have call predecessors, (58), 49 states have return successors, (82), 60 states have call predecessors, (82), 44 states have call successors, (82)
[2025-05-07 17:41:08,081 INFO  L278                IsEmpty]: Start isEmpty. Operand 243 states and 455 transitions.
[2025-05-07 17:41:08,083 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 166
[2025-05-07 17:41:08,083 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:41:08,083 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:41:08,117 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0
[2025-05-07 17:41:08,284 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35
[2025-05-07 17:41:08,284 INFO  L403      AbstractCegarLoop]: === Iteration 36 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:41:08,285 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:41:08,285 INFO  L85        PathProgramCache]: Analyzing trace with hash 1272811539, now seen corresponding path program 3 times
[2025-05-07 17:41:08,286 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:41:08,286 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481051707]
[2025-05-07 17:41:08,286 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:41:08,286 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:41:08,461 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 165 statements into 4 equivalence classes.
[2025-05-07 17:41:08,490 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 165 of 165 statements.
[2025-05-07 17:41:08,490 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-05-07 17:41:08,490 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:41:10,029 INFO  L134       CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2025-05-07 17:41:10,030 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:41:10,030 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481051707]
[2025-05-07 17:41:10,030 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481051707] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:41:10,030 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678139250]
[2025-05-07 17:41:10,030 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:41:10,030 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:41:10,032 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:41:10,033 INFO  L229       MonitoredProcess]: Starting monitored process 28 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:41:10,034 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process
[2025-05-07 17:41:14,870 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 165 statements into 4 equivalence classes.
[2025-05-07 17:41:15,091 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 165 of 165 statements.
[2025-05-07 17:41:15,091 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-05-07 17:41:15,092 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:41:15,101 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2338 conjuncts, 83 conjuncts are in the unsatisfiable core
[2025-05-07 17:41:15,104 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:41:15,617 INFO  L134       CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked.
[2025-05-07 17:41:15,617 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:41:38,923 INFO  L134       CoverageAnalysis]: Checked inductivity of 112 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked.
[2025-05-07 17:41:38,923 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678139250] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:41:38,923 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:41:38,923 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 34, 48] total 87
[2025-05-07 17:41:38,923 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144837925]
[2025-05-07 17:41:38,923 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:41:38,924 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 87 states
[2025-05-07 17:41:38,924 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:41:38,924 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants.
[2025-05-07 17:41:38,925 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=7179, Unknown=0, NotChecked=0, Total=7482
[2025-05-07 17:41:38,925 INFO  L87              Difference]: Start difference. First operand 243 states and 455 transitions. Second operand  has 87 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 68 states have internal predecessors, (92), 47 states have call successors, (64), 1 states have call predecessors, (64), 52 states have return successors, (92), 68 states have call predecessors, (92), 47 states have call successors, (92)
[2025-05-07 17:41:40,114 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:41:40,114 INFO  L93              Difference]: Finished difference Result 303 states and 640 transitions.
[2025-05-07 17:41:40,114 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. 
[2025-05-07 17:41:40,115 INFO  L79                 Accepts]: Start accepts. Automaton has  has 87 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 68 states have internal predecessors, (92), 47 states have call successors, (64), 1 states have call predecessors, (64), 52 states have return successors, (92), 68 states have call predecessors, (92), 47 states have call successors, (92) Word has length 165
[2025-05-07 17:41:40,115 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:41:40,116 INFO  L225             Difference]: With dead ends: 303
[2025-05-07 17:41:40,116 INFO  L226             Difference]: Without dead ends: 303
[2025-05-07 17:41:40,117 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 278 SyntacticMatches, 20 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2564 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=405, Invalid=9297, Unknown=0, NotChecked=0, Total=9702
[2025-05-07 17:41:40,117 INFO  L437           NwaCegarLoop]: 92 mSDtfsCounter, 27 mSDsluCounter, 4091 mSDsCounter, 0 mSdLazyCounter, 2162 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 4183 SdHoareTripleChecker+Invalid, 2202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-05-07 17:41:40,117 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 4183 Invalid, 2202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2162 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-05-07 17:41:40,117 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 303 states.
[2025-05-07 17:41:40,128 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 249.
[2025-05-07 17:41:40,128 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 249 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 107 states have internal predecessors, (108), 60 states have call successors, (61), 27 states have call predecessors, (61), 86 states have return successors, (304), 114 states have call predecessors, (304), 60 states have call successors, (304)
[2025-05-07 17:41:40,129 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 473 transitions.
[2025-05-07 17:41:40,129 INFO  L79                 Accepts]: Start accepts. Automaton has 249 states and 473 transitions. Word has length 165
[2025-05-07 17:41:40,129 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:41:40,129 INFO  L485      AbstractCegarLoop]: Abstraction has 249 states and 473 transitions.
[2025-05-07 17:41:40,129 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 87 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 68 states have internal predecessors, (92), 47 states have call successors, (64), 1 states have call predecessors, (64), 52 states have return successors, (92), 68 states have call predecessors, (92), 47 states have call successors, (92)
[2025-05-07 17:41:40,129 INFO  L278                IsEmpty]: Start isEmpty. Operand 249 states and 473 transitions.
[2025-05-07 17:41:40,131 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-05-07 17:41:40,131 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:41:40,131 INFO  L218           NwaCegarLoop]: trace histogram [8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:41:40,171 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0
[2025-05-07 17:41:40,331 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36
[2025-05-07 17:41:40,332 INFO  L403      AbstractCegarLoop]: === Iteration 37 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:41:40,332 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:41:40,333 INFO  L85        PathProgramCache]: Analyzing trace with hash -1083125488, now seen corresponding path program 1 times
[2025-05-07 17:41:40,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:41:40,333 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945047458]
[2025-05-07 17:41:40,333 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:41:40,333 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:41:40,521 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-05-07 17:41:40,538 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-05-07 17:41:40,538 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:41:40,538 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:41:43,523 INFO  L134       CoverageAnalysis]: Checked inductivity of 359 backedges. 12 proven. 100 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked.
[2025-05-07 17:41:43,523 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:41:43,523 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945047458]
[2025-05-07 17:41:43,523 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945047458] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:41:43,523 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190391658]
[2025-05-07 17:41:43,523 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:41:43,523 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:41:43,524 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:41:43,526 INFO  L229       MonitoredProcess]: Starting monitored process 29 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:41:43,526 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process
[2025-05-07 17:41:48,969 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-05-07 17:41:49,259 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-05-07 17:41:49,259 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:41:49,260 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:41:49,274 INFO  L256         TraceCheckSpWp]: Trace formula consists of 3615 conjuncts, 131 conjuncts are in the unsatisfiable core
[2025-05-07 17:41:49,278 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:41:49,705 INFO  L134       CoverageAnalysis]: Checked inductivity of 359 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked.
[2025-05-07 17:41:49,705 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:42:48,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 359 backedges. 39 proven. 156 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked.
[2025-05-07 17:42:48,397 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [190391658] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:42:48,397 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:42:48,398 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 39, 76] total 114
[2025-05-07 17:42:48,398 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550676111]
[2025-05-07 17:42:48,398 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:42:48,398 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 114 states
[2025-05-07 17:42:48,398 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:42:48,399 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants.
[2025-05-07 17:42:48,399 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=474, Invalid=12408, Unknown=0, NotChecked=0, Total=12882
[2025-05-07 17:42:48,400 INFO  L87              Difference]: Start difference. First operand 249 states and 473 transitions. Second operand  has 114 states, 71 states have (on average 1.6901408450704225) internal successors, (120), 90 states have internal predecessors, (120), 57 states have call successors, (81), 1 states have call predecessors, (81), 71 states have return successors, (125), 92 states have call predecessors, (125), 57 states have call successors, (125)
[2025-05-07 17:42:49,959 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:42:49,959 INFO  L93              Difference]: Finished difference Result 304 states and 645 transitions.
[2025-05-07 17:42:49,959 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. 
[2025-05-07 17:42:49,959 INFO  L79                 Accepts]: Start accepts. Automaton has  has 114 states, 71 states have (on average 1.6901408450704225) internal successors, (120), 90 states have internal predecessors, (120), 57 states have call successors, (81), 1 states have call predecessors, (81), 71 states have return successors, (125), 92 states have call predecessors, (125), 57 states have call successors, (125) Word has length 254
[2025-05-07 17:42:49,959 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:42:49,961 INFO  L225             Difference]: With dead ends: 304
[2025-05-07 17:42:49,961 INFO  L226             Difference]: Without dead ends: 304
[2025-05-07 17:42:49,962 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 452 SyntacticMatches, 25 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=655, Invalid=16115, Unknown=0, NotChecked=0, Total=16770
[2025-05-07 17:42:49,962 INFO  L437           NwaCegarLoop]: 91 mSDtfsCounter, 45 mSDsluCounter, 4710 mSDsCounter, 0 mSdLazyCounter, 2357 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 4801 SdHoareTripleChecker+Invalid, 2402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:42:49,962 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 4801 Invalid, 2402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2357 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-05-07 17:42:49,962 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 304 states.
[2025-05-07 17:42:49,973 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 250.
[2025-05-07 17:42:49,973 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 250 states, 105 states have (on average 1.0380952380952382) internal successors, (109), 108 states have internal predecessors, (109), 59 states have call successors, (60), 27 states have call predecessors, (60), 87 states have return successors, (315), 114 states have call predecessors, (315), 59 states have call successors, (315)
[2025-05-07 17:42:49,974 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 484 transitions.
[2025-05-07 17:42:49,975 INFO  L79                 Accepts]: Start accepts. Automaton has 250 states and 484 transitions. Word has length 254
[2025-05-07 17:42:49,975 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:42:49,975 INFO  L485      AbstractCegarLoop]: Abstraction has 250 states and 484 transitions.
[2025-05-07 17:42:49,975 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 114 states, 71 states have (on average 1.6901408450704225) internal successors, (120), 90 states have internal predecessors, (120), 57 states have call successors, (81), 1 states have call predecessors, (81), 71 states have return successors, (125), 92 states have call predecessors, (125), 57 states have call successors, (125)
[2025-05-07 17:42:49,975 INFO  L278                IsEmpty]: Start isEmpty. Operand 250 states and 484 transitions.
[2025-05-07 17:42:49,977 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 227
[2025-05-07 17:42:49,977 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:42:49,977 INFO  L218           NwaCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:42:50,020 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0
[2025-05-07 17:42:50,178 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,29 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:42:50,178 INFO  L403      AbstractCegarLoop]: === Iteration 38 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:42:50,178 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:42:50,178 INFO  L85        PathProgramCache]: Analyzing trace with hash 1640466868, now seen corresponding path program 3 times
[2025-05-07 17:42:50,178 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:42:50,178 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531462119]
[2025-05-07 17:42:50,178 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:42:50,178 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:42:50,359 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 226 statements into 5 equivalence classes.
[2025-05-07 17:42:50,418 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 226 of 226 statements.
[2025-05-07 17:42:50,418 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2025-05-07 17:42:50,418 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:42:52,777 INFO  L134       CoverageAnalysis]: Checked inductivity of 264 backedges. 2 proven. 84 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked.
[2025-05-07 17:42:52,777 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:42:52,777 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531462119]
[2025-05-07 17:42:52,777 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531462119] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:42:52,777 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290527791]
[2025-05-07 17:42:52,777 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:42:52,777 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:42:52,778 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:42:52,780 INFO  L229       MonitoredProcess]: Starting monitored process 30 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:42:52,780 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process
[2025-05-07 17:42:58,928 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 226 statements into 5 equivalence classes.
[2025-05-07 17:42:59,244 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 226 of 226 statements.
[2025-05-07 17:42:59,244 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2025-05-07 17:42:59,244 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:42:59,257 INFO  L256         TraceCheckSpWp]: Trace formula consists of 3165 conjuncts, 111 conjuncts are in the unsatisfiable core
[2025-05-07 17:42:59,261 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:42:59,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 264 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked.
[2025-05-07 17:42:59,843 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:43:44,942 INFO  L134       CoverageAnalysis]: Checked inductivity of 264 backedges. 46 proven. 101 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked.
[2025-05-07 17:43:44,942 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290527791] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:43:44,942 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:43:44,942 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 39, 68] total 112
[2025-05-07 17:43:44,942 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796084957]
[2025-05-07 17:43:44,942 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:43:44,942 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 112 states
[2025-05-07 17:43:44,942 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:43:44,943 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants.
[2025-05-07 17:43:44,944 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=11989, Unknown=0, NotChecked=0, Total=12432
[2025-05-07 17:43:44,944 INFO  L87              Difference]: Start difference. First operand 250 states and 484 transitions. Second operand  has 112 states, 71 states have (on average 1.6901408450704225) internal successors, (120), 88 states have internal predecessors, (120), 55 states have call successors, (80), 1 states have call predecessors, (80), 71 states have return successors, (120), 90 states have call predecessors, (120), 55 states have call successors, (120)
[2025-05-07 17:43:46,851 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:43:46,852 INFO  L93              Difference]: Finished difference Result 326 states and 753 transitions.
[2025-05-07 17:43:46,852 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. 
[2025-05-07 17:43:46,852 INFO  L79                 Accepts]: Start accepts. Automaton has  has 112 states, 71 states have (on average 1.6901408450704225) internal successors, (120), 88 states have internal predecessors, (120), 55 states have call successors, (80), 1 states have call predecessors, (80), 71 states have return successors, (120), 90 states have call predecessors, (120), 55 states have call successors, (120) Word has length 226
[2025-05-07 17:43:46,852 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:43:46,854 INFO  L225             Difference]: With dead ends: 326
[2025-05-07 17:43:46,854 INFO  L226             Difference]: Without dead ends: 326
[2025-05-07 17:43:46,855 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 398 SyntacticMatches, 17 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4642 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=567, Invalid=14933, Unknown=0, NotChecked=0, Total=15500
[2025-05-07 17:43:46,855 INFO  L437           NwaCegarLoop]: 96 mSDtfsCounter, 26 mSDsluCounter, 5329 mSDsCounter, 0 mSdLazyCounter, 3054 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 5425 SdHoareTripleChecker+Invalid, 3081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:43:46,855 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 5425 Invalid, 3081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3054 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-05-07 17:43:46,855 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 326 states.
[2025-05-07 17:43:46,872 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 262.
[2025-05-07 17:43:46,872 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 262 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 113 states have internal predecessors, (114), 61 states have call successors, (62), 27 states have call predecessors, (62), 92 states have return successors, (342), 121 states have call predecessors, (342), 61 states have call successors, (342)
[2025-05-07 17:43:46,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 518 transitions.
[2025-05-07 17:43:46,873 INFO  L79                 Accepts]: Start accepts. Automaton has 262 states and 518 transitions. Word has length 226
[2025-05-07 17:43:46,873 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:43:46,873 INFO  L485      AbstractCegarLoop]: Abstraction has 262 states and 518 transitions.
[2025-05-07 17:43:46,873 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 112 states, 71 states have (on average 1.6901408450704225) internal successors, (120), 88 states have internal predecessors, (120), 55 states have call successors, (80), 1 states have call predecessors, (80), 71 states have return successors, (120), 90 states have call predecessors, (120), 55 states have call successors, (120)
[2025-05-07 17:43:46,873 INFO  L278                IsEmpty]: Start isEmpty. Operand 262 states and 518 transitions.
[2025-05-07 17:43:46,874 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 173
[2025-05-07 17:43:46,874 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:43:46,875 INFO  L218           NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:43:46,920 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0
[2025-05-07 17:43:47,075 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,30 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:43:47,076 INFO  L403      AbstractCegarLoop]: === Iteration 39 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:43:47,076 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:43:47,077 INFO  L85        PathProgramCache]: Analyzing trace with hash -1075531418, now seen corresponding path program 4 times
[2025-05-07 17:43:47,077 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:43:47,077 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178728064]
[2025-05-07 17:43:47,077 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-05-07 17:43:47,077 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:43:47,266 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 172 statements into 2 equivalence classes.
[2025-05-07 17:43:47,275 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 172 of 172 statements.
[2025-05-07 17:43:47,276 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-05-07 17:43:47,276 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:43:47,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 132 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2025-05-07 17:43:47,386 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:43:47,386 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178728064]
[2025-05-07 17:43:47,386 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178728064] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:43:47,386 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:43:47,386 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-05-07 17:43:47,386 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625547977]
[2025-05-07 17:43:47,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:43:47,387 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-05-07 17:43:47,387 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:43:47,387 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-05-07 17:43:47,387 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:43:47,387 INFO  L87              Difference]: Start difference. First operand 262 states and 518 transitions. Second operand  has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (38), 6 states have call predecessors, (38), 4 states have call successors, (38)
[2025-05-07 17:43:47,428 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:43:47,428 INFO  L93              Difference]: Finished difference Result 280 states and 572 transitions.
[2025-05-07 17:43:47,428 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-05-07 17:43:47,428 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (38), 6 states have call predecessors, (38), 4 states have call successors, (38) Word has length 172
[2025-05-07 17:43:47,429 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:43:47,430 INFO  L225             Difference]: With dead ends: 280
[2025-05-07 17:43:47,430 INFO  L226             Difference]: Without dead ends: 280
[2025-05-07 17:43:47,430 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:43:47,430 INFO  L437           NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:43:47,430 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 648 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:43:47,430 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 280 states.
[2025-05-07 17:43:47,440 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280.
[2025-05-07 17:43:47,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 280 states, 119 states have (on average 1.0336134453781514) internal successors, (123), 122 states have internal predecessors, (123), 61 states have call successors, (62), 27 states have call predecessors, (62), 101 states have return successors, (387), 130 states have call predecessors, (387), 61 states have call successors, (387)
[2025-05-07 17:43:47,441 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 572 transitions.
[2025-05-07 17:43:47,441 INFO  L79                 Accepts]: Start accepts. Automaton has 280 states and 572 transitions. Word has length 172
[2025-05-07 17:43:47,441 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:43:47,441 INFO  L485      AbstractCegarLoop]: Abstraction has 280 states and 572 transitions.
[2025-05-07 17:43:47,441 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 8.5) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (34), 1 states have call predecessors, (34), 6 states have return successors, (38), 6 states have call predecessors, (38), 4 states have call successors, (38)
[2025-05-07 17:43:47,441 INFO  L278                IsEmpty]: Start isEmpty. Operand 280 states and 572 transitions.
[2025-05-07 17:43:47,442 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2025-05-07 17:43:47,442 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:43:47,442 INFO  L218           NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:43:47,442 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2025-05-07 17:43:47,442 INFO  L403      AbstractCegarLoop]: === Iteration 40 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:43:47,442 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:43:47,443 INFO  L85        PathProgramCache]: Analyzing trace with hash 2035260025, now seen corresponding path program 1 times
[2025-05-07 17:43:47,443 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:43:47,443 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092920823]
[2025-05-07 17:43:47,443 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:43:47,443 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:43:47,592 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-05-07 17:43:47,600 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-05-07 17:43:47,601 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:43:47,601 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:43:47,773 INFO  L134       CoverageAnalysis]: Checked inductivity of 109 backedges. 30 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked.
[2025-05-07 17:43:47,774 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:43:47,774 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092920823]
[2025-05-07 17:43:47,774 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092920823] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:43:47,774 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515642864]
[2025-05-07 17:43:47,774 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:43:47,774 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:43:47,776 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:43:47,777 INFO  L229       MonitoredProcess]: Starting monitored process 31 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:43:47,778 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process
[2025-05-07 17:43:54,227 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-05-07 17:43:54,419 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-05-07 17:43:54,419 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:43:54,419 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:43:54,425 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2026 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-05-07 17:43:54,427 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:43:54,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 109 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked.
[2025-05-07 17:43:54,471 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:43:54,471 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [515642864] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:43:54,471 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:43:54,471 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16
[2025-05-07 17:43:54,471 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711638345]
[2025-05-07 17:43:54,471 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:43:54,472 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:43:54,472 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:43:54,472 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:43:54,472 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240
[2025-05-07 17:43:54,472 INFO  L87              Difference]: Start difference. First operand 280 states and 572 transitions. Second operand  has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (30), 2 states have call predecessors, (30), 7 states have return successors, (35), 8 states have call predecessors, (35), 4 states have call successors, (35)
[2025-05-07 17:43:54,533 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:43:54,533 INFO  L93              Difference]: Finished difference Result 263 states and 536 transitions.
[2025-05-07 17:43:54,533 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:43:54,533 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (30), 2 states have call predecessors, (30), 7 states have return successors, (35), 8 states have call predecessors, (35), 4 states have call successors, (35) Word has length 147
[2025-05-07 17:43:54,533 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:43:54,534 INFO  L225             Difference]: With dead ends: 263
[2025-05-07 17:43:54,534 INFO  L226             Difference]: Without dead ends: 263
[2025-05-07 17:43:54,534 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240
[2025-05-07 17:43:54,535 INFO  L437           NwaCegarLoop]: 113 mSDtfsCounter, 3 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:43:54,535 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 759 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:43:54,535 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 263 states.
[2025-05-07 17:43:54,549 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262.
[2025-05-07 17:43:54,549 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 262 states, 110 states have (on average 1.0363636363636364) internal successors, (114), 113 states have internal predecessors, (114), 61 states have call successors, (62), 27 states have call predecessors, (62), 92 states have return successors, (323), 121 states have call predecessors, (323), 61 states have call successors, (323)
[2025-05-07 17:43:54,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 499 transitions.
[2025-05-07 17:43:54,550 INFO  L79                 Accepts]: Start accepts. Automaton has 262 states and 499 transitions. Word has length 147
[2025-05-07 17:43:54,550 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:43:54,550 INFO  L485      AbstractCegarLoop]: Abstraction has 262 states and 499 transitions.
[2025-05-07 17:43:54,550 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 6.714285714285714) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (30), 2 states have call predecessors, (30), 7 states have return successors, (35), 8 states have call predecessors, (35), 4 states have call successors, (35)
[2025-05-07 17:43:54,550 INFO  L278                IsEmpty]: Start isEmpty. Operand 262 states and 499 transitions.
[2025-05-07 17:43:54,551 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 195
[2025-05-07 17:43:54,551 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:43:54,551 INFO  L218           NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:43:54,597 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0
[2025-05-07 17:43:54,752 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,31 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:43:54,752 INFO  L403      AbstractCegarLoop]: === Iteration 41 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:43:54,752 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:43:54,752 INFO  L85        PathProgramCache]: Analyzing trace with hash -829588312, now seen corresponding path program 1 times
[2025-05-07 17:43:54,752 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:43:54,752 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141095622]
[2025-05-07 17:43:54,752 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:43:54,752 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:43:54,924 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.
[2025-05-07 17:43:54,936 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements.
[2025-05-07 17:43:54,936 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:43:54,936 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:43:56,871 INFO  L134       CoverageAnalysis]: Checked inductivity of 173 backedges. 2 proven. 59 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked.
[2025-05-07 17:43:56,871 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:43:56,871 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141095622]
[2025-05-07 17:43:56,871 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141095622] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:43:56,871 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111997973]
[2025-05-07 17:43:56,871 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:43:56,872 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:43:56,873 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:43:56,874 INFO  L229       MonitoredProcess]: Starting monitored process 32 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:43:56,875 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process
[2025-05-07 17:44:03,085 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes.
[2025-05-07 17:44:03,285 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements.
[2025-05-07 17:44:03,285 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:44:03,285 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:44:03,295 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2721 conjuncts, 94 conjuncts are in the unsatisfiable core
[2025-05-07 17:44:03,298 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:44:03,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked.
[2025-05-07 17:44:03,678 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:44:35,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 173 backedges. 32 proven. 57 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-05-07 17:44:35,678 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111997973] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:44:35,678 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:44:35,679 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 37, 57] total 99
[2025-05-07 17:44:35,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357551723]
[2025-05-07 17:44:35,679 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:44:35,680 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 99 states
[2025-05-07 17:44:35,680 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:44:35,680 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants.
[2025-05-07 17:44:35,681 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=9348, Unknown=0, NotChecked=0, Total=9702
[2025-05-07 17:44:35,681 INFO  L87              Difference]: Start difference. First operand 262 states and 499 transitions. Second operand  has 99 states, 61 states have (on average 1.721311475409836) internal successors, (105), 77 states have internal predecessors, (105), 51 states have call successors, (70), 1 states have call predecessors, (70), 61 states have return successors, (106), 80 states have call predecessors, (106), 51 states have call successors, (106)
[2025-05-07 17:44:37,490 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:44:37,490 INFO  L93              Difference]: Finished difference Result 328 states and 705 transitions.
[2025-05-07 17:44:37,490 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. 
[2025-05-07 17:44:37,490 INFO  L79                 Accepts]: Start accepts. Automaton has  has 99 states, 61 states have (on average 1.721311475409836) internal successors, (105), 77 states have internal predecessors, (105), 51 states have call successors, (70), 1 states have call predecessors, (70), 61 states have return successors, (106), 80 states have call predecessors, (106), 51 states have call successors, (106) Word has length 194
[2025-05-07 17:44:37,490 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:44:37,492 INFO  L225             Difference]: With dead ends: 328
[2025-05-07 17:44:37,492 INFO  L226             Difference]: Without dead ends: 328
[2025-05-07 17:44:37,492 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 336 SyntacticMatches, 17 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3242 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=486, Invalid=12396, Unknown=0, NotChecked=0, Total=12882
[2025-05-07 17:44:37,493 INFO  L437           NwaCegarLoop]: 95 mSDtfsCounter, 20 mSDsluCounter, 5003 mSDsCounter, 0 mSdLazyCounter, 3017 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 5098 SdHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:44:37,493 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 5098 Invalid, 3050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3017 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-05-07 17:44:37,493 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 328 states.
[2025-05-07 17:44:37,510 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 268.
[2025-05-07 17:44:37,510 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 268 states, 113 states have (on average 1.0353982300884956) internal successors, (117), 116 states have internal predecessors, (117), 61 states have call successors, (62), 27 states have call predecessors, (62), 95 states have return successors, (344), 124 states have call predecessors, (344), 61 states have call successors, (344)
[2025-05-07 17:44:37,511 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 523 transitions.
[2025-05-07 17:44:37,511 INFO  L79                 Accepts]: Start accepts. Automaton has 268 states and 523 transitions. Word has length 194
[2025-05-07 17:44:37,511 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:44:37,511 INFO  L485      AbstractCegarLoop]: Abstraction has 268 states and 523 transitions.
[2025-05-07 17:44:37,511 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 99 states, 61 states have (on average 1.721311475409836) internal successors, (105), 77 states have internal predecessors, (105), 51 states have call successors, (70), 1 states have call predecessors, (70), 61 states have return successors, (106), 80 states have call predecessors, (106), 51 states have call successors, (106)
[2025-05-07 17:44:37,511 INFO  L278                IsEmpty]: Start isEmpty. Operand 268 states and 523 transitions.
[2025-05-07 17:44:37,513 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 291
[2025-05-07 17:44:37,513 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:44:37,513 INFO  L218           NwaCegarLoop]: trace histogram [11, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:44:37,560 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0
[2025-05-07 17:44:37,713 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41
[2025-05-07 17:44:37,714 INFO  L403      AbstractCegarLoop]: === Iteration 42 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:44:37,714 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:44:37,715 INFO  L85        PathProgramCache]: Analyzing trace with hash 301346246, now seen corresponding path program 3 times
[2025-05-07 17:44:37,715 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:44:37,715 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16931892]
[2025-05-07 17:44:37,715 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:44:37,715 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:44:37,946 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 290 statements into 7 equivalence classes.
[2025-05-07 17:44:38,051 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 290 of 290 statements.
[2025-05-07 17:44:38,051 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s)
[2025-05-07 17:44:38,051 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:44:42,193 INFO  L134       CoverageAnalysis]: Checked inductivity of 572 backedges. 12 proven. 192 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked.
[2025-05-07 17:44:42,193 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:44:42,193 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16931892]
[2025-05-07 17:44:42,193 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16931892] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:44:42,194 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286884863]
[2025-05-07 17:44:42,194 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:44:42,194 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:44:42,195 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:44:42,197 INFO  L229       MonitoredProcess]: Starting monitored process 33 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:44:42,197 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process
[2025-05-07 17:44:49,719 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 290 statements into 7 equivalence classes.
[2025-05-07 17:44:50,123 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 290 of 290 statements.
[2025-05-07 17:44:50,124 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s)
[2025-05-07 17:44:50,124 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:44:50,140 INFO  L256         TraceCheckSpWp]: Trace formula consists of 4053 conjuncts, 145 conjuncts are in the unsatisfiable core
[2025-05-07 17:44:50,146 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:44:50,786 INFO  L134       CoverageAnalysis]: Checked inductivity of 572 backedges. 6 proven. 140 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked.
[2025-05-07 17:44:50,786 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:46:18,853 INFO  L134       CoverageAnalysis]: Checked inductivity of 572 backedges. 108 proven. 217 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked.
[2025-05-07 17:46:18,853 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286884863] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:46:18,853 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:46:18,854 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 42, 85] total 138
[2025-05-07 17:46:18,854 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987895686]
[2025-05-07 17:46:18,854 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:46:18,854 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 138 states
[2025-05-07 17:46:18,854 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:46:18,855 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants.
[2025-05-07 17:46:18,856 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=18270, Unknown=0, NotChecked=0, Total=18906
[2025-05-07 17:46:18,856 INFO  L87              Difference]: Start difference. First operand 268 states and 523 transitions. Second operand  has 138 states, 90 states have (on average 1.5888888888888888) internal successors, (143), 110 states have internal predecessors, (143), 63 states have call successors, (88), 1 states have call predecessors, (88), 90 states have return successors, (148), 116 states have call predecessors, (148), 63 states have call successors, (148)
[2025-05-07 17:46:21,628 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:46:21,628 INFO  L93              Difference]: Finished difference Result 341 states and 767 transitions.
[2025-05-07 17:46:21,628 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. 
[2025-05-07 17:46:21,628 INFO  L79                 Accepts]: Start accepts. Automaton has  has 138 states, 90 states have (on average 1.5888888888888888) internal successors, (143), 110 states have internal predecessors, (143), 63 states have call successors, (88), 1 states have call predecessors, (88), 90 states have return successors, (148), 116 states have call predecessors, (148), 63 states have call successors, (148) Word has length 290
[2025-05-07 17:46:21,629 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:46:21,630 INFO  L225             Difference]: With dead ends: 341
[2025-05-07 17:46:21,630 INFO  L226             Difference]: Without dead ends: 341
[2025-05-07 17:46:21,632 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 697 GetRequests, 522 SyntacticMatches, 17 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8140 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=920, Invalid=24520, Unknown=0, NotChecked=0, Total=25440
[2025-05-07 17:46:21,632 INFO  L437           NwaCegarLoop]: 97 mSDtfsCounter, 44 mSDsluCounter, 5869 mSDsCounter, 0 mSdLazyCounter, 3659 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 5966 SdHoareTripleChecker+Invalid, 3708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:46:21,632 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 5966 Invalid, 3708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3659 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-05-07 17:46:21,633 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 341 states.
[2025-05-07 17:46:21,653 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 222.
[2025-05-07 17:46:21,654 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 222 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 97 states have internal predecessors, (98), 53 states have call successors, (54), 27 states have call predecessors, (54), 76 states have return successors, (252), 97 states have call predecessors, (252), 53 states have call successors, (252)
[2025-05-07 17:46:21,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 404 transitions.
[2025-05-07 17:46:21,654 INFO  L79                 Accepts]: Start accepts. Automaton has 222 states and 404 transitions. Word has length 290
[2025-05-07 17:46:21,655 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:46:21,655 INFO  L485      AbstractCegarLoop]: Abstraction has 222 states and 404 transitions.
[2025-05-07 17:46:21,655 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 138 states, 90 states have (on average 1.5888888888888888) internal successors, (143), 110 states have internal predecessors, (143), 63 states have call successors, (88), 1 states have call predecessors, (88), 90 states have return successors, (148), 116 states have call predecessors, (148), 63 states have call successors, (148)
[2025-05-07 17:46:21,655 INFO  L278                IsEmpty]: Start isEmpty. Operand 222 states and 404 transitions.
[2025-05-07 17:46:21,656 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 280
[2025-05-07 17:46:21,656 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:46:21,656 INFO  L218           NwaCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:21,709 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0
[2025-05-07 17:46:21,856 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,33 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:46:21,856 INFO  L403      AbstractCegarLoop]: === Iteration 43 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:46:21,857 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:46:21,857 INFO  L85        PathProgramCache]: Analyzing trace with hash 1747794711, now seen corresponding path program 3 times
[2025-05-07 17:46:21,857 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:46:21,857 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126688351]
[2025-05-07 17:46:21,857 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:46:21,857 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:46:22,064 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 279 statements into 5 equivalence classes.
[2025-05-07 17:46:22,141 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 279 of 279 statements.
[2025-05-07 17:46:22,141 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2025-05-07 17:46:22,141 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:46:26,163 INFO  L134       CoverageAnalysis]: Checked inductivity of 461 backedges. 51 proven. 107 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked.
[2025-05-07 17:46:26,163 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:46:26,163 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126688351]
[2025-05-07 17:46:26,163 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126688351] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:46:26,163 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580936756]
[2025-05-07 17:46:26,163 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:46:26,163 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:46:26,165 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:46:26,166 INFO  L229       MonitoredProcess]: Starting monitored process 34 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:46:26,167 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process
[2025-05-07 17:46:33,392 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 279 statements into 5 equivalence classes.
[2025-05-07 17:46:33,737 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 279 of 279 statements.
[2025-05-07 17:46:33,737 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2025-05-07 17:46:33,737 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:46:33,753 INFO  L256         TraceCheckSpWp]: Trace formula consists of 3997 conjuncts, 144 conjuncts are in the unsatisfiable core
[2025-05-07 17:46:33,758 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:46:34,407 INFO  L134       CoverageAnalysis]: Checked inductivity of 461 backedges. 12 proven. 52 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked.
[2025-05-07 17:46:34,407 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:47:53,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 461 backedges. 93 proven. 157 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked.
[2025-05-07 17:47:53,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580936756] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:47:53,491 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:47:53,491 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 36, 85] total 135
[2025-05-07 17:47:53,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696743997]
[2025-05-07 17:47:53,491 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:47:53,492 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 135 states
[2025-05-07 17:47:53,492 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:47:53,493 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants.
[2025-05-07 17:47:53,494 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=17438, Unknown=0, NotChecked=0, Total=18090
[2025-05-07 17:47:53,495 INFO  L87              Difference]: Start difference. First operand 222 states and 404 transitions. Second operand  has 135 states, 86 states have (on average 1.627906976744186) internal successors, (140), 109 states have internal predecessors, (140), 66 states have call successors, (87), 1 states have call predecessors, (87), 86 states have return successors, (135), 107 states have call predecessors, (135), 66 states have call successors, (135)
[2025-05-07 17:47:55,815 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:47:55,816 INFO  L93              Difference]: Finished difference Result 372 states and 1037 transitions.
[2025-05-07 17:47:55,816 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. 
[2025-05-07 17:47:55,816 INFO  L79                 Accepts]: Start accepts. Automaton has  has 135 states, 86 states have (on average 1.627906976744186) internal successors, (140), 109 states have internal predecessors, (140), 66 states have call successors, (87), 1 states have call predecessors, (87), 86 states have return successors, (135), 107 states have call predecessors, (135), 66 states have call successors, (135) Word has length 279
[2025-05-07 17:47:55,816 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:47:55,818 INFO  L225             Difference]: With dead ends: 372
[2025-05-07 17:47:55,818 INFO  L226             Difference]: Without dead ends: 372
[2025-05-07 17:47:55,820 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 496 SyntacticMatches, 20 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8037 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=910, Invalid=22960, Unknown=0, NotChecked=0, Total=23870
[2025-05-07 17:47:55,820 INFO  L437           NwaCegarLoop]: 91 mSDtfsCounter, 36 mSDsluCounter, 5411 mSDsCounter, 0 mSdLazyCounter, 3085 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 5502 SdHoareTripleChecker+Invalid, 3129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 3085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:47:55,820 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 5502 Invalid, 3129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 3085 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-05-07 17:47:55,820 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 372 states.
[2025-05-07 17:47:55,876 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 273.
[2025-05-07 17:47:55,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 273 states, 117 states have (on average 1.0341880341880343) internal successors, (121), 120 states have internal predecessors, (121), 58 states have call successors, (59), 27 states have call predecessors, (59), 99 states have return successors, (393), 125 states have call predecessors, (393), 58 states have call successors, (393)
[2025-05-07 17:47:55,877 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 573 transitions.
[2025-05-07 17:47:55,877 INFO  L79                 Accepts]: Start accepts. Automaton has 273 states and 573 transitions. Word has length 279
[2025-05-07 17:47:55,877 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:47:55,877 INFO  L485      AbstractCegarLoop]: Abstraction has 273 states and 573 transitions.
[2025-05-07 17:47:55,878 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 135 states, 86 states have (on average 1.627906976744186) internal successors, (140), 109 states have internal predecessors, (140), 66 states have call successors, (87), 1 states have call predecessors, (87), 86 states have return successors, (135), 107 states have call predecessors, (135), 66 states have call successors, (135)
[2025-05-07 17:47:55,878 INFO  L278                IsEmpty]: Start isEmpty. Operand 273 states and 573 transitions.
[2025-05-07 17:47:55,879 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-05-07 17:47:55,879 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:47:55,879 INFO  L218           NwaCegarLoop]: trace histogram [7, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:47:55,939 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0
[2025-05-07 17:47:56,080 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43
[2025-05-07 17:47:56,080 INFO  L403      AbstractCegarLoop]: === Iteration 44 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:47:56,081 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:47:56,081 INFO  L85        PathProgramCache]: Analyzing trace with hash 1349086108, now seen corresponding path program 2 times
[2025-05-07 17:47:56,081 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:47:56,082 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749008647]
[2025-05-07 17:47:56,082 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:47:56,082 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:47:56,334 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 254 statements into 2 equivalence classes.
[2025-05-07 17:47:56,352 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 254 of 254 statements.
[2025-05-07 17:47:56,353 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:47:56,353 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:47:59,235 INFO  L134       CoverageAnalysis]: Checked inductivity of 350 backedges. 24 proven. 89 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked.
[2025-05-07 17:47:59,235 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:47:59,235 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749008647]
[2025-05-07 17:47:59,235 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749008647] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:47:59,235 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773449508]
[2025-05-07 17:47:59,235 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:47:59,235 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:47:59,237 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:47:59,238 INFO  L229       MonitoredProcess]: Starting monitored process 35 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:47:59,239 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process
[2025-05-07 17:48:07,101 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 254 statements into 2 equivalence classes.
[2025-05-07 17:48:07,443 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 254 of 254 statements.
[2025-05-07 17:48:07,443 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:48:07,443 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:48:07,457 INFO  L256         TraceCheckSpWp]: Trace formula consists of 3608 conjuncts, 130 conjuncts are in the unsatisfiable core
[2025-05-07 17:48:07,462 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:48:07,866 INFO  L134       CoverageAnalysis]: Checked inductivity of 350 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked.
[2025-05-07 17:48:07,866 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:49:13,870 INFO  L134       CoverageAnalysis]: Checked inductivity of 350 backedges. 19 proven. 119 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked.
[2025-05-07 17:49:13,870 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [773449508] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:49:13,870 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:49:13,870 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 37, 60] total 104
[2025-05-07 17:49:13,870 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995576289]
[2025-05-07 17:49:13,871 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:49:13,871 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 104 states
[2025-05-07 17:49:13,871 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:49:13,872 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants.
[2025-05-07 17:49:13,873 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=402, Invalid=10310, Unknown=0, NotChecked=0, Total=10712
[2025-05-07 17:49:13,873 INFO  L87              Difference]: Start difference. First operand 273 states and 573 transitions. Second operand  has 104 states, 64 states have (on average 1.71875) internal successors, (110), 82 states have internal predecessors, (110), 53 states have call successors, (75), 1 states have call predecessors, (75), 64 states have return successors, (115), 84 states have call predecessors, (115), 53 states have call successors, (115)
[2025-05-07 17:49:15,572 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:49:15,572 INFO  L93              Difference]: Finished difference Result 380 states and 1039 transitions.
[2025-05-07 17:49:15,572 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. 
[2025-05-07 17:49:15,572 INFO  L79                 Accepts]: Start accepts. Automaton has  has 104 states, 64 states have (on average 1.71875) internal successors, (110), 82 states have internal predecessors, (110), 53 states have call successors, (75), 1 states have call predecessors, (75), 64 states have return successors, (115), 84 states have call predecessors, (115), 53 states have call successors, (115) Word has length 254
[2025-05-07 17:49:15,573 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:49:15,575 INFO  L225             Difference]: With dead ends: 380
[2025-05-07 17:49:15,575 INFO  L226             Difference]: Without dead ends: 380
[2025-05-07 17:49:15,575 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 468 SyntacticMatches, 19 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4518 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=583, Invalid=13697, Unknown=0, NotChecked=0, Total=14280
[2025-05-07 17:49:15,576 INFO  L437           NwaCegarLoop]: 92 mSDtfsCounter, 34 mSDsluCounter, 4424 mSDsCounter, 0 mSdLazyCounter, 2560 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4516 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:49:15,576 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4516 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2560 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-05-07 17:49:15,576 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 380 states.
[2025-05-07 17:49:15,621 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 320.
[2025-05-07 17:49:15,621 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 320 states, 139 states have (on average 1.0287769784172662) internal successors, (143), 142 states have internal predecessors, (143), 61 states have call successors, (62), 27 states have call predecessors, (62), 121 states have return successors, (530), 150 states have call predecessors, (530), 61 states have call successors, (530)
[2025-05-07 17:49:15,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 735 transitions.
[2025-05-07 17:49:15,623 INFO  L79                 Accepts]: Start accepts. Automaton has 320 states and 735 transitions. Word has length 254
[2025-05-07 17:49:15,623 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:49:15,623 INFO  L485      AbstractCegarLoop]: Abstraction has 320 states and 735 transitions.
[2025-05-07 17:49:15,623 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 104 states, 64 states have (on average 1.71875) internal successors, (110), 82 states have internal predecessors, (110), 53 states have call successors, (75), 1 states have call predecessors, (75), 64 states have return successors, (115), 84 states have call predecessors, (115), 53 states have call successors, (115)
[2025-05-07 17:49:15,623 INFO  L278                IsEmpty]: Start isEmpty. Operand 320 states and 735 transitions.
[2025-05-07 17:49:15,625 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 323
[2025-05-07 17:49:15,625 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:49:15,625 INFO  L218           NwaCegarLoop]: trace histogram [12, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:49:15,686 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0
[2025-05-07 17:49:15,825 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44
[2025-05-07 17:49:15,826 INFO  L403      AbstractCegarLoop]: === Iteration 45 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:49:15,826 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:49:15,826 INFO  L85        PathProgramCache]: Analyzing trace with hash 279559198, now seen corresponding path program 4 times
[2025-05-07 17:49:15,826 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:49:15,826 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528376920]
[2025-05-07 17:49:15,826 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-05-07 17:49:15,826 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:49:16,069 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 322 statements into 2 equivalence classes.
[2025-05-07 17:49:16,090 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 322 of 322 statements.
[2025-05-07 17:49:16,090 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-05-07 17:49:16,090 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:49:20,604 INFO  L134       CoverageAnalysis]: Checked inductivity of 757 backedges. 39 proven. 196 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked.
[2025-05-07 17:49:20,604 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:49:20,604 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528376920]
[2025-05-07 17:49:20,604 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528376920] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:49:20,604 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078941446]
[2025-05-07 17:49:20,604 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-05-07 17:49:20,604 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:49:20,606 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:49:20,607 INFO  L229       MonitoredProcess]: Starting monitored process 36 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:49:20,608 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process
[2025-05-07 17:49:28,281 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 322 statements into 2 equivalence classes.
[2025-05-07 17:49:28,618 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 322 of 322 statements.
[2025-05-07 17:49:28,618 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-05-07 17:49:28,618 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:49:28,635 INFO  L256         TraceCheckSpWp]: Trace formula consists of 4490 conjuncts, 161 conjuncts are in the unsatisfiable core
[2025-05-07 17:49:28,641 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:49:29,354 INFO  L134       CoverageAnalysis]: Checked inductivity of 757 backedges. 39 proven. 158 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked.
[2025-05-07 17:49:29,354 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:51:12,692 INFO  L134       CoverageAnalysis]: Checked inductivity of 757 backedges. 161 proven. 268 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked.
[2025-05-07 17:51:12,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078941446] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:51:12,692 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:51:12,693 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 43, 92] total 149
[2025-05-07 17:51:12,693 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376683997]
[2025-05-07 17:51:12,693 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:51:12,693 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 149 states
[2025-05-07 17:51:12,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:51:12,694 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants.
[2025-05-07 17:51:12,696 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=748, Invalid=21304, Unknown=0, NotChecked=0, Total=22052
[2025-05-07 17:51:12,696 INFO  L87              Difference]: Start difference. First operand 320 states and 735 transitions. Second operand  has 149 states, 96 states have (on average 1.5520833333333333) internal successors, (149), 117 states have internal predecessors, (149), 67 states have call successors, (93), 1 states have call predecessors, (93), 96 states have return successors, (160), 128 states have call predecessors, (160), 67 states have call successors, (160)
[2025-05-07 17:51:15,758 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:51:15,758 INFO  L93              Difference]: Finished difference Result 376 states and 1030 transitions.
[2025-05-07 17:51:15,759 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. 
[2025-05-07 17:51:15,759 INFO  L79                 Accepts]: Start accepts. Automaton has  has 149 states, 96 states have (on average 1.5520833333333333) internal successors, (149), 117 states have internal predecessors, (149), 67 states have call successors, (93), 1 states have call predecessors, (93), 96 states have return successors, (160), 128 states have call predecessors, (160), 67 states have call successors, (160) Word has length 322
[2025-05-07 17:51:15,760 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:51:15,762 INFO  L225             Difference]: With dead ends: 376
[2025-05-07 17:51:15,762 INFO  L226             Difference]: Without dead ends: 376
[2025-05-07 17:51:15,763 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 769 GetRequests, 581 SyntacticMatches, 18 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10646 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=1064, Invalid=28348, Unknown=0, NotChecked=0, Total=29412
[2025-05-07 17:51:15,763 INFO  L437           NwaCegarLoop]: 97 mSDtfsCounter, 34 mSDsluCounter, 6592 mSDsCounter, 0 mSdLazyCounter, 4113 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 6689 SdHoareTripleChecker+Invalid, 4158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 4113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:51:15,764 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 6689 Invalid, 4158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 4113 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-05-07 17:51:15,764 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 376 states.
[2025-05-07 17:51:15,805 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 300.
[2025-05-07 17:51:15,805 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 300 states, 130 states have (on average 1.0307692307692307) internal successors, (134), 133 states have internal predecessors, (134), 59 states have call successors, (60), 27 states have call predecessors, (60), 112 states have return successors, (462), 139 states have call predecessors, (462), 59 states have call successors, (462)
[2025-05-07 17:51:15,806 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 656 transitions.
[2025-05-07 17:51:15,806 INFO  L79                 Accepts]: Start accepts. Automaton has 300 states and 656 transitions. Word has length 322
[2025-05-07 17:51:15,806 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:51:15,806 INFO  L485      AbstractCegarLoop]: Abstraction has 300 states and 656 transitions.
[2025-05-07 17:51:15,807 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 149 states, 96 states have (on average 1.5520833333333333) internal successors, (149), 117 states have internal predecessors, (149), 67 states have call successors, (93), 1 states have call predecessors, (93), 96 states have return successors, (160), 128 states have call predecessors, (160), 67 states have call successors, (160)
[2025-05-07 17:51:15,807 INFO  L278                IsEmpty]: Start isEmpty. Operand 300 states and 656 transitions.
[2025-05-07 17:51:15,809 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 351
[2025-05-07 17:51:15,809 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:51:15,809 INFO  L218           NwaCegarLoop]: trace histogram [13, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:51:15,876 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0
[2025-05-07 17:51:16,009 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45
[2025-05-07 17:51:16,009 INFO  L403      AbstractCegarLoop]: === Iteration 46 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:51:16,009 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:51:16,010 INFO  L85        PathProgramCache]: Analyzing trace with hash -1214925958, now seen corresponding path program 5 times
[2025-05-07 17:51:16,010 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:51:16,010 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297951026]
[2025-05-07 17:51:16,010 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-05-07 17:51:16,010 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:51:16,287 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 350 statements into 8 equivalence classes.
[2025-05-07 17:51:16,502 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 350 of 350 statements.
[2025-05-07 17:51:16,503 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s)
[2025-05-07 17:51:16,503 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:51:22,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 884 backedges. 55 proven. 196 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked.
[2025-05-07 17:51:22,380 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:51:22,380 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297951026]
[2025-05-07 17:51:22,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297951026] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:51:22,380 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043884086]
[2025-05-07 17:51:22,380 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-05-07 17:51:22,380 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:51:22,382 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:51:22,383 INFO  L229       MonitoredProcess]: Starting monitored process 37 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:51:22,384 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process
[2025-05-07 17:51:31,216 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 350 statements into 8 equivalence classes.
[2025-05-07 17:51:31,643 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 350 of 350 statements.
[2025-05-07 17:51:31,643 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s)
[2025-05-07 17:51:31,643 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:51:31,663 INFO  L256         TraceCheckSpWp]: Trace formula consists of 4940 conjuncts, 181 conjuncts are in the unsatisfiable core
[2025-05-07 17:51:31,670 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:51:32,438 INFO  L134       CoverageAnalysis]: Checked inductivity of 884 backedges. 55 proven. 140 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked.
[2025-05-07 17:51:32,438 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:53:35,718 INFO  L134       CoverageAnalysis]: Checked inductivity of 884 backedges. 146 proven. 351 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked.
[2025-05-07 17:53:35,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043884086] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:53:35,718 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:53:35,718 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 40, 100] total 148
[2025-05-07 17:53:35,718 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675161054]
[2025-05-07 17:53:35,718 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:53:35,719 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 148 states
[2025-05-07 17:53:35,719 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:53:35,719 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants.
[2025-05-07 17:53:35,720 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=20991, Unknown=0, NotChecked=0, Total=21756
[2025-05-07 17:53:35,720 INFO  L87              Difference]: Start difference. First operand 300 states and 656 transitions. Second operand  has 148 states, 94 states have (on average 1.5638297872340425) internal successors, (147), 116 states have internal predecessors, (147), 69 states have call successors, (94), 1 states have call predecessors, (94), 94 states have return successors, (159), 127 states have call predecessors, (159), 69 states have call successors, (159)
[2025-05-07 17:53:38,318 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:53:38,319 INFO  L93              Difference]: Finished difference Result 363 states and 882 transitions.
[2025-05-07 17:53:38,319 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. 
[2025-05-07 17:53:38,319 INFO  L79                 Accepts]: Start accepts. Automaton has  has 148 states, 94 states have (on average 1.5638297872340425) internal successors, (147), 116 states have internal predecessors, (147), 69 states have call successors, (94), 1 states have call predecessors, (94), 94 states have return successors, (159), 127 states have call predecessors, (159), 69 states have call successors, (159) Word has length 350
[2025-05-07 17:53:38,320 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:53:38,321 INFO  L225             Difference]: With dead ends: 363
[2025-05-07 17:53:38,321 INFO  L226             Difference]: Without dead ends: 363
[2025-05-07 17:53:38,323 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 638 SyntacticMatches, 26 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12190 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1040, Invalid=26682, Unknown=0, NotChecked=0, Total=27722
[2025-05-07 17:53:38,323 INFO  L437           NwaCegarLoop]: 93 mSDtfsCounter, 37 mSDsluCounter, 5822 mSDsCounter, 0 mSdLazyCounter, 3929 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 5915 SdHoareTripleChecker+Invalid, 3969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 3929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:53:38,323 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 5915 Invalid, 3969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 3929 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-05-07 17:53:38,323 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 363 states.
[2025-05-07 17:53:38,358 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 247.
[2025-05-07 17:53:38,358 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 247 states, 105 states have (on average 1.0380952380952382) internal successors, (109), 108 states have internal predecessors, (109), 56 states have call successors, (57), 27 states have call predecessors, (57), 87 states have return successors, (287), 111 states have call predecessors, (287), 56 states have call successors, (287)
[2025-05-07 17:53:38,359 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 453 transitions.
[2025-05-07 17:53:38,359 INFO  L79                 Accepts]: Start accepts. Automaton has 247 states and 453 transitions. Word has length 350
[2025-05-07 17:53:38,359 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:53:38,359 INFO  L485      AbstractCegarLoop]: Abstraction has 247 states and 453 transitions.
[2025-05-07 17:53:38,359 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 148 states, 94 states have (on average 1.5638297872340425) internal successors, (147), 116 states have internal predecessors, (147), 69 states have call successors, (94), 1 states have call predecessors, (94), 94 states have return successors, (159), 127 states have call predecessors, (159), 69 states have call successors, (159)
[2025-05-07 17:53:38,359 INFO  L278                IsEmpty]: Start isEmpty. Operand 247 states and 453 transitions.
[2025-05-07 17:53:38,360 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 287
[2025-05-07 17:53:38,360 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:53:38,360 INFO  L218           NwaCegarLoop]: trace histogram [9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:38,435 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0
[2025-05-07 17:53:38,561 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,37 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:53:38,561 INFO  L403      AbstractCegarLoop]: === Iteration 47 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:53:38,562 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:53:38,562 INFO  L85        PathProgramCache]: Analyzing trace with hash 813645424, now seen corresponding path program 3 times
[2025-05-07 17:53:38,562 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:53:38,563 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929362289]
[2025-05-07 17:53:38,563 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:53:38,563 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:53:38,835 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 286 statements into 5 equivalence classes.
[2025-05-07 17:53:38,925 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 286 of 286 statements.
[2025-05-07 17:53:38,925 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2025-05-07 17:53:38,925 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:53:42,976 INFO  L134       CoverageAnalysis]: Checked inductivity of 490 backedges. 12 proven. 135 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked.
[2025-05-07 17:53:42,976 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:53:42,976 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929362289]
[2025-05-07 17:53:42,976 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929362289] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:53:42,976 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374499432]
[2025-05-07 17:53:42,976 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:53:42,976 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:53:42,978 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:53:42,980 INFO  L229       MonitoredProcess]: Starting monitored process 38 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:53:42,980 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process
[2025-05-07 17:53:51,733 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 286 statements into 5 equivalence classes.
[2025-05-07 17:53:52,042 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 286 of 286 statements.
[2025-05-07 17:53:52,042 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2025-05-07 17:53:52,042 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:53:52,059 INFO  L256         TraceCheckSpWp]: Trace formula consists of 4052 conjuncts, 147 conjuncts are in the unsatisfiable core
[2025-05-07 17:53:52,064 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:53:52,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 490 backedges. 6 proven. 96 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked.
[2025-05-07 17:53:52,541 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:55:36,891 INFO  L134       CoverageAnalysis]: Checked inductivity of 490 backedges. 107 proven. 164 refuted. 0 times theorem prover too weak. 219 trivial. 0 not checked.
[2025-05-07 17:55:36,891 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374499432] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:55:36,892 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:55:36,892 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 40, 85] total 133
[2025-05-07 17:55:36,892 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75534570]
[2025-05-07 17:55:36,892 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:55:36,893 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 133 states
[2025-05-07 17:55:36,893 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:55:36,894 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants.
[2025-05-07 17:55:36,895 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=621, Invalid=16935, Unknown=0, NotChecked=0, Total=17556
[2025-05-07 17:55:36,895 INFO  L87              Difference]: Start difference. First operand 247 states and 453 transitions. Second operand  has 133 states, 86 states have (on average 1.6162790697674418) internal successors, (139), 107 states have internal predecessors, (139), 63 states have call successors, (88), 1 states have call predecessors, (88), 86 states have return successors, (139), 110 states have call predecessors, (139), 63 states have call successors, (139)
[2025-05-07 17:55:38,971 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:55:38,971 INFO  L93              Difference]: Finished difference Result 317 states and 671 transitions.
[2025-05-07 17:55:38,971 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. 
[2025-05-07 17:55:38,971 INFO  L79                 Accepts]: Start accepts. Automaton has  has 133 states, 86 states have (on average 1.6162790697674418) internal successors, (139), 107 states have internal predecessors, (139), 63 states have call successors, (88), 1 states have call predecessors, (88), 86 states have return successors, (139), 110 states have call predecessors, (139), 63 states have call successors, (139) Word has length 286
[2025-05-07 17:55:38,971 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:55:38,972 INFO  L225             Difference]: With dead ends: 317
[2025-05-07 17:55:38,973 INFO  L226             Difference]: Without dead ends: 317
[2025-05-07 17:55:38,974 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 519 SyntacticMatches, 15 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7168 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=841, Invalid=21509, Unknown=0, NotChecked=0, Total=22350
[2025-05-07 17:55:38,974 INFO  L437           NwaCegarLoop]: 91 mSDtfsCounter, 41 mSDsluCounter, 4635 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 4726 SdHoareTripleChecker+Invalid, 2487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:55:38,974 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 4726 Invalid, 2487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2443 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-05-07 17:55:38,974 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 317 states.
[2025-05-07 17:55:38,989 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 245.
[2025-05-07 17:55:38,989 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 245 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 107 states have internal predecessors, (108), 56 states have call successors, (57), 27 states have call predecessors, (57), 86 states have return successors, (305), 110 states have call predecessors, (305), 56 states have call successors, (305)
[2025-05-07 17:55:38,990 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 470 transitions.
[2025-05-07 17:55:38,990 INFO  L79                 Accepts]: Start accepts. Automaton has 245 states and 470 transitions. Word has length 286
[2025-05-07 17:55:38,990 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:55:38,990 INFO  L485      AbstractCegarLoop]: Abstraction has 245 states and 470 transitions.
[2025-05-07 17:55:38,990 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 133 states, 86 states have (on average 1.6162790697674418) internal successors, (139), 107 states have internal predecessors, (139), 63 states have call successors, (88), 1 states have call predecessors, (88), 86 states have return successors, (139), 110 states have call predecessors, (139), 63 states have call successors, (139)
[2025-05-07 17:55:38,990 INFO  L278                IsEmpty]: Start isEmpty. Operand 245 states and 470 transitions.
[2025-05-07 17:55:38,991 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 312
[2025-05-07 17:55:38,991 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:55:38,992 INFO  L218           NwaCegarLoop]: trace histogram [10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:39,068 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0
[2025-05-07 17:55:39,192 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47
[2025-05-07 17:55:39,193 INFO  L403      AbstractCegarLoop]: === Iteration 48 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:55:39,194 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:55:39,194 INFO  L85        PathProgramCache]: Analyzing trace with hash -562925989, now seen corresponding path program 4 times
[2025-05-07 17:55:39,194 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:55:39,195 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269087918]
[2025-05-07 17:55:39,195 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-05-07 17:55:39,195 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:55:39,524 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 311 statements into 2 equivalence classes.
[2025-05-07 17:55:39,558 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 311 of 311 statements.
[2025-05-07 17:55:39,558 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-05-07 17:55:39,558 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:55:44,007 INFO  L134       CoverageAnalysis]: Checked inductivity of 603 backedges. 12 proven. 130 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked.
[2025-05-07 17:55:44,007 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:55:44,007 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269087918]
[2025-05-07 17:55:44,007 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269087918] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:55:44,007 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707493169]
[2025-05-07 17:55:44,007 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-05-07 17:55:44,007 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:55:44,009 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:55:44,010 INFO  L229       MonitoredProcess]: Starting monitored process 39 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:55:44,011 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process
[2025-05-07 17:55:54,391 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 311 statements into 2 equivalence classes.
[2025-05-07 17:55:54,759 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 311 of 311 statements.
[2025-05-07 17:55:54,759 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-05-07 17:55:54,759 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:55:54,777 INFO  L256         TraceCheckSpWp]: Trace formula consists of 4441 conjuncts, 161 conjuncts are in the unsatisfiable core
[2025-05-07 17:55:54,782 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:55:55,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 603 backedges. 12 proven. 98 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked.
[2025-05-07 17:55:55,505 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
