./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/control_flow/return_2.sol_6_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:25:29,567 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:25:29,616 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34eac53b-2674-43e7-9067-d15cdfea9833/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:25:29,619 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:25:29,620 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:25:29,638 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:25:29,639 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:25:29,639 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:25:29,639 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:25:29,639 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:25:29,640 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:25:29,640 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:25:29,640 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:25:29,640 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:25:29,640 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:25:29,640 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:25:29,641 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:25:29,641 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:25:29,641 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:25:29,641 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:25:29,641 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:25:29,641 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:25:29,641 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:25:29,641 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:25:29,641 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:25:29,642 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:25:29,642 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:25:29,834 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:25:29,842 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:25:29,844 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:25:29,845 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:25:29,846 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:25:29,847 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34eac53b-2674-43e7-9067-d15cdfea9833/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/control_flow/return_2.sol_6_no_adts_000.smt2
[2025-05-07 17:25:29,848 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:25:29,850 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:25:30,216 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_34eac53b-2674-43e7-9067-d15cdfea9833/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/control_flow/return_2.sol_6_no_adts_000.smt2
[2025-05-07 17:25:30,218 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:25:30,219 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:25:30,219 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:25:30,220 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:25:30,220 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:25:30,221 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,276 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30 Unit
[2025-05-07 17:25:30,276 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:25:30,277 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:25:30,277 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:25:30,277 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:25:30,288 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,288 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,322 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,322 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,336 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,339 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,341 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,346 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,349 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,366 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:25:30,367 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:25:30,367 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:25:30,367 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:25:30,368 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (1/1) ...
[2025-05-07 17:25:30,371 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:25:30,382 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:30,391 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:25:30,393 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:25:30,401 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:25:30,401 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:25:30,401 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:25:30,401 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_10_0 given in one single declaration
[2025-05-07 17:25:30,401 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_10_0
[2025-05-07 17:25:30,401 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_10_0
[2025-05-07 17:25:30,401 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_5_function_f__117_118_0 given in one single declaration
[2025-05-07 17:25:30,401 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_5_function_f__117_118_0
[2025-05-07 17:25:30,401 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_5_function_f__117_118_0
[2025-05-07 17:25:30,401 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_37_function_f__117_118_0 given in one single declaration
[2025-05-07 17:25:30,401 INFO  L130     BoogieDeclarations]: Found specification of procedure block_37_function_f__117_118_0
[2025-05-07 17:25:30,401 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_37_function_f__117_118_0
[2025-05-07 17:25:30,402 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_4_function_f__117_118_0 given in one single declaration
[2025-05-07 17:25:30,402 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_4_function_f__117_118_0
[2025-05-07 17:25:30,402 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_4_function_f__117_118_0
[2025-05-07 17:25:30,402 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_34_function_add__53_118_0 given in one single declaration
[2025-05-07 17:25:30,402 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_34_function_add__53_118_0
[2025-05-07 17:25:30,402 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_34_function_add__53_118_0
[2025-05-07 17:25:30,402 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_3_function_add__53_118_0 given in one single declaration
[2025-05-07 17:25:30,402 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_3_function_add__53_118_0
[2025-05-07 17:25:30,402 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_3_function_add__53_118_0
[2025-05-07 17:25:30,402 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_8_return_function_add__53_118_0 given in one single declaration
[2025-05-07 17:25:30,402 INFO  L130     BoogieDeclarations]: Found specification of procedure block_8_return_function_add__53_118_0
[2025-05-07 17:25:30,402 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_8_return_function_add__53_118_0
[2025-05-07 17:25:30,403 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_18_if_true_add_42_118_0 given in one single declaration
[2025-05-07 17:25:30,403 INFO  L130     BoogieDeclarations]: Found specification of procedure block_18_if_true_add_42_118_0
[2025-05-07 17:25:30,403 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_18_if_true_add_42_118_0
[2025-05-07 17:25:30,403 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_17_if_header_add_43_118_0 given in one single declaration
[2025-05-07 17:25:30,403 INFO  L130     BoogieDeclarations]: Found specification of procedure block_17_if_header_add_43_118_0
[2025-05-07 17:25:30,403 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_17_if_header_add_43_118_0
[2025-05-07 17:25:30,403 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_15_add_52_118_0 given in one single declaration
[2025-05-07 17:25:30,403 INFO  L130     BoogieDeclarations]: Found specification of procedure block_15_add_52_118_0
[2025-05-07 17:25:30,403 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_15_add_52_118_0
[2025-05-07 17:25:30,403 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_13_if_header_add_31_118_0 given in one single declaration
[2025-05-07 17:25:30,403 INFO  L130     BoogieDeclarations]: Found specification of procedure block_13_if_header_add_31_118_0
[2025-05-07 17:25:30,403 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_13_if_header_add_31_118_0
[2025-05-07 17:25:30,403 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_11_add_52_118_0 given in one single declaration
[2025-05-07 17:25:30,403 INFO  L130     BoogieDeclarations]: Found specification of procedure block_11_add_52_118_0
[2025-05-07 17:25:30,403 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_11_add_52_118_0
[2025-05-07 17:25:30,403 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_9_if_header_add_20_118_0 given in one single declaration
[2025-05-07 17:25:30,404 INFO  L130     BoogieDeclarations]: Found specification of procedure block_9_if_header_add_20_118_0
[2025-05-07 17:25:30,404 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_9_if_header_add_20_118_0
[2025-05-07 17:25:30,404 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_7_add_52_118_0 given in one single declaration
[2025-05-07 17:25:30,404 INFO  L130     BoogieDeclarations]: Found specification of procedure block_7_add_52_118_0
[2025-05-07 17:25:30,404 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_7_add_52_118_0
[2025-05-07 17:25:30,404 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_6_function_add__53_118_0 given in one single declaration
[2025-05-07 17:25:30,404 INFO  L130     BoogieDeclarations]: Found specification of procedure block_6_function_add__53_118_0
[2025-05-07 17:25:30,404 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_6_function_add__53_118_0
[2025-05-07 17:25:30,404 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_10_if_true_add_19_118_0 given in one single declaration
[2025-05-07 17:25:30,404 INFO  L130     BoogieDeclarations]: Found specification of procedure block_10_if_true_add_19_118_0
[2025-05-07 17:25:30,404 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_10_if_true_add_19_118_0
[2025-05-07 17:25:30,404 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_19_add_52_118_0 given in one single declaration
[2025-05-07 17:25:30,404 INFO  L130     BoogieDeclarations]: Found specification of procedure block_19_add_52_118_0
[2025-05-07 17:25:30,404 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_19_add_52_118_0
[2025-05-07 17:25:30,404 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_14_if_true_add_30_118_0 given in one single declaration
[2025-05-07 17:25:30,404 INFO  L130     BoogieDeclarations]: Found specification of procedure block_14_if_true_add_30_118_0
[2025-05-07 17:25:30,405 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_14_if_true_add_30_118_0
[2025-05-07 17:25:30,405 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_27_function_f__117_118_0 given in one single declaration
[2025-05-07 17:25:30,405 INFO  L130     BoogieDeclarations]: Found specification of procedure block_27_function_f__117_118_0
[2025-05-07 17:25:30,405 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_27_function_f__117_118_0
[2025-05-07 17:25:30,405 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_24_return_function_f__117_118_0 given in one single declaration
[2025-05-07 17:25:30,405 INFO  L130     BoogieDeclarations]: Found specification of procedure block_24_return_function_f__117_118_0
[2025-05-07 17:25:30,405 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_24_return_function_f__117_118_0
[2025-05-07 17:25:30,405 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_29_function_f__117_118_0 given in one single declaration
[2025-05-07 17:25:30,405 INFO  L130     BoogieDeclarations]: Found specification of procedure block_29_function_f__117_118_0
[2025-05-07 17:25:30,405 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_29_function_f__117_118_0
[2025-05-07 17:25:30,405 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_30_function_f__117_118_0 given in one single declaration
[2025-05-07 17:25:30,405 INFO  L130     BoogieDeclarations]: Found specification of procedure block_30_function_f__117_118_0
[2025-05-07 17:25:30,405 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_30_function_f__117_118_0
[2025-05-07 17:25:30,405 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_26_function_f__117_118_0 given in one single declaration
[2025-05-07 17:25:30,405 INFO  L130     BoogieDeclarations]: Found specification of procedure block_26_function_f__117_118_0
[2025-05-07 17:25:30,405 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_26_function_f__117_118_0
[2025-05-07 17:25:30,406 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_36_function_f__117_118_0 given in one single declaration
[2025-05-07 17:25:30,406 INFO  L130     BoogieDeclarations]: Found specification of procedure block_36_function_f__117_118_0
[2025-05-07 17:25:30,406 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_36_function_f__117_118_0
[2025-05-07 17:25:30,406 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_32_function_f__117_118_0 given in one single declaration
[2025-05-07 17:25:30,406 INFO  L130     BoogieDeclarations]: Found specification of procedure block_32_function_f__117_118_0
[2025-05-07 17:25:30,406 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_32_function_f__117_118_0
[2025-05-07 17:25:30,406 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_35_function_f__117_118_0 given in one single declaration
[2025-05-07 17:25:30,406 INFO  L130     BoogieDeclarations]: Found specification of procedure block_35_function_f__117_118_0
[2025-05-07 17:25:30,406 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_35_function_f__117_118_0
[2025-05-07 17:25:30,406 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_33_function_f__117_118_0 given in one single declaration
[2025-05-07 17:25:30,406 INFO  L130     BoogieDeclarations]: Found specification of procedure block_33_function_f__117_118_0
[2025-05-07 17:25:30,406 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_33_function_f__117_118_0
[2025-05-07 17:25:30,406 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_28_function_add__53_118_0 given in one single declaration
[2025-05-07 17:25:30,406 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_28_function_add__53_118_0
[2025-05-07 17:25:30,406 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_28_function_add__53_118_0
[2025-05-07 17:25:30,406 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_23_f_116_118_0 given in one single declaration
[2025-05-07 17:25:30,406 INFO  L130     BoogieDeclarations]: Found specification of procedure block_23_f_116_118_0
[2025-05-07 17:25:30,406 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_23_f_116_118_0
[2025-05-07 17:25:30,406 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_22_function_f__117_118_0 given in one single declaration
[2025-05-07 17:25:30,407 INFO  L130     BoogieDeclarations]: Found specification of procedure block_22_function_f__117_118_0
[2025-05-07 17:25:30,407 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_22_function_f__117_118_0
[2025-05-07 17:25:30,407 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_31_function_add__53_118_0 given in one single declaration
[2025-05-07 17:25:30,407 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_31_function_add__53_118_0
[2025-05-07 17:25:30,407 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_31_function_add__53_118_0
[2025-05-07 17:25:30,407 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_25_function_add__53_118_0 given in one single declaration
[2025-05-07 17:25:30,407 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_25_function_add__53_118_0
[2025-05-07 17:25:30,407 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_25_function_add__53_118_0
[2025-05-07 17:25:30,407 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_0_C_118_0 given in one single declaration
[2025-05-07 17:25:30,407 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_0_C_118_0
[2025-05-07 17:25:30,407 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_0_C_118_0
[2025-05-07 17:25:30,407 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_2_C_118_0 given in one single declaration
[2025-05-07 17:25:30,407 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_2_C_118_0
[2025-05-07 17:25:30,407 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_2_C_118_0
[2025-05-07 17:25:30,407 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_38_C_118_0 given in one single declaration
[2025-05-07 17:25:30,407 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_38_C_118_0
[2025-05-07 17:25:30,407 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_38_C_118_0
[2025-05-07 17:25:30,407 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_40_C_118_0 given in one single declaration
[2025-05-07 17:25:30,407 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_40_C_118_0
[2025-05-07 17:25:30,407 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_40_C_118_0
[2025-05-07 17:25:30,407 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_39_C_118_0 given in one single declaration
[2025-05-07 17:25:30,407 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_39_C_118_0
[2025-05-07 17:25:30,407 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_39_C_118_0
[2025-05-07 17:25:30,407 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_41_C_118_0 given in one single declaration
[2025-05-07 17:25:30,407 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_41_C_118_0
[2025-05-07 17:25:30,407 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_41_C_118_0
[2025-05-07 17:25:30,407 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:25:30,408 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:25:30,408 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:25:30,635 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:25:30,637 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:25:31,060 INFO  L?                        ?]: Removed 391 outVars from TransFormulas that were not future-live.
[2025-05-07 17:25:31,060 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:25:31,072 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:25:31,073 INFO  L312             CfgBuilder]: Removed 20 assume(true) statements.
[2025-05-07 17:25:31,073 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:25:31 BoogieIcfgContainer
[2025-05-07 17:25:31,073 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:25:31,075 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:25:31,075 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:25:31,078 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:25:31,079 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:25:30" (1/3) ...
[2025-05-07 17:25:31,079 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e749d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:25:31, skipping insertion in model container
[2025-05-07 17:25:31,079 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:30" (2/3) ...
[2025-05-07 17:25:31,079 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e749d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:25:31, skipping insertion in model container
[2025-05-07 17:25:31,079 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:25:31" (3/3) ...
[2025-05-07 17:25:31,080 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:25:31,091 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:25:31,093 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 40 procedures, 192 locations, 351 edges, 40 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:25:31,130 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:25:31,142 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;@2870c454, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:25:31,142 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:25:31,145 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 192 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 78 states have internal predecessors, (78), 83 states have call successors, (91), 39 states have call predecessors, (91), 39 states have return successors, (91), 74 states have call predecessors, (91), 83 states have call successors, (91)
[2025-05-07 17:25:31,158 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-05-07 17:25:31,158 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:31,159 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:31,159 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:31,162 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:31,163 INFO  L85        PathProgramCache]: Analyzing trace with hash -36428213, now seen corresponding path program 1 times
[2025-05-07 17:25:31,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:31,168 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598675570]
[2025-05-07 17:25:31,169 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:31,169 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:31,217 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-05-07 17:25:31,307 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-05-07 17:25:31,307 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:31,307 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:31,720 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:25:31,721 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:31,721 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598675570]
[2025-05-07 17:25:31,721 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598675570] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:31,721 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:31,723 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:25:31,724 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107720310]
[2025-05-07 17:25:31,725 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:31,728 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:25:31,728 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:31,745 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:25:31,746 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:25:31,747 INFO  L87              Difference]: Start difference. First operand  has 192 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 78 states have internal predecessors, (78), 83 states have call successors, (91), 39 states have call predecessors, (91), 39 states have return successors, (91), 74 states have call predecessors, (91), 83 states have call successors, (91) Second operand  has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (21), 8 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:25:32,005 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:32,005 INFO  L93              Difference]: Finished difference Result 196 states and 278 transitions.
[2025-05-07 17:25:32,006 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:25:32,008 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (21), 8 states have call predecessors, (21), 4 states have call successors, (21) Word has length 76
[2025-05-07 17:25:32,008 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:32,017 INFO  L225             Difference]: With dead ends: 196
[2025-05-07 17:25:32,017 INFO  L226             Difference]: Without dead ends: 196
[2025-05-07 17:25:32,019 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:25:32,022 INFO  L437           NwaCegarLoop]: 239 mSDtfsCounter, 1 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:32,022 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1644 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:25:32,035 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2025-05-07 17:25:32,062 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196.
[2025-05-07 17:25:32,063 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 196 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 79 states have internal predecessors, (79), 83 states have call successors, (91), 39 states have call predecessors, (91), 42 states have return successors, (108), 77 states have call predecessors, (108), 83 states have call successors, (108)
[2025-05-07 17:25:32,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 278 transitions.
[2025-05-07 17:25:32,070 INFO  L79                 Accepts]: Start accepts. Automaton has 196 states and 278 transitions. Word has length 76
[2025-05-07 17:25:32,071 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:32,071 INFO  L485      AbstractCegarLoop]: Abstraction has 196 states and 278 transitions.
[2025-05-07 17:25:32,072 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (21), 8 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:25:32,072 INFO  L278                IsEmpty]: Start isEmpty. Operand 196 states and 278 transitions.
[2025-05-07 17:25:32,076 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 74
[2025-05-07 17:25:32,076 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:32,076 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:32,076 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:25:32,077 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:32,077 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:32,077 INFO  L85        PathProgramCache]: Analyzing trace with hash 524846229, now seen corresponding path program 1 times
[2025-05-07 17:25:32,078 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:32,078 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538475737]
[2025-05-07 17:25:32,078 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:32,078 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:32,112 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes.
[2025-05-07 17:25:32,139 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements.
[2025-05-07 17:25:32,139 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:32,139 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:32,293 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:25:32,293 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:32,293 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538475737]
[2025-05-07 17:25:32,293 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538475737] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:32,293 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:32,293 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-05-07 17:25:32,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139318968]
[2025-05-07 17:25:32,293 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:32,294 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-05-07 17:25:32,294 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:32,294 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-05-07 17:25:32,294 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-05-07 17:25:32,295 INFO  L87              Difference]: Start difference. First operand 196 states and 278 transitions. Second operand  has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (20), 8 states have call predecessors, (20), 4 states have call successors, (20)
[2025-05-07 17:25:32,486 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:32,486 INFO  L93              Difference]: Finished difference Result 198 states and 279 transitions.
[2025-05-07 17:25:32,487 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-05-07 17:25:32,487 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (20), 8 states have call predecessors, (20), 4 states have call successors, (20) Word has length 73
[2025-05-07 17:25:32,487 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:32,488 INFO  L225             Difference]: With dead ends: 198
[2025-05-07 17:25:32,488 INFO  L226             Difference]: Without dead ends: 198
[2025-05-07 17:25:32,489 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:25:32,489 INFO  L437           NwaCegarLoop]: 240 mSDtfsCounter, 1 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:32,489 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1878 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:25:32,490 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2025-05-07 17:25:32,500 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196.
[2025-05-07 17:25:32,500 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 196 states, 71 states have (on average 1.1126760563380282) internal successors, (79), 79 states have internal predecessors, (79), 83 states have call successors, (91), 39 states have call predecessors, (91), 42 states have return successors, (107), 77 states have call predecessors, (107), 83 states have call successors, (107)
[2025-05-07 17:25:32,502 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 277 transitions.
[2025-05-07 17:25:32,502 INFO  L79                 Accepts]: Start accepts. Automaton has 196 states and 277 transitions. Word has length 73
[2025-05-07 17:25:32,502 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:32,502 INFO  L485      AbstractCegarLoop]: Abstraction has 196 states and 277 transitions.
[2025-05-07 17:25:32,502 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 4 states have call successors, (20), 1 states have call predecessors, (20), 8 states have return successors, (20), 8 states have call predecessors, (20), 4 states have call successors, (20)
[2025-05-07 17:25:32,503 INFO  L278                IsEmpty]: Start isEmpty. Operand 196 states and 277 transitions.
[2025-05-07 17:25:32,504 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-05-07 17:25:32,504 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:32,505 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:32,505 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:25:32,505 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:32,505 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:32,505 INFO  L85        PathProgramCache]: Analyzing trace with hash -738825973, now seen corresponding path program 1 times
[2025-05-07 17:25:32,505 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:32,505 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059550198]
[2025-05-07 17:25:32,505 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:32,505 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:32,545 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-05-07 17:25:32,547 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-05-07 17:25:32,547 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:32,548 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:32,599 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:25:32,599 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:32,599 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059550198]
[2025-05-07 17:25:32,599 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059550198] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:32,599 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:32,599 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:32,599 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997172818]
[2025-05-07 17:25:32,599 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:32,600 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:32,600 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:32,600 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:32,600 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:32,601 INFO  L87              Difference]: Start difference. First operand 196 states and 277 transitions. Second operand  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:25:32,611 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:32,612 INFO  L93              Difference]: Finished difference Result 200 states and 281 transitions.
[2025-05-07 17:25:32,612 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:25:32,612 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21) Word has length 76
[2025-05-07 17:25:32,612 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:32,614 INFO  L225             Difference]: With dead ends: 200
[2025-05-07 17:25:32,614 INFO  L226             Difference]: Without dead ends: 196
[2025-05-07 17:25:32,614 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:25:32,615 INFO  L437           NwaCegarLoop]: 259 mSDtfsCounter, 1 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 769 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:25:32,615 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 769 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:32,616 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 196 states.
[2025-05-07 17:25:32,625 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194.
[2025-05-07 17:25:32,625 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 194 states, 71 states have (on average 1.0985915492957747) internal successors, (78), 78 states have internal predecessors, (78), 81 states have call successors, (89), 39 states have call predecessors, (89), 42 states have return successors, (105), 76 states have call predecessors, (105), 81 states have call successors, (105)
[2025-05-07 17:25:32,627 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 272 transitions.
[2025-05-07 17:25:32,627 INFO  L79                 Accepts]: Start accepts. Automaton has 194 states and 272 transitions. Word has length 76
[2025-05-07 17:25:32,627 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:32,627 INFO  L485      AbstractCegarLoop]: Abstraction has 194 states and 272 transitions.
[2025-05-07 17:25:32,627 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (21), 1 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 4 states have call successors, (21)
[2025-05-07 17:25:32,627 INFO  L278                IsEmpty]: Start isEmpty. Operand 194 states and 272 transitions.
[2025-05-07 17:25:32,628 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2025-05-07 17:25:32,628 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:32,629 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:32,629 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:25:32,629 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:32,629 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:32,629 INFO  L85        PathProgramCache]: Analyzing trace with hash -1654671015, now seen corresponding path program 1 times
[2025-05-07 17:25:32,629 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:32,629 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426618376]
[2025-05-07 17:25:32,629 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:32,630 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:32,658 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes.
[2025-05-07 17:25:32,669 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements.
[2025-05-07 17:25:32,669 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:32,669 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:32,928 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:25:32,928 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:32,929 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426618376]
[2025-05-07 17:25:32,929 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426618376] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:32,929 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:32,929 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-05-07 17:25:32,929 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179280509]
[2025-05-07 17:25:32,929 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:32,929 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-05-07 17:25:32,930 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:32,930 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-05-07 17:25:32,930 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132
[2025-05-07 17:25:32,930 INFO  L87              Difference]: Start difference. First operand 194 states and 272 transitions. Second operand  has 12 states, 10 states have (on average 3.8) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (23), 11 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:25:33,241 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:33,241 INFO  L93              Difference]: Finished difference Result 200 states and 292 transitions.
[2025-05-07 17:25:33,241 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-05-07 17:25:33,241 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 10 states have (on average 3.8) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (23), 11 states have call predecessors, (23), 5 states have call successors, (23) Word has length 84
[2025-05-07 17:25:33,242 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:33,243 INFO  L225             Difference]: With dead ends: 200
[2025-05-07 17:25:33,243 INFO  L226             Difference]: Without dead ends: 200
[2025-05-07 17:25:33,243 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:25:33,244 INFO  L437           NwaCegarLoop]: 246 mSDtfsCounter, 2 mSDsluCounter, 2417 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2663 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:33,244 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2663 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:25:33,245 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 200 states.
[2025-05-07 17:25:33,253 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200.
[2025-05-07 17:25:33,253 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 200 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 81 states have internal predecessors, (81), 81 states have call successors, (89), 39 states have call predecessors, (89), 45 states have return successors, (122), 79 states have call predecessors, (122), 81 states have call successors, (122)
[2025-05-07 17:25:33,254 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 292 transitions.
[2025-05-07 17:25:33,254 INFO  L79                 Accepts]: Start accepts. Automaton has 200 states and 292 transitions. Word has length 84
[2025-05-07 17:25:33,254 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:33,255 INFO  L485      AbstractCegarLoop]: Abstraction has 200 states and 292 transitions.
[2025-05-07 17:25:33,255 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 10 states have (on average 3.8) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (23), 11 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:25:33,255 INFO  L278                IsEmpty]: Start isEmpty. Operand 200 states and 292 transitions.
[2025-05-07 17:25:33,256 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2025-05-07 17:25:33,256 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:33,256 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:33,256 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:25:33,256 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:33,257 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:33,257 INFO  L85        PathProgramCache]: Analyzing trace with hash 1184455823, now seen corresponding path program 1 times
[2025-05-07 17:25:33,257 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:33,257 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184973385]
[2025-05-07 17:25:33,257 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:33,257 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:33,280 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes.
[2025-05-07 17:25:33,294 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements.
[2025-05-07 17:25:33,294 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:33,294 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:33,577 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:25:33,577 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:33,577 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184973385]
[2025-05-07 17:25:33,577 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184973385] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:33,577 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:33,577 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-05-07 17:25:33,577 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599909977]
[2025-05-07 17:25:33,577 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:33,578 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-05-07 17:25:33,578 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:33,578 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-05-07 17:25:33,579 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:25:33,579 INFO  L87              Difference]: Start difference. First operand 200 states and 292 transitions. Second operand  has 10 states, 8 states have (on average 4.25) internal successors, (34), 10 states have internal predecessors, (34), 5 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (21), 8 states have call predecessors, (21), 5 states have call successors, (21)
[2025-05-07 17:25:33,813 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:33,813 INFO  L93              Difference]: Finished difference Result 200 states and 291 transitions.
[2025-05-07 17:25:33,814 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-05-07 17:25:33,814 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 4.25) internal successors, (34), 10 states have internal predecessors, (34), 5 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (21), 8 states have call predecessors, (21), 5 states have call successors, (21) Word has length 76
[2025-05-07 17:25:33,814 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:33,816 INFO  L225             Difference]: With dead ends: 200
[2025-05-07 17:25:33,816 INFO  L226             Difference]: Without dead ends: 200
[2025-05-07 17:25:33,816 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:25:33,817 INFO  L437           NwaCegarLoop]: 236 mSDtfsCounter, 3 mSDsluCounter, 1846 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2082 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:33,817 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2082 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:25:33,818 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 200 states.
[2025-05-07 17:25:33,830 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200.
[2025-05-07 17:25:33,831 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 200 states, 74 states have (on average 1.0945945945945945) internal successors, (81), 81 states have internal predecessors, (81), 81 states have call successors, (89), 39 states have call predecessors, (89), 45 states have return successors, (121), 79 states have call predecessors, (121), 81 states have call successors, (121)
[2025-05-07 17:25:33,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 291 transitions.
[2025-05-07 17:25:33,833 INFO  L79                 Accepts]: Start accepts. Automaton has 200 states and 291 transitions. Word has length 76
[2025-05-07 17:25:33,833 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:33,833 INFO  L485      AbstractCegarLoop]: Abstraction has 200 states and 291 transitions.
[2025-05-07 17:25:33,833 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 4.25) internal successors, (34), 10 states have internal predecessors, (34), 5 states have call successors, (21), 1 states have call predecessors, (21), 8 states have return successors, (21), 8 states have call predecessors, (21), 5 states have call successors, (21)
[2025-05-07 17:25:33,834 INFO  L278                IsEmpty]: Start isEmpty. Operand 200 states and 291 transitions.
[2025-05-07 17:25:33,835 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 99
[2025-05-07 17:25:33,835 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:33,835 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:33,835 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:25:33,835 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:33,835 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:33,835 INFO  L85        PathProgramCache]: Analyzing trace with hash -1112119550, now seen corresponding path program 1 times
[2025-05-07 17:25:33,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:33,836 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139292542]
[2025-05-07 17:25:33,836 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:33,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:33,871 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes.
[2025-05-07 17:25:33,882 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements.
[2025-05-07 17:25:33,883 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:33,883 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:34,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-05-07 17:25:34,165 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:34,165 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139292542]
[2025-05-07 17:25:34,165 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139292542] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:34,165 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:34,165 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-05-07 17:25:34,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869820154]
[2025-05-07 17:25:34,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:34,166 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-05-07 17:25:34,166 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:34,167 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-05-07 17:25:34,167 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:25:34,167 INFO  L87              Difference]: Start difference. First operand 200 states and 291 transitions. Second operand  has 10 states, 8 states have (on average 5.125) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 8 states have return successors, (27), 9 states have call predecessors, (27), 5 states have call successors, (27)
[2025-05-07 17:25:34,362 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:34,362 INFO  L93              Difference]: Finished difference Result 204 states and 303 transitions.
[2025-05-07 17:25:34,363 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-05-07 17:25:34,363 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 5.125) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 8 states have return successors, (27), 9 states have call predecessors, (27), 5 states have call successors, (27) Word has length 98
[2025-05-07 17:25:34,363 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:34,364 INFO  L225             Difference]: With dead ends: 204
[2025-05-07 17:25:34,364 INFO  L226             Difference]: Without dead ends: 204
[2025-05-07 17:25:34,364 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:25:34,365 INFO  L437           NwaCegarLoop]: 237 mSDtfsCounter, 2 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2100 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:34,365 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2100 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:25:34,366 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 204 states.
[2025-05-07 17:25:34,373 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202.
[2025-05-07 17:25:34,374 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 202 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 82 states have internal predecessors, (82), 81 states have call successors, (89), 39 states have call predecessors, (89), 46 states have return successors, (130), 80 states have call predecessors, (130), 81 states have call successors, (130)
[2025-05-07 17:25:34,375 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 301 transitions.
[2025-05-07 17:25:34,375 INFO  L79                 Accepts]: Start accepts. Automaton has 202 states and 301 transitions. Word has length 98
[2025-05-07 17:25:34,375 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:34,375 INFO  L485      AbstractCegarLoop]: Abstraction has 202 states and 301 transitions.
[2025-05-07 17:25:34,375 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 5.125) internal successors, (41), 10 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 8 states have return successors, (27), 9 states have call predecessors, (27), 5 states have call successors, (27)
[2025-05-07 17:25:34,375 INFO  L278                IsEmpty]: Start isEmpty. Operand 202 states and 301 transitions.
[2025-05-07 17:25:34,377 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 107
[2025-05-07 17:25:34,377 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:34,377 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:34,377 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:25:34,377 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:34,377 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:34,377 INFO  L85        PathProgramCache]: Analyzing trace with hash -848092748, now seen corresponding path program 1 times
[2025-05-07 17:25:34,378 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:34,378 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272445495]
[2025-05-07 17:25:34,378 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:34,378 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:34,408 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes.
[2025-05-07 17:25:34,424 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements.
[2025-05-07 17:25:34,424 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:34,424 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:34,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-05-07 17:25:34,588 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:34,588 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272445495]
[2025-05-07 17:25:34,589 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272445495] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:34,589 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:34,589 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-05-07 17:25:34,589 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891775636]
[2025-05-07 17:25:34,589 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:34,589 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-05-07 17:25:34,589 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:34,590 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-05-07 17:25:34,590 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:25:34,590 INFO  L87              Difference]: Start difference. First operand 202 states and 301 transitions. Second operand  has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (29), 11 states have call predecessors, (29), 4 states have call successors, (29)
[2025-05-07 17:25:34,806 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:34,807 INFO  L93              Difference]: Finished difference Result 206 states and 313 transitions.
[2025-05-07 17:25:34,807 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-05-07 17:25:34,807 INFO  L79                 Accepts]: Start accepts. Automaton has  has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (29), 11 states have call predecessors, (29), 4 states have call successors, (29) Word has length 106
[2025-05-07 17:25:34,808 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:34,809 INFO  L225             Difference]: With dead ends: 206
[2025-05-07 17:25:34,809 INFO  L226             Difference]: Without dead ends: 206
[2025-05-07 17:25:34,810 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:25:34,810 INFO  L437           NwaCegarLoop]: 250 mSDtfsCounter, 1 mSDsluCounter, 2198 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:34,810 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2448 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:25:34,811 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 206 states.
[2025-05-07 17:25:34,821 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 202.
[2025-05-07 17:25:34,821 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 202 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 82 states have internal predecessors, (82), 81 states have call successors, (89), 39 states have call predecessors, (89), 46 states have return successors, (130), 80 states have call predecessors, (130), 81 states have call successors, (130)
[2025-05-07 17:25:34,822 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 301 transitions.
[2025-05-07 17:25:34,823 INFO  L79                 Accepts]: Start accepts. Automaton has 202 states and 301 transitions. Word has length 106
[2025-05-07 17:25:34,823 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:34,823 INFO  L485      AbstractCegarLoop]: Abstraction has 202 states and 301 transitions.
[2025-05-07 17:25:34,823 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 states have internal predecessors, (46), 4 states have call successors, (27), 1 states have call predecessors, (27), 10 states have return successors, (29), 11 states have call predecessors, (29), 4 states have call successors, (29)
[2025-05-07 17:25:34,823 INFO  L278                IsEmpty]: Start isEmpty. Operand 202 states and 301 transitions.
[2025-05-07 17:25:34,824 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 82
[2025-05-07 17:25:34,824 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:34,824 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:34,824 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:25:34,825 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:34,825 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:34,825 INFO  L85        PathProgramCache]: Analyzing trace with hash 1457873991, now seen corresponding path program 1 times
[2025-05-07 17:25:34,825 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:34,825 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651108498]
[2025-05-07 17:25:34,825 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:34,825 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:34,853 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes.
[2025-05-07 17:25:34,862 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements.
[2025-05-07 17:25:34,863 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:34,863 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:35,096 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:25:35,096 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:35,096 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651108498]
[2025-05-07 17:25:35,096 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651108498] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:35,096 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:35,097 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-05-07 17:25:35,097 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738819540]
[2025-05-07 17:25:35,097 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:35,097 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-05-07 17:25:35,097 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:35,098 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-05-07 17:25:35,098 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132
[2025-05-07 17:25:35,098 INFO  L87              Difference]: Start difference. First operand 202 states and 301 transitions. Second operand  has 12 states, 10 states have (on average 3.7) internal successors, (37), 12 states have internal predecessors, (37), 5 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (22), 10 states have call predecessors, (22), 5 states have call successors, (22)
[2025-05-07 17:25:35,361 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:35,361 INFO  L93              Difference]: Finished difference Result 204 states and 301 transitions.
[2025-05-07 17:25:35,362 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-05-07 17:25:35,362 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 10 states have (on average 3.7) internal successors, (37), 12 states have internal predecessors, (37), 5 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (22), 10 states have call predecessors, (22), 5 states have call successors, (22) Word has length 81
[2025-05-07 17:25:35,362 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:35,364 INFO  L225             Difference]: With dead ends: 204
[2025-05-07 17:25:35,364 INFO  L226             Difference]: Without dead ends: 204
[2025-05-07 17:25:35,364 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:25:35,365 INFO  L437           NwaCegarLoop]: 250 mSDtfsCounter, 2 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:35,365 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2700 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:25:35,366 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 204 states.
[2025-05-07 17:25:35,375 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202.
[2025-05-07 17:25:35,376 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 202 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 82 states have internal predecessors, (82), 81 states have call successors, (89), 39 states have call predecessors, (89), 46 states have return successors, (128), 80 states have call predecessors, (128), 81 states have call successors, (128)
[2025-05-07 17:25:35,378 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 299 transitions.
[2025-05-07 17:25:35,378 INFO  L79                 Accepts]: Start accepts. Automaton has 202 states and 299 transitions. Word has length 81
[2025-05-07 17:25:35,378 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:35,378 INFO  L485      AbstractCegarLoop]: Abstraction has 202 states and 299 transitions.
[2025-05-07 17:25:35,378 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 10 states have (on average 3.7) internal successors, (37), 12 states have internal predecessors, (37), 5 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (22), 10 states have call predecessors, (22), 5 states have call successors, (22)
[2025-05-07 17:25:35,378 INFO  L278                IsEmpty]: Start isEmpty. Operand 202 states and 299 transitions.
[2025-05-07 17:25:35,380 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2025-05-07 17:25:35,380 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:35,380 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:35,381 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:25:35,381 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:35,381 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:35,381 INFO  L85        PathProgramCache]: Analyzing trace with hash 1950434115, now seen corresponding path program 1 times
[2025-05-07 17:25:35,381 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:35,381 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667114465]
[2025-05-07 17:25:35,381 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:35,382 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:35,411 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes.
[2025-05-07 17:25:35,421 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements.
[2025-05-07 17:25:35,421 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:35,421 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:35,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-05-07 17:25:35,630 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:35,630 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667114465]
[2025-05-07 17:25:35,630 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667114465] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:35,630 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:35,630 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-05-07 17:25:35,631 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503949568]
[2025-05-07 17:25:35,631 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:35,631 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-05-07 17:25:35,631 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:35,632 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-05-07 17:25:35,632 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:25:35,632 INFO  L87              Difference]: Start difference. First operand 202 states and 299 transitions. Second operand  has 10 states, 8 states have (on average 5.25) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (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:25:35,817 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:35,817 INFO  L93              Difference]: Finished difference Result 204 states and 308 transitions.
[2025-05-07 17:25:35,818 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-05-07 17:25:35,818 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 5.25) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (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 101
[2025-05-07 17:25:35,818 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:35,820 INFO  L225             Difference]: With dead ends: 204
[2025-05-07 17:25:35,820 INFO  L226             Difference]: Without dead ends: 204
[2025-05-07 17:25:35,820 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:25:35,820 INFO  L437           NwaCegarLoop]: 238 mSDtfsCounter, 2 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:35,821 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2111 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:25:35,821 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 204 states.
[2025-05-07 17:25:35,829 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204.
[2025-05-07 17:25:35,830 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 204 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 83 states have internal predecessors, (83), 81 states have call successors, (89), 39 states have call predecessors, (89), 47 states have return successors, (136), 81 states have call predecessors, (136), 81 states have call successors, (136)
[2025-05-07 17:25:35,831 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 308 transitions.
[2025-05-07 17:25:35,832 INFO  L79                 Accepts]: Start accepts. Automaton has 204 states and 308 transitions. Word has length 101
[2025-05-07 17:25:35,832 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:35,832 INFO  L485      AbstractCegarLoop]: Abstraction has 204 states and 308 transitions.
[2025-05-07 17:25:35,832 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 5.25) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (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:25:35,832 INFO  L278                IsEmpty]: Start isEmpty. Operand 204 states and 308 transitions.
[2025-05-07 17:25:35,833 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2025-05-07 17:25:35,834 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:35,834 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:35,834 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:25:35,834 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:35,834 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:35,834 INFO  L85        PathProgramCache]: Analyzing trace with hash -699037197, now seen corresponding path program 1 times
[2025-05-07 17:25:35,834 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:35,834 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127894313]
[2025-05-07 17:25:35,834 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:35,835 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:35,856 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes.
[2025-05-07 17:25:35,865 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements.
[2025-05-07 17:25:35,865 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:35,865 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:36,102 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-05-07 17:25:36,102 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:36,102 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127894313]
[2025-05-07 17:25:36,102 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127894313] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:36,102 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:36,102 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-05-07 17:25:36,102 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879544032]
[2025-05-07 17:25:36,102 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:36,103 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-05-07 17:25:36,103 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:36,103 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-05-07 17:25:36,103 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2025-05-07 17:25:36,104 INFO  L87              Difference]: Start difference. First operand 204 states and 308 transitions. Second operand  has 10 states, 8 states have (on average 5.25) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (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:25:36,279 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:36,280 INFO  L93              Difference]: Finished difference Result 204 states and 307 transitions.
[2025-05-07 17:25:36,280 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-05-07 17:25:36,280 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 8 states have (on average 5.25) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (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 101
[2025-05-07 17:25:36,280 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:36,281 INFO  L225             Difference]: With dead ends: 204
[2025-05-07 17:25:36,282 INFO  L226             Difference]: Without dead ends: 204
[2025-05-07 17:25:36,282 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2025-05-07 17:25:36,282 INFO  L437           NwaCegarLoop]: 239 mSDtfsCounter, 2 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2120 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:36,282 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2120 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:25:36,283 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 204 states.
[2025-05-07 17:25:36,288 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204.
[2025-05-07 17:25:36,288 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 204 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 83 states have internal predecessors, (83), 81 states have call successors, (89), 39 states have call predecessors, (89), 47 states have return successors, (135), 81 states have call predecessors, (135), 81 states have call successors, (135)
[2025-05-07 17:25:36,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 307 transitions.
[2025-05-07 17:25:36,290 INFO  L79                 Accepts]: Start accepts. Automaton has 204 states and 307 transitions. Word has length 101
[2025-05-07 17:25:36,290 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:36,290 INFO  L485      AbstractCegarLoop]: Abstraction has 204 states and 307 transitions.
[2025-05-07 17:25:36,290 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 8 states have (on average 5.25) internal successors, (42), 10 states have internal predecessors, (42), 5 states have call successors, (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:25:36,290 INFO  L278                IsEmpty]: Start isEmpty. Operand 204 states and 307 transitions.
[2025-05-07 17:25:36,292 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-05-07 17:25:36,292 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:36,292 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:36,292 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:25:36,293 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:36,293 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:36,293 INFO  L85        PathProgramCache]: Analyzing trace with hash 1213503313, now seen corresponding path program 1 times
[2025-05-07 17:25:36,293 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:36,293 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87333431]
[2025-05-07 17:25:36,293 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:36,293 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:36,317 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-05-07 17:25:36,328 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-05-07 17:25:36,329 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:36,329 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:36,404 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-05-07 17:25:36,404 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:36,404 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87333431]
[2025-05-07 17:25:36,404 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87333431] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:36,404 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:36,405 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:25:36,405 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424102116]
[2025-05-07 17:25:36,405 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:36,405 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:25:36,405 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:36,406 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:25:36,406 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:25:36,406 INFO  L87              Difference]: Start difference. First operand 204 states and 307 transitions. Second operand  has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:25:36,441 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:36,441 INFO  L93              Difference]: Finished difference Result 209 states and 313 transitions.
[2025-05-07 17:25:36,442 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:25:36,442 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27) Word has length 109
[2025-05-07 17:25:36,442 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:36,443 INFO  L225             Difference]: With dead ends: 209
[2025-05-07 17:25:36,443 INFO  L226             Difference]: Without dead ends: 209
[2025-05-07 17:25:36,443 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:25:36,444 INFO  L437           NwaCegarLoop]: 256 mSDtfsCounter, 1 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:36,444 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1260 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:36,445 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 209 states.
[2025-05-07 17:25:36,452 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209.
[2025-05-07 17:25:36,452 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 209 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 85 states have internal predecessors, (85), 82 states have call successors, (90), 39 states have call predecessors, (90), 49 states have return successors, (138), 84 states have call predecessors, (138), 82 states have call successors, (138)
[2025-05-07 17:25:36,453 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 313 transitions.
[2025-05-07 17:25:36,453 INFO  L79                 Accepts]: Start accepts. Automaton has 209 states and 313 transitions. Word has length 109
[2025-05-07 17:25:36,454 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:36,454 INFO  L485      AbstractCegarLoop]: Abstraction has 209 states and 313 transitions.
[2025-05-07 17:25:36,454 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:25:36,454 INFO  L278                IsEmpty]: Start isEmpty. Operand 209 states and 313 transitions.
[2025-05-07 17:25:36,456 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2025-05-07 17:25:36,456 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:36,456 INFO  L218           NwaCegarLoop]: trace histogram [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, 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:25:36,456 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:25:36,456 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:36,456 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:36,456 INFO  L85        PathProgramCache]: Analyzing trace with hash -1161444614, now seen corresponding path program 1 times
[2025-05-07 17:25:36,456 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:36,456 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165482826]
[2025-05-07 17:25:36,457 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:36,457 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:36,483 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-05-07 17:25:36,502 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-05-07 17:25:36,502 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:36,502 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:36,709 INFO  L134       CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked.
[2025-05-07 17:25:36,709 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:36,709 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165482826]
[2025-05-07 17:25:36,709 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165482826] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:25:36,709 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281379745]
[2025-05-07 17:25:36,709 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:36,710 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:36,712 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:36,714 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:25:36,714 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:25:37,063 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-05-07 17:25:37,229 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-05-07 17:25:37,229 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:37,229 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:37,237 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1932 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-05-07 17:25:37,248 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:25:37,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 63 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-05-07 17:25:37,364 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:25:37,364 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281379745] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:37,364 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:25:37,364 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2025-05-07 17:25:37,364 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548824154]
[2025-05-07 17:25:37,364 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:37,365 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-05-07 17:25:37,365 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:37,365 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-05-07 17:25:37,365 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272
[2025-05-07 17:25:37,366 INFO  L87              Difference]: Start difference. First operand 209 states and 313 transitions. Second operand  has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (30), 2 states have call predecessors, (30), 8 states have return successors, (34), 9 states have call predecessors, (34), 4 states have call successors, (34)
[2025-05-07 17:25:37,512 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:37,512 INFO  L93              Difference]: Finished difference Result 213 states and 322 transitions.
[2025-05-07 17:25:37,512 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-05-07 17:25:37,513 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (30), 2 states have call predecessors, (30), 8 states have return successors, (34), 9 states have call predecessors, (34), 4 states have call successors, (34) Word has length 123
[2025-05-07 17:25:37,513 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:37,514 INFO  L225             Difference]: With dead ends: 213
[2025-05-07 17:25:37,514 INFO  L226             Difference]: Without dead ends: 213
[2025-05-07 17:25:37,514 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272
[2025-05-07 17:25:37,514 INFO  L437           NwaCegarLoop]: 243 mSDtfsCounter, 1 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:37,515 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1906 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:25:37,515 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 213 states.
[2025-05-07 17:25:37,520 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211.
[2025-05-07 17:25:37,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 211 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 86 states have internal predecessors, (86), 82 states have call successors, (90), 39 states have call predecessors, (90), 50 states have return successors, (144), 85 states have call predecessors, (144), 82 states have call successors, (144)
[2025-05-07 17:25:37,523 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 320 transitions.
[2025-05-07 17:25:37,523 INFO  L79                 Accepts]: Start accepts. Automaton has 211 states and 320 transitions. Word has length 123
[2025-05-07 17:25:37,523 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:37,523 INFO  L485      AbstractCegarLoop]: Abstraction has 211 states and 320 transitions.
[2025-05-07 17:25:37,523 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (30), 2 states have call predecessors, (30), 8 states have return successors, (34), 9 states have call predecessors, (34), 4 states have call successors, (34)
[2025-05-07 17:25:37,524 INFO  L278                IsEmpty]: Start isEmpty. Operand 211 states and 320 transitions.
[2025-05-07 17:25:37,525 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-05-07 17:25:37,526 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:37,526 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:37,532 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:25:37,726 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-05-07 17:25:37,727 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:37,728 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:37,728 INFO  L85        PathProgramCache]: Analyzing trace with hash -1711468170, now seen corresponding path program 1 times
[2025-05-07 17:25:37,728 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:37,728 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777716443]
[2025-05-07 17:25:37,729 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:37,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:37,823 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-05-07 17:25:37,853 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-05-07 17:25:37,853 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:37,853 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:38,113 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:38,113 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:38,113 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777716443]
[2025-05-07 17:25:38,113 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777716443] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:38,113 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:38,113 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:25:38,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112872945]
[2025-05-07 17:25:38,113 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:38,114 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:25:38,114 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:38,114 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:25:38,114 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:38,114 INFO  L87              Difference]: Start difference. First operand 211 states and 320 transitions. Second operand  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 13 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:25:38,398 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:38,398 INFO  L93              Difference]: Finished difference Result 217 states and 340 transitions.
[2025-05-07 17:25:38,399 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:25:38,399 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 13 states have call predecessors, (25), 5 states have call successors, (25) Word has length 92
[2025-05-07 17:25:38,399 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:38,400 INFO  L225             Difference]: With dead ends: 217
[2025-05-07 17:25:38,400 INFO  L226             Difference]: Without dead ends: 217
[2025-05-07 17:25:38,400 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:25:38,401 INFO  L437           NwaCegarLoop]: 244 mSDtfsCounter, 2 mSDsluCounter, 2878 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3122 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:38,401 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3122 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:25:38,401 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 217 states.
[2025-05-07 17:25:38,407 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217.
[2025-05-07 17:25:38,408 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 217 states, 82 states have (on average 1.0853658536585367) internal successors, (89), 89 states have internal predecessors, (89), 82 states have call successors, (90), 39 states have call predecessors, (90), 53 states have return successors, (161), 88 states have call predecessors, (161), 82 states have call successors, (161)
[2025-05-07 17:25:38,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 340 transitions.
[2025-05-07 17:25:38,409 INFO  L79                 Accepts]: Start accepts. Automaton has 217 states and 340 transitions. Word has length 92
[2025-05-07 17:25:38,409 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:38,409 INFO  L485      AbstractCegarLoop]: Abstraction has 217 states and 340 transitions.
[2025-05-07 17:25:38,409 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 13 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:25:38,410 INFO  L278                IsEmpty]: Start isEmpty. Operand 217 states and 340 transitions.
[2025-05-07 17:25:38,412 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-05-07 17:25:38,412 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:38,412 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:38,412 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-05-07 17:25:38,412 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:38,412 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:38,412 INFO  L85        PathProgramCache]: Analyzing trace with hash -1665148628, now seen corresponding path program 1 times
[2025-05-07 17:25:38,412 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:38,412 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451837962]
[2025-05-07 17:25:38,413 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:38,413 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:38,440 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-05-07 17:25:38,448 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-05-07 17:25:38,448 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:38,448 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:38,703 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:25:38,703 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:38,703 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451837962]
[2025-05-07 17:25:38,703 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451837962] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:38,703 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:38,703 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:25:38,703 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260607631]
[2025-05-07 17:25:38,703 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:38,704 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:25:38,704 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:38,704 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:25:38,705 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:38,705 INFO  L87              Difference]: Start difference. First operand 217 states and 340 transitions. Second operand  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 13 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:25:39,008 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:39,009 INFO  L93              Difference]: Finished difference Result 215 states and 337 transitions.
[2025-05-07 17:25:39,009 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:25:39,009 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 13 states have call predecessors, (25), 5 states have call successors, (25) Word has length 92
[2025-05-07 17:25:39,010 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:39,011 INFO  L225             Difference]: With dead ends: 215
[2025-05-07 17:25:39,011 INFO  L226             Difference]: Without dead ends: 212
[2025-05-07 17:25:39,012 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:25:39,012 INFO  L437           NwaCegarLoop]: 240 mSDtfsCounter, 1 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:39,012 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3074 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:25:39,013 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 212 states.
[2025-05-07 17:25:39,022 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 206.
[2025-05-07 17:25:39,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 206 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 84 states have internal predecessors, (84), 80 states have call successors, (87), 38 states have call predecessors, (87), 49 states have return successors, (141), 83 states have call predecessors, (141), 80 states have call successors, (141)
[2025-05-07 17:25:39,024 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 312 transitions.
[2025-05-07 17:25:39,024 INFO  L79                 Accepts]: Start accepts. Automaton has 206 states and 312 transitions. Word has length 92
[2025-05-07 17:25:39,024 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:39,024 INFO  L485      AbstractCegarLoop]: Abstraction has 206 states and 312 transitions.
[2025-05-07 17:25:39,024 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 13 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:25:39,024 INFO  L278                IsEmpty]: Start isEmpty. Operand 206 states and 312 transitions.
[2025-05-07 17:25:39,026 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2025-05-07 17:25:39,026 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:39,026 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:39,026 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-05-07 17:25:39,026 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:39,026 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:39,026 INFO  L85        PathProgramCache]: Analyzing trace with hash -652558143, now seen corresponding path program 1 times
[2025-05-07 17:25:39,026 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:39,026 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399020540]
[2025-05-07 17:25:39,027 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:39,027 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:39,052 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes.
[2025-05-07 17:25:39,063 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements.
[2025-05-07 17:25:39,063 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:39,063 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:39,245 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:25:39,246 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:39,246 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399020540]
[2025-05-07 17:25:39,246 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399020540] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:39,246 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:39,246 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-05-07 17:25:39,246 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249450252]
[2025-05-07 17:25:39,246 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:39,246 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-05-07 17:25:39,246 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:39,247 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-05-07 17:25:39,247 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132
[2025-05-07 17:25:39,247 INFO  L87              Difference]: Start difference. First operand 206 states and 312 transitions. Second operand  has 12 states, 10 states have (on average 3.8) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (23), 10 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:25:39,491 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:39,491 INFO  L93              Difference]: Finished difference Result 206 states and 311 transitions.
[2025-05-07 17:25:39,491 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-05-07 17:25:39,492 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 10 states have (on average 3.8) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (23), 10 states have call predecessors, (23), 5 states have call successors, (23) Word has length 84
[2025-05-07 17:25:39,492 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:39,493 INFO  L225             Difference]: With dead ends: 206
[2025-05-07 17:25:39,493 INFO  L226             Difference]: Without dead ends: 206
[2025-05-07 17:25:39,493 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:25:39,493 INFO  L437           NwaCegarLoop]: 240 mSDtfsCounter, 2 mSDsluCounter, 2358 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2598 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:39,493 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2598 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:25:39,494 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 206 states.
[2025-05-07 17:25:39,498 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206.
[2025-05-07 17:25:39,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 206 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 84 states have internal predecessors, (84), 80 states have call successors, (87), 38 states have call predecessors, (87), 49 states have return successors, (140), 83 states have call predecessors, (140), 80 states have call successors, (140)
[2025-05-07 17:25:39,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 311 transitions.
[2025-05-07 17:25:39,500 INFO  L79                 Accepts]: Start accepts. Automaton has 206 states and 311 transitions. Word has length 84
[2025-05-07 17:25:39,500 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:39,500 INFO  L485      AbstractCegarLoop]: Abstraction has 206 states and 311 transitions.
[2025-05-07 17:25:39,500 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 10 states have (on average 3.8) internal successors, (38), 12 states have internal predecessors, (38), 5 states have call successors, (23), 1 states have call predecessors, (23), 10 states have return successors, (23), 10 states have call predecessors, (23), 5 states have call successors, (23)
[2025-05-07 17:25:39,500 INFO  L278                IsEmpty]: Start isEmpty. Operand 206 states and 311 transitions.
[2025-05-07 17:25:39,501 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 110
[2025-05-07 17:25:39,501 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:39,501 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:39,501 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-05-07 17:25:39,501 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:39,501 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:39,502 INFO  L85        PathProgramCache]: Analyzing trace with hash -1187860699, now seen corresponding path program 1 times
[2025-05-07 17:25:39,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:39,502 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52081746]
[2025-05-07 17:25:39,502 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:39,502 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:39,531 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes.
[2025-05-07 17:25:39,542 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements.
[2025-05-07 17:25:39,542 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:39,542 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:39,617 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-05-07 17:25:39,617 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:39,617 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52081746]
[2025-05-07 17:25:39,617 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52081746] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:39,617 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:39,617 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:25:39,617 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420981172]
[2025-05-07 17:25:39,618 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:39,618 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:25:39,618 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:39,618 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:25:39,618 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:25:39,619 INFO  L87              Difference]: Start difference. First operand 206 states and 311 transitions. Second operand  has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:25:39,657 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:39,657 INFO  L93              Difference]: Finished difference Result 211 states and 317 transitions.
[2025-05-07 17:25:39,657 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:25:39,657 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27) Word has length 109
[2025-05-07 17:25:39,658 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:39,659 INFO  L225             Difference]: With dead ends: 211
[2025-05-07 17:25:39,659 INFO  L226             Difference]: Without dead ends: 211
[2025-05-07 17:25:39,659 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:25:39,659 INFO  L437           NwaCegarLoop]: 248 mSDtfsCounter, 1 mSDsluCounter, 972 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:39,659 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1220 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:39,660 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2025-05-07 17:25:39,664 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206.
[2025-05-07 17:25:39,665 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 206 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 84 states have internal predecessors, (84), 80 states have call successors, (87), 38 states have call predecessors, (87), 49 states have return successors, (140), 83 states have call predecessors, (140), 80 states have call successors, (140)
[2025-05-07 17:25:39,665 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 311 transitions.
[2025-05-07 17:25:39,666 INFO  L79                 Accepts]: Start accepts. Automaton has 206 states and 311 transitions. Word has length 109
[2025-05-07 17:25:39,666 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:39,666 INFO  L485      AbstractCegarLoop]: Abstraction has 206 states and 311 transitions.
[2025-05-07 17:25:39,666 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:25:39,666 INFO  L278                IsEmpty]: Start isEmpty. Operand 206 states and 311 transitions.
[2025-05-07 17:25:39,667 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 140
[2025-05-07 17:25:39,667 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:39,667 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:39,667 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-05-07 17:25:39,667 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:39,667 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:39,667 INFO  L85        PathProgramCache]: Analyzing trace with hash 1208483862, now seen corresponding path program 1 times
[2025-05-07 17:25:39,667 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:39,667 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146906694]
[2025-05-07 17:25:39,668 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:39,668 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:39,703 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes.
[2025-05-07 17:25:39,712 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements.
[2025-05-07 17:25:39,712 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:39,712 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:40,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 61 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2025-05-07 17:25:40,072 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:40,072 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146906694]
[2025-05-07 17:25:40,072 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146906694] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:25:40,072 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972617545]
[2025-05-07 17:25:40,072 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:40,072 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:40,074 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:40,076 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:25:40,077 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-05-07 17:25:40,453 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes.
[2025-05-07 17:25:40,691 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements.
[2025-05-07 17:25:40,691 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:40,691 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:40,697 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2208 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-05-07 17:25:40,701 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:25:40,836 INFO  L134       CoverageAnalysis]: Checked inductivity of 61 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-05-07 17:25:40,836 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:25:40,836 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972617545] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:40,836 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:25:40,836 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21
[2025-05-07 17:25:40,836 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952373093]
[2025-05-07 17:25:40,836 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:40,836 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-05-07 17:25:40,837 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:40,837 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-05-07 17:25:40,837 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420
[2025-05-07 17:25:40,837 INFO  L87              Difference]: Start difference. First operand 206 states and 311 transitions. Second operand  has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (36), 2 states have call predecessors, (36), 10 states have return successors, (38), 11 states have call predecessors, (38), 4 states have call successors, (38)
[2025-05-07 17:25:41,033 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:41,033 INFO  L93              Difference]: Finished difference Result 210 states and 320 transitions.
[2025-05-07 17:25:41,034 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-05-07 17:25:41,034 INFO  L79                 Accepts]: Start accepts. Automaton has  has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (36), 2 states have call predecessors, (36), 10 states have return successors, (38), 11 states have call predecessors, (38), 4 states have call successors, (38) Word has length 139
[2025-05-07 17:25:41,034 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:41,035 INFO  L225             Difference]: With dead ends: 210
[2025-05-07 17:25:41,035 INFO  L226             Difference]: Without dead ends: 210
[2025-05-07 17:25:41,036 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420
[2025-05-07 17:25:41,036 INFO  L437           NwaCegarLoop]: 237 mSDtfsCounter, 1 mSDsluCounter, 2085 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2322 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:41,036 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2322 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:25:41,037 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 210 states.
[2025-05-07 17:25:41,045 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 206.
[2025-05-07 17:25:41,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 206 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 84 states have internal predecessors, (84), 80 states have call successors, (87), 38 states have call predecessors, (87), 49 states have return successors, (140), 83 states have call predecessors, (140), 80 states have call successors, (140)
[2025-05-07 17:25:41,047 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 311 transitions.
[2025-05-07 17:25:41,047 INFO  L79                 Accepts]: Start accepts. Automaton has 206 states and 311 transitions. Word has length 139
[2025-05-07 17:25:41,047 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:41,047 INFO  L485      AbstractCegarLoop]: Abstraction has 206 states and 311 transitions.
[2025-05-07 17:25:41,048 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 4 states have call successors, (36), 2 states have call predecessors, (36), 10 states have return successors, (38), 11 states have call predecessors, (38), 4 states have call successors, (38)
[2025-05-07 17:25:41,048 INFO  L278                IsEmpty]: Start isEmpty. Operand 206 states and 311 transitions.
[2025-05-07 17:25:41,049 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-05-07 17:25:41,049 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:41,049 INFO  L218           NwaCegarLoop]: trace histogram [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, 1, 1, 1, 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:25:41,055 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-05-07 17:25:41,250 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2025-05-07 17:25:41,251 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:41,252 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:41,252 INFO  L85        PathProgramCache]: Analyzing trace with hash -288801741, now seen corresponding path program 1 times
[2025-05-07 17:25:41,253 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:41,253 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70384215]
[2025-05-07 17:25:41,253 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:41,254 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:41,323 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-05-07 17:25:41,332 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-05-07 17:25:41,332 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:41,332 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:41,525 INFO  L134       CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked.
[2025-05-07 17:25:41,526 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:41,526 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70384215]
[2025-05-07 17:25:41,526 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70384215] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:25:41,526 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580555930]
[2025-05-07 17:25:41,526 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:41,526 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:41,528 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:41,529 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:25:41,530 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-05-07 17:25:41,916 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-05-07 17:25:42,045 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-05-07 17:25:42,045 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:42,045 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:42,050 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1998 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-05-07 17:25:42,054 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:25:42,111 INFO  L134       CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2025-05-07 17:25:42,111 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:25:42,111 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580555930] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:42,111 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:25:42,111 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14
[2025-05-07 17:25:42,111 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798840055]
[2025-05-07 17:25:42,111 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:42,112 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:25:42,112 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:42,112 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:25:42,112 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:42,112 INFO  L87              Difference]: Start difference. First operand 206 states and 311 transitions. Second operand  has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:25:42,144 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:42,144 INFO  L93              Difference]: Finished difference Result 211 states and 317 transitions.
[2025-05-07 17:25:42,144 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:25:42,144 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25) Word has length 126
[2025-05-07 17:25:42,145 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:42,145 INFO  L225             Difference]: With dead ends: 211
[2025-05-07 17:25:42,145 INFO  L226             Difference]: Without dead ends: 211
[2025-05-07 17:25:42,146 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:42,146 INFO  L437           NwaCegarLoop]: 248 mSDtfsCounter, 1 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:42,146 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1219 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:42,146 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2025-05-07 17:25:42,150 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206.
[2025-05-07 17:25:42,151 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 206 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 84 states have internal predecessors, (84), 80 states have call successors, (87), 38 states have call predecessors, (87), 49 states have return successors, (140), 83 states have call predecessors, (140), 80 states have call successors, (140)
[2025-05-07 17:25:42,151 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 311 transitions.
[2025-05-07 17:25:42,151 INFO  L79                 Accepts]: Start accepts. Automaton has 206 states and 311 transitions. Word has length 126
[2025-05-07 17:25:42,151 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:42,152 INFO  L485      AbstractCegarLoop]: Abstraction has 206 states and 311 transitions.
[2025-05-07 17:25:42,152 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (25), 1 states have call predecessors, (25), 5 states have return successors, (25), 6 states have call predecessors, (25), 4 states have call successors, (25)
[2025-05-07 17:25:42,152 INFO  L278                IsEmpty]: Start isEmpty. Operand 206 states and 311 transitions.
[2025-05-07 17:25:42,152 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2025-05-07 17:25:42,153 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:42,153 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:42,160 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-05-07 17:25:42,353 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:42,354 INFO  L403      AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:42,354 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:42,355 INFO  L85        PathProgramCache]: Analyzing trace with hash -73078601, now seen corresponding path program 1 times
[2025-05-07 17:25:42,355 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:42,355 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283210163]
[2025-05-07 17:25:42,355 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:42,355 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:42,419 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes.
[2025-05-07 17:25:42,427 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements.
[2025-05-07 17:25:42,427 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:42,427 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:42,686 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-05-07 17:25:42,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:42,687 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283210163]
[2025-05-07 17:25:42,687 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283210163] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:42,687 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:42,687 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:25:42,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641970762]
[2025-05-07 17:25:42,687 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:42,687 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:25:42,687 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:42,688 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:25:42,688 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:42,688 INFO  L87              Difference]: Start difference. First operand 206 states and 311 transitions. Second operand  has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 5 states have call successors, (29), 1 states have call predecessors, (29), 12 states have return successors, (31), 13 states have call predecessors, (31), 5 states have call successors, (31)
[2025-05-07 17:25:42,913 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:42,913 INFO  L93              Difference]: Finished difference Result 214 states and 330 transitions.
[2025-05-07 17:25:42,913 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:25:42,913 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), 5 states have call successors, (29), 1 states have call predecessors, (29), 12 states have return successors, (31), 13 states have call predecessors, (31), 5 states have call successors, (31) Word has length 114
[2025-05-07 17:25:42,913 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:42,914 INFO  L225             Difference]: With dead ends: 214
[2025-05-07 17:25:42,914 INFO  L226             Difference]: Without dead ends: 214
[2025-05-07 17:25:42,914 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:25:42,915 INFO  L437           NwaCegarLoop]: 239 mSDtfsCounter, 2 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3057 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:42,915 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3057 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:25:42,915 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 214 states.
[2025-05-07 17:25:42,920 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210.
[2025-05-07 17:25:42,920 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 210 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 86 states have internal predecessors, (86), 80 states have call successors, (87), 38 states have call predecessors, (87), 51 states have return successors, (145), 85 states have call predecessors, (145), 80 states have call successors, (145)
[2025-05-07 17:25:42,921 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 318 transitions.
[2025-05-07 17:25:42,921 INFO  L79                 Accepts]: Start accepts. Automaton has 210 states and 318 transitions. Word has length 114
[2025-05-07 17:25:42,921 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:42,921 INFO  L485      AbstractCegarLoop]: Abstraction has 210 states and 318 transitions.
[2025-05-07 17:25:42,921 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), 5 states have call successors, (29), 1 states have call predecessors, (29), 12 states have return successors, (31), 13 states have call predecessors, (31), 5 states have call successors, (31)
[2025-05-07 17:25:42,921 INFO  L278                IsEmpty]: Start isEmpty. Operand 210 states and 318 transitions.
[2025-05-07 17:25:42,922 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 115
[2025-05-07 17:25:42,922 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:42,923 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:42,923 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-05-07 17:25:42,923 INFO  L403      AbstractCegarLoop]: === Iteration 20 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:42,923 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:42,923 INFO  L85        PathProgramCache]: Analyzing trace with hash 756581057, now seen corresponding path program 1 times
[2025-05-07 17:25:42,923 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:42,923 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148021790]
[2025-05-07 17:25:42,923 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:42,923 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:42,948 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes.
[2025-05-07 17:25:42,956 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements.
[2025-05-07 17:25:42,956 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:42,956 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:43,198 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-05-07 17:25:43,198 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:43,198 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148021790]
[2025-05-07 17:25:43,198 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148021790] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:43,198 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:43,198 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:25:43,198 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890654711]
[2025-05-07 17:25:43,198 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:43,199 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:25:43,199 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:43,199 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:25:43,199 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:43,200 INFO  L87              Difference]: Start difference. First operand 210 states and 318 transitions. Second operand  has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 5 states have call successors, (29), 1 states have call predecessors, (29), 12 states have return successors, (31), 13 states have call predecessors, (31), 5 states have call successors, (31)
[2025-05-07 17:25:43,403 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:43,403 INFO  L93              Difference]: Finished difference Result 209 states and 315 transitions.
[2025-05-07 17:25:43,403 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:25:43,404 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), 5 states have call successors, (29), 1 states have call predecessors, (29), 12 states have return successors, (31), 13 states have call predecessors, (31), 5 states have call successors, (31) Word has length 114
[2025-05-07 17:25:43,404 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:43,405 INFO  L225             Difference]: With dead ends: 209
[2025-05-07 17:25:43,405 INFO  L226             Difference]: Without dead ends: 207
[2025-05-07 17:25:43,405 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:25:43,405 INFO  L437           NwaCegarLoop]: 235 mSDtfsCounter, 1 mSDsluCounter, 2774 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3009 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:43,406 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3009 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:25:43,406 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 207 states.
[2025-05-07 17:25:43,410 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 199.
[2025-05-07 17:25:43,410 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 199 states, 75 states have (on average 1.08) internal successors, (81), 81 states have internal predecessors, (81), 77 states have call successors, (84), 38 states have call predecessors, (84), 47 states have return successors, (118), 79 states have call predecessors, (118), 77 states have call successors, (118)
[2025-05-07 17:25:43,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 283 transitions.
[2025-05-07 17:25:43,411 INFO  L79                 Accepts]: Start accepts. Automaton has 199 states and 283 transitions. Word has length 114
[2025-05-07 17:25:43,411 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:43,411 INFO  L485      AbstractCegarLoop]: Abstraction has 199 states and 283 transitions.
[2025-05-07 17:25:43,411 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), 5 states have call successors, (29), 1 states have call predecessors, (29), 12 states have return successors, (31), 13 states have call predecessors, (31), 5 states have call successors, (31)
[2025-05-07 17:25:43,411 INFO  L278                IsEmpty]: Start isEmpty. Operand 199 states and 283 transitions.
[2025-05-07 17:25:43,412 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2025-05-07 17:25:43,412 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:43,412 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:43,412 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-05-07 17:25:43,412 INFO  L403      AbstractCegarLoop]: === Iteration 21 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:43,413 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:43,413 INFO  L85        PathProgramCache]: Analyzing trace with hash -1325248438, now seen corresponding path program 1 times
[2025-05-07 17:25:43,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:43,413 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686310591]
[2025-05-07 17:25:43,413 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:43,413 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:43,434 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-05-07 17:25:43,440 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-05-07 17:25:43,440 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:43,440 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:43,672 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:25:43,672 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:43,672 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686310591]
[2025-05-07 17:25:43,672 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686310591] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:43,672 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:43,672 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:25:43,673 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102892999]
[2025-05-07 17:25:43,673 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:43,673 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:25:43,673 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:43,673 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:25:43,673 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:43,674 INFO  L87              Difference]: Start difference. First operand 199 states and 283 transitions. Second operand  has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (24), 12 states have call predecessors, (24), 5 states have call successors, (24)
[2025-05-07 17:25:43,908 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:43,908 INFO  L93              Difference]: Finished difference Result 207 states and 303 transitions.
[2025-05-07 17:25:43,909 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:25:43,909 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (24), 12 states have call predecessors, (24), 5 states have call successors, (24) Word has length 89
[2025-05-07 17:25:43,909 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:43,909 INFO  L225             Difference]: With dead ends: 207
[2025-05-07 17:25:43,910 INFO  L226             Difference]: Without dead ends: 207
[2025-05-07 17:25:43,910 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:25:43,910 INFO  L437           NwaCegarLoop]: 231 mSDtfsCounter, 2 mSDsluCounter, 2722 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2953 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:43,910 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2953 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:25:43,911 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 207 states.
[2025-05-07 17:25:43,915 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205.
[2025-05-07 17:25:43,915 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 205 states, 78 states have (on average 1.0769230769230769) internal successors, (84), 84 states have internal predecessors, (84), 77 states have call successors, (84), 38 states have call predecessors, (84), 50 states have return successors, (133), 82 states have call predecessors, (133), 77 states have call successors, (133)
[2025-05-07 17:25:43,916 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 301 transitions.
[2025-05-07 17:25:43,916 INFO  L79                 Accepts]: Start accepts. Automaton has 205 states and 301 transitions. Word has length 89
[2025-05-07 17:25:43,916 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:43,916 INFO  L485      AbstractCegarLoop]: Abstraction has 205 states and 301 transitions.
[2025-05-07 17:25:43,916 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (24), 12 states have call predecessors, (24), 5 states have call successors, (24)
[2025-05-07 17:25:43,916 INFO  L278                IsEmpty]: Start isEmpty. Operand 205 states and 301 transitions.
[2025-05-07 17:25:43,917 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 90
[2025-05-07 17:25:43,917 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:43,917 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:43,917 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-05-07 17:25:43,917 INFO  L403      AbstractCegarLoop]: === Iteration 22 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:43,917 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:43,917 INFO  L85        PathProgramCache]: Analyzing trace with hash -495588780, now seen corresponding path program 1 times
[2025-05-07 17:25:43,917 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:43,917 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136449101]
[2025-05-07 17:25:43,918 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:43,918 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:43,943 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes.
[2025-05-07 17:25:43,954 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements.
[2025-05-07 17:25:43,954 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:43,954 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:44,144 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:25:44,144 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:44,144 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136449101]
[2025-05-07 17:25:44,144 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136449101] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:44,144 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:44,144 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:25:44,144 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168332101]
[2025-05-07 17:25:44,144 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:44,145 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:25:44,145 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:44,145 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:25:44,145 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:44,146 INFO  L87              Difference]: Start difference. First operand 205 states and 301 transitions. Second operand  has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (24), 12 states have call predecessors, (24), 5 states have call successors, (24)
[2025-05-07 17:25:44,415 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:44,415 INFO  L93              Difference]: Finished difference Result 204 states and 298 transitions.
[2025-05-07 17:25:44,416 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:25:44,416 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (24), 12 states have call predecessors, (24), 5 states have call successors, (24) Word has length 89
[2025-05-07 17:25:44,416 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:44,417 INFO  L225             Difference]: With dead ends: 204
[2025-05-07 17:25:44,417 INFO  L226             Difference]: Without dead ends: 203
[2025-05-07 17:25:44,417 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:25:44,418 INFO  L437           NwaCegarLoop]: 228 mSDtfsCounter, 1 mSDsluCounter, 2691 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2919 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:44,419 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2919 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:25:44,419 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 203 states.
[2025-05-07 17:25:44,425 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 197.
[2025-05-07 17:25:44,426 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 197 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 80 states have internal predecessors, (80), 75 states have call successors, (82), 38 states have call predecessors, (82), 47 states have return successors, (116), 78 states have call predecessors, (116), 75 states have call successors, (116)
[2025-05-07 17:25:44,427 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 278 transitions.
[2025-05-07 17:25:44,427 INFO  L79                 Accepts]: Start accepts. Automaton has 197 states and 278 transitions. Word has length 89
[2025-05-07 17:25:44,427 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:44,427 INFO  L485      AbstractCegarLoop]: Abstraction has 197 states and 278 transitions.
[2025-05-07 17:25:44,427 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (24), 1 states have call predecessors, (24), 12 states have return successors, (24), 12 states have call predecessors, (24), 5 states have call successors, (24)
[2025-05-07 17:25:44,427 INFO  L278                IsEmpty]: Start isEmpty. Operand 197 states and 278 transitions.
[2025-05-07 17:25:44,429 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-05-07 17:25:44,429 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:44,429 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:44,429 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-05-07 17:25:44,429 INFO  L403      AbstractCegarLoop]: === Iteration 23 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:44,429 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:44,429 INFO  L85        PathProgramCache]: Analyzing trace with hash -137252652, now seen corresponding path program 1 times
[2025-05-07 17:25:44,429 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:44,429 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352591798]
[2025-05-07 17:25:44,429 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:44,430 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:44,476 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-05-07 17:25:44,487 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-05-07 17:25:44,488 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:44,488 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:44,700 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2025-05-07 17:25:44,700 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:44,700 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352591798]
[2025-05-07 17:25:44,700 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352591798] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:25:44,700 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911523905]
[2025-05-07 17:25:44,700 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:44,701 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:44,703 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:44,704 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:25:44,705 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-05-07 17:25:45,092 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-05-07 17:25:45,313 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-05-07 17:25:45,313 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:45,313 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:45,319 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2273 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-05-07 17:25:45,322 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:25:45,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked.
[2025-05-07 17:25:45,371 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:25:45,371 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [911523905] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:45,371 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:25:45,371 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14
[2025-05-07 17:25:45,372 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423534056]
[2025-05-07 17:25:45,372 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:45,372 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:25:45,372 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:45,372 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:25:45,372 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:45,372 INFO  L87              Difference]: Start difference. First operand 197 states and 278 transitions. Second operand  has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (31), 1 states have call predecessors, (31), 5 states have return successors, (31), 6 states have call predecessors, (31), 4 states have call successors, (31)
[2025-05-07 17:25:45,396 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:45,396 INFO  L93              Difference]: Finished difference Result 202 states and 284 transitions.
[2025-05-07 17:25:45,397 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:25:45,397 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (31), 1 states have call predecessors, (31), 5 states have return successors, (31), 6 states have call predecessors, (31), 4 states have call successors, (31) Word has length 142
[2025-05-07 17:25:45,397 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:45,397 INFO  L225             Difference]: With dead ends: 202
[2025-05-07 17:25:45,397 INFO  L226             Difference]: Without dead ends: 202
[2025-05-07 17:25:45,398 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:45,398 INFO  L437           NwaCegarLoop]: 235 mSDtfsCounter, 1 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:45,398 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1156 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:45,398 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 202 states.
[2025-05-07 17:25:45,401 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197.
[2025-05-07 17:25:45,402 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 197 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 80 states have internal predecessors, (80), 75 states have call successors, (82), 38 states have call predecessors, (82), 47 states have return successors, (116), 78 states have call predecessors, (116), 75 states have call successors, (116)
[2025-05-07 17:25:45,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 278 transitions.
[2025-05-07 17:25:45,402 INFO  L79                 Accepts]: Start accepts. Automaton has 197 states and 278 transitions. Word has length 142
[2025-05-07 17:25:45,402 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:45,402 INFO  L485      AbstractCegarLoop]: Abstraction has 197 states and 278 transitions.
[2025-05-07 17:25:45,403 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (31), 1 states have call predecessors, (31), 5 states have return successors, (31), 6 states have call predecessors, (31), 4 states have call successors, (31)
[2025-05-07 17:25:45,403 INFO  L278                IsEmpty]: Start isEmpty. Operand 197 states and 278 transitions.
[2025-05-07 17:25:45,403 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 165
[2025-05-07 17:25:45,403 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:45,403 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1]
[2025-05-07 17:25:45,409 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-05-07 17:25:45,604 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2025-05-07 17:25:45,604 INFO  L403      AbstractCegarLoop]: === Iteration 24 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:45,605 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:45,605 INFO  L85        PathProgramCache]: Analyzing trace with hash 1084328099, now seen corresponding path program 1 times
[2025-05-07 17:25:45,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:45,606 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266903693]
[2025-05-07 17:25:45,606 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:45,606 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:45,737 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes.
[2025-05-07 17:25:45,749 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements.
[2025-05-07 17:25:45,749 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:45,749 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:46,000 INFO  L134       CoverageAnalysis]: Checked inductivity of 111 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-05-07 17:25:46,000 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:46,000 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266903693]
[2025-05-07 17:25:46,000 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266903693] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:25:46,000 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2147081838]
[2025-05-07 17:25:46,000 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:46,000 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:46,002 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:46,003 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:25:46,004 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-05-07 17:25:46,397 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes.
[2025-05-07 17:25:46,608 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements.
[2025-05-07 17:25:46,608 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:46,608 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:46,616 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2659 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-05-07 17:25:46,620 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:25:46,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 111 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked.
[2025-05-07 17:25:46,704 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:25:46,704 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2147081838] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:46,704 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:25:46,704 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 17
[2025-05-07 17:25:46,704 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362267092]
[2025-05-07 17:25:46,705 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:46,705 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-05-07 17:25:46,705 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:46,705 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-05-07 17:25:46,705 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272
[2025-05-07 17:25:46,705 INFO  L87              Difference]: Start difference. First operand 197 states and 278 transitions. Second operand  has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (33), 2 states have call predecessors, (33), 8 states have return successors, (37), 9 states have call predecessors, (37), 4 states have call successors, (37)
[2025-05-07 17:25:46,809 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:46,809 INFO  L93              Difference]: Finished difference Result 201 states and 284 transitions.
[2025-05-07 17:25:46,810 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-05-07 17:25:46,810 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (33), 2 states have call predecessors, (33), 8 states have return successors, (37), 9 states have call predecessors, (37), 4 states have call successors, (37) Word has length 164
[2025-05-07 17:25:46,810 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:46,811 INFO  L225             Difference]: With dead ends: 201
[2025-05-07 17:25:46,811 INFO  L226             Difference]: Without dead ends: 201
[2025-05-07 17:25:46,811 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272
[2025-05-07 17:25:46,811 INFO  L437           NwaCegarLoop]: 222 mSDtfsCounter, 1 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1747 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:46,811 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1747 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:25:46,812 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 201 states.
[2025-05-07 17:25:46,817 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199.
[2025-05-07 17:25:46,817 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 199 states, 76 states have (on average 1.0657894736842106) internal successors, (81), 81 states have internal predecessors, (81), 75 states have call successors, (82), 38 states have call predecessors, (82), 48 states have return successors, (119), 79 states have call predecessors, (119), 75 states have call successors, (119)
[2025-05-07 17:25:46,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 282 transitions.
[2025-05-07 17:25:46,819 INFO  L79                 Accepts]: Start accepts. Automaton has 199 states and 282 transitions. Word has length 164
[2025-05-07 17:25:46,819 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:46,819 INFO  L485      AbstractCegarLoop]: Abstraction has 199 states and 282 transitions.
[2025-05-07 17:25:46,819 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 8 states have (on average 6.625) internal successors, (53), 9 states have internal predecessors, (53), 4 states have call successors, (33), 2 states have call predecessors, (33), 8 states have return successors, (37), 9 states have call predecessors, (37), 4 states have call successors, (37)
[2025-05-07 17:25:46,819 INFO  L278                IsEmpty]: Start isEmpty. Operand 199 states and 282 transitions.
[2025-05-07 17:25:46,820 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2025-05-07 17:25:46,820 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:46,820 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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]
[2025-05-07 17:25:46,827 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-05-07 17:25:47,021 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:47,021 INFO  L403      AbstractCegarLoop]: === Iteration 25 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:47,022 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:47,023 INFO  L85        PathProgramCache]: Analyzing trace with hash -1266612804, now seen corresponding path program 1 times
[2025-05-07 17:25:47,023 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:47,023 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094263871]
[2025-05-07 17:25:47,023 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:47,023 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:47,159 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes.
[2025-05-07 17:25:47,172 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements.
[2025-05-07 17:25:47,172 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:47,172 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:47,416 INFO  L134       CoverageAnalysis]: Checked inductivity of 111 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-05-07 17:25:47,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:47,416 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094263871]
[2025-05-07 17:25:47,416 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094263871] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:25:47,416 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8294020]
[2025-05-07 17:25:47,416 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:47,416 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:47,418 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:47,419 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:25:47,420 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-05-07 17:25:47,764 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes.
[2025-05-07 17:25:47,988 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements.
[2025-05-07 17:25:47,989 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:47,989 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:47,996 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2527 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-05-07 17:25:47,999 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:25:48,106 INFO  L134       CoverageAnalysis]: Checked inductivity of 111 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-05-07 17:25:48,106 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:25:48,106 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [8294020] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:48,106 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:25:48,106 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19
[2025-05-07 17:25:48,106 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122155247]
[2025-05-07 17:25:48,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:48,107 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-05-07 17:25:48,107 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:48,107 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-05-07 17:25:48,107 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342
[2025-05-07 17:25:48,108 INFO  L87              Difference]: Start difference. First operand 199 states and 282 transitions. Second operand  has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (31), 2 states have call predecessors, (31), 10 states have return successors, (33), 11 states have call predecessors, (33), 4 states have call successors, (33)
[2025-05-07 17:25:48,224 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:48,224 INFO  L93              Difference]: Finished difference Result 203 states and 288 transitions.
[2025-05-07 17:25:48,224 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-05-07 17:25:48,224 INFO  L79                 Accepts]: Start accepts. Automaton has  has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (31), 2 states have call predecessors, (31), 10 states have return successors, (33), 11 states have call predecessors, (33), 4 states have call successors, (33) Word has length 156
[2025-05-07 17:25:48,225 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:48,225 INFO  L225             Difference]: With dead ends: 203
[2025-05-07 17:25:48,225 INFO  L226             Difference]: Without dead ends: 203
[2025-05-07 17:25:48,226 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342
[2025-05-07 17:25:48,226 INFO  L437           NwaCegarLoop]: 230 mSDtfsCounter, 1 mSDsluCounter, 2031 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2261 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:48,226 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2261 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:25:48,226 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 203 states.
[2025-05-07 17:25:48,230 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 199.
[2025-05-07 17:25:48,230 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 199 states, 76 states have (on average 1.0657894736842106) internal successors, (81), 81 states have internal predecessors, (81), 75 states have call successors, (82), 38 states have call predecessors, (82), 48 states have return successors, (119), 79 states have call predecessors, (119), 75 states have call successors, (119)
[2025-05-07 17:25:48,231 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 282 transitions.
[2025-05-07 17:25:48,231 INFO  L79                 Accepts]: Start accepts. Automaton has 199 states and 282 transitions. Word has length 156
[2025-05-07 17:25:48,231 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:48,231 INFO  L485      AbstractCegarLoop]: Abstraction has 199 states and 282 transitions.
[2025-05-07 17:25:48,231 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 4 states have call successors, (31), 2 states have call predecessors, (31), 10 states have return successors, (33), 11 states have call predecessors, (33), 4 states have call successors, (33)
[2025-05-07 17:25:48,232 INFO  L278                IsEmpty]: Start isEmpty. Operand 199 states and 282 transitions.
[2025-05-07 17:25:48,232 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 165
[2025-05-07 17:25:48,232 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:48,232 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1]
[2025-05-07 17:25:48,239 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-05-07 17:25:48,433 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2025-05-07 17:25:48,433 INFO  L403      AbstractCegarLoop]: === Iteration 26 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:48,433 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:48,433 INFO  L85        PathProgramCache]: Analyzing trace with hash -1662998503, now seen corresponding path program 2 times
[2025-05-07 17:25:48,433 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:48,433 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737943456]
[2025-05-07 17:25:48,433 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:25:48,433 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:48,475 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes.
[2025-05-07 17:25:48,497 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements.
[2025-05-07 17:25:48,497 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:25:48,497 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:48,758 INFO  L134       CoverageAnalysis]: Checked inductivity of 111 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-05-07 17:25:48,758 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:48,758 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737943456]
[2025-05-07 17:25:48,759 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737943456] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:25:48,759 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660913364]
[2025-05-07 17:25:48,759 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:25:48,759 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:48,761 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:48,762 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:25:48,763 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-05-07 17:25:49,191 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes.
[2025-05-07 17:25:49,397 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements.
[2025-05-07 17:25:49,397 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:25:49,397 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:49,405 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2659 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-05-07 17:25:49,408 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:25:49,537 INFO  L134       CoverageAnalysis]: Checked inductivity of 111 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-05-07 17:25:49,537 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:25:49,538 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660913364] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:49,538 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:25:49,538 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 21
[2025-05-07 17:25:49,538 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335301377]
[2025-05-07 17:25:49,538 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:49,538 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-05-07 17:25:49,538 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:49,539 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-05-07 17:25:49,539 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420
[2025-05-07 17:25:49,539 INFO  L87              Difference]: Start difference. First operand 199 states and 282 transitions. Second operand  has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (33), 2 states have call predecessors, (33), 12 states have return successors, (35), 13 states have call predecessors, (35), 4 states have call successors, (35)
[2025-05-07 17:25:49,673 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:49,673 INFO  L93              Difference]: Finished difference Result 207 states and 295 transitions.
[2025-05-07 17:25:49,674 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-05-07 17:25:49,674 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (33), 2 states have call predecessors, (33), 12 states have return successors, (35), 13 states have call predecessors, (35), 4 states have call successors, (35) Word has length 164
[2025-05-07 17:25:49,674 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:49,675 INFO  L225             Difference]: With dead ends: 207
[2025-05-07 17:25:49,675 INFO  L226             Difference]: Without dead ends: 207
[2025-05-07 17:25:49,675 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420
[2025-05-07 17:25:49,675 INFO  L437           NwaCegarLoop]: 227 mSDtfsCounter, 1 mSDsluCounter, 2453 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2680 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:49,676 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2680 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:25:49,676 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 207 states.
[2025-05-07 17:25:49,680 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203.
[2025-05-07 17:25:49,680 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 203 states, 78 states have (on average 1.064102564102564) internal successors, (83), 83 states have internal predecessors, (83), 75 states have call successors, (82), 38 states have call predecessors, (82), 50 states have return successors, (124), 81 states have call predecessors, (124), 75 states have call successors, (124)
[2025-05-07 17:25:49,680 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 289 transitions.
[2025-05-07 17:25:49,681 INFO  L79                 Accepts]: Start accepts. Automaton has 203 states and 289 transitions. Word has length 164
[2025-05-07 17:25:49,681 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:49,681 INFO  L485      AbstractCegarLoop]: Abstraction has 203 states and 289 transitions.
[2025-05-07 17:25:49,681 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (33), 2 states have call predecessors, (33), 12 states have return successors, (35), 13 states have call predecessors, (35), 4 states have call successors, (35)
[2025-05-07 17:25:49,681 INFO  L278                IsEmpty]: Start isEmpty. Operand 203 states and 289 transitions.
[2025-05-07 17:25:49,682 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 165
[2025-05-07 17:25:49,682 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:49,682 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1]
[2025-05-07 17:25:49,689 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-05-07 17:25:49,882 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2025-05-07 17:25:49,883 INFO  L403      AbstractCegarLoop]: === Iteration 27 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:49,884 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:49,884 INFO  L85        PathProgramCache]: Analyzing trace with hash 1912464719, now seen corresponding path program 1 times
[2025-05-07 17:25:49,884 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:49,884 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174605756]
[2025-05-07 17:25:49,885 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:49,885 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:49,981 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes.
[2025-05-07 17:25:49,990 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements.
[2025-05-07 17:25:49,991 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:49,991 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:50,247 INFO  L134       CoverageAnalysis]: Checked inductivity of 111 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-05-07 17:25:50,247 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:50,247 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174605756]
[2025-05-07 17:25:50,247 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174605756] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:25:50,247 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208024022]
[2025-05-07 17:25:50,247 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:50,247 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:50,249 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:50,250 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:25:50,251 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-05-07 17:25:50,674 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes.
[2025-05-07 17:25:50,867 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements.
[2025-05-07 17:25:50,867 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:50,867 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:50,874 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2673 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-05-07 17:25:50,878 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:25:51,023 INFO  L134       CoverageAnalysis]: Checked inductivity of 111 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-05-07 17:25:51,023 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:25:51,023 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208024022] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:51,023 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:25:51,023 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [10] total 21
[2025-05-07 17:25:51,023 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713881304]
[2025-05-07 17:25:51,023 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:51,024 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-05-07 17:25:51,024 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:51,024 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-05-07 17:25:51,024 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420
[2025-05-07 17:25:51,024 INFO  L87              Difference]: Start difference. First operand 203 states and 289 transitions. Second operand  has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (33), 2 states have call predecessors, (33), 12 states have return successors, (35), 13 states have call predecessors, (35), 4 states have call successors, (35)
[2025-05-07 17:25:51,177 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:51,177 INFO  L93              Difference]: Finished difference Result 205 states and 290 transitions.
[2025-05-07 17:25:51,177 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-05-07 17:25:51,178 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (33), 2 states have call predecessors, (33), 12 states have return successors, (35), 13 states have call predecessors, (35), 4 states have call successors, (35) Word has length 164
[2025-05-07 17:25:51,178 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:51,179 INFO  L225             Difference]: With dead ends: 205
[2025-05-07 17:25:51,179 INFO  L226             Difference]: Without dead ends: 200
[2025-05-07 17:25:51,179 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420
[2025-05-07 17:25:51,179 INFO  L437           NwaCegarLoop]: 226 mSDtfsCounter, 1 mSDsluCounter, 2443 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2669 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:51,179 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2669 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:25:51,180 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 200 states.
[2025-05-07 17:25:51,183 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 192.
[2025-05-07 17:25:51,183 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 192 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 79 states have internal predecessors, (79), 70 states have call successors, (77), 38 states have call predecessors, (77), 47 states have return successors, (108), 74 states have call predecessors, (108), 70 states have call successors, (108)
[2025-05-07 17:25:51,184 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 264 transitions.
[2025-05-07 17:25:51,184 INFO  L79                 Accepts]: Start accepts. Automaton has 192 states and 264 transitions. Word has length 164
[2025-05-07 17:25:51,184 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:51,184 INFO  L485      AbstractCegarLoop]: Abstraction has 192 states and 264 transitions.
[2025-05-07 17:25:51,184 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 4 states have call successors, (33), 2 states have call predecessors, (33), 12 states have return successors, (35), 13 states have call predecessors, (35), 4 states have call successors, (35)
[2025-05-07 17:25:51,184 INFO  L278                IsEmpty]: Start isEmpty. Operand 192 states and 264 transitions.
[2025-05-07 17:25:51,185 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-05-07 17:25:51,185 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:51,185 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:51,191 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2025-05-07 17:25:51,385 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2025-05-07 17:25:51,385 INFO  L403      AbstractCegarLoop]: === Iteration 28 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:51,386 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:51,386 INFO  L85        PathProgramCache]: Analyzing trace with hash 781279492, now seen corresponding path program 1 times
[2025-05-07 17:25:51,386 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:51,386 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380548691]
[2025-05-07 17:25:51,386 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:51,386 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:51,406 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-05-07 17:25:51,412 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-05-07 17:25:51,412 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:51,412 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:51,618 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:25:51,618 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:51,618 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380548691]
[2025-05-07 17:25:51,618 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380548691] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:51,618 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:51,618 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:25:51,619 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593532663]
[2025-05-07 17:25:51,619 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:51,619 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:25:51,619 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:51,619 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:25:51,619 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:51,620 INFO  L87              Difference]: Start difference. First operand 192 states and 264 transitions. Second operand  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 12 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:25:51,826 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:51,826 INFO  L93              Difference]: Finished difference Result 198 states and 280 transitions.
[2025-05-07 17:25:51,827 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:25:51,827 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 12 states have call predecessors, (25), 5 states have call successors, (25) Word has length 92
[2025-05-07 17:25:51,827 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:51,827 INFO  L225             Difference]: With dead ends: 198
[2025-05-07 17:25:51,827 INFO  L226             Difference]: Without dead ends: 198
[2025-05-07 17:25:51,828 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:25:51,828 INFO  L437           NwaCegarLoop]: 214 mSDtfsCounter, 2 mSDsluCounter, 2522 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2736 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:51,828 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2736 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:25:51,828 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2025-05-07 17:25:51,832 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196.
[2025-05-07 17:25:51,832 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 196 states, 77 states have (on average 1.051948051948052) internal successors, (81), 81 states have internal predecessors, (81), 70 states have call successors, (77), 38 states have call predecessors, (77), 49 states have return successors, (113), 76 states have call predecessors, (113), 70 states have call successors, (113)
[2025-05-07 17:25:51,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 271 transitions.
[2025-05-07 17:25:51,833 INFO  L79                 Accepts]: Start accepts. Automaton has 196 states and 271 transitions. Word has length 92
[2025-05-07 17:25:51,834 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:51,834 INFO  L485      AbstractCegarLoop]: Abstraction has 196 states and 271 transitions.
[2025-05-07 17:25:51,834 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 12 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:25:51,834 INFO  L278                IsEmpty]: Start isEmpty. Operand 196 states and 271 transitions.
[2025-05-07 17:25:51,835 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2025-05-07 17:25:51,835 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:51,835 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:51,835 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-05-07 17:25:51,835 INFO  L403      AbstractCegarLoop]: === Iteration 29 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:51,835 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:51,835 INFO  L85        PathProgramCache]: Analyzing trace with hash -779706226, now seen corresponding path program 1 times
[2025-05-07 17:25:51,835 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:51,835 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348839237]
[2025-05-07 17:25:51,835 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:51,835 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:51,854 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes.
[2025-05-07 17:25:51,861 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements.
[2025-05-07 17:25:51,861 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:51,861 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:52,029 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:25:52,029 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:52,029 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348839237]
[2025-05-07 17:25:52,029 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348839237] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:52,029 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:52,029 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2025-05-07 17:25:52,029 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184649632]
[2025-05-07 17:25:52,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:52,030 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:25:52,030 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:52,030 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:25:52,030 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:52,030 INFO  L87              Difference]: Start difference. First operand 196 states and 271 transitions. Second operand  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 12 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:25:52,206 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:52,206 INFO  L93              Difference]: Finished difference Result 193 states and 266 transitions.
[2025-05-07 17:25:52,206 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-05-07 17:25:52,206 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 12 states have call predecessors, (25), 5 states have call successors, (25) Word has length 92
[2025-05-07 17:25:52,206 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:52,207 INFO  L225             Difference]: With dead ends: 193
[2025-05-07 17:25:52,207 INFO  L226             Difference]: Without dead ends: 191
[2025-05-07 17:25:52,207 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210
[2025-05-07 17:25:52,207 INFO  L437           NwaCegarLoop]: 209 mSDtfsCounter, 1 mSDsluCounter, 2467 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2676 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:52,207 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2676 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:25:52,208 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 191 states.
[2025-05-07 17:25:52,210 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 185.
[2025-05-07 17:25:52,211 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 185 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 76 states have internal predecessors, (76), 68 states have call successors, (74), 37 states have call predecessors, (74), 45 states have return successors, (97), 71 states have call predecessors, (97), 68 states have call successors, (97)
[2025-05-07 17:25:52,211 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 247 transitions.
[2025-05-07 17:25:52,211 INFO  L79                 Accepts]: Start accepts. Automaton has 185 states and 247 transitions. Word has length 92
[2025-05-07 17:25:52,211 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:52,211 INFO  L485      AbstractCegarLoop]: Abstraction has 185 states and 247 transitions.
[2025-05-07 17:25:52,211 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 12 states have (on average 3.5) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (25), 1 states have call predecessors, (25), 12 states have return successors, (25), 12 states have call predecessors, (25), 5 states have call successors, (25)
[2025-05-07 17:25:52,211 INFO  L278                IsEmpty]: Start isEmpty. Operand 185 states and 247 transitions.
[2025-05-07 17:25:52,212 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2025-05-07 17:25:52,212 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:52,212 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:52,212 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-05-07 17:25:52,212 INFO  L403      AbstractCegarLoop]: === Iteration 30 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:52,212 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:52,212 INFO  L85        PathProgramCache]: Analyzing trace with hash -1180786128, now seen corresponding path program 1 times
[2025-05-07 17:25:52,212 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:52,212 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336710993]
[2025-05-07 17:25:52,213 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:52,213 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:52,243 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-05-07 17:25:52,255 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-05-07 17:25:52,255 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:52,255 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:52,500 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2025-05-07 17:25:52,500 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:52,500 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336710993]
[2025-05-07 17:25:52,500 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336710993] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:25:52,500 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592861260]
[2025-05-07 17:25:52,500 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:52,500 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:52,502 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:52,503 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:25:52,504 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-05-07 17:25:52,887 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-05-07 17:25:53,043 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-05-07 17:25:53,043 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:53,043 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:53,049 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2454 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-05-07 17:25:53,053 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:25:53,103 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked.
[2025-05-07 17:25:53,103 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:25:53,104 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592861260] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:53,104 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:25:53,104 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14
[2025-05-07 17:25:53,104 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119092560]
[2025-05-07 17:25:53,104 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:53,104 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:25:53,104 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:53,105 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:25:53,105 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:53,105 INFO  L87              Difference]: Start difference. First operand 185 states and 247 transitions. Second operand  has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:25:53,129 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:53,129 INFO  L93              Difference]: Finished difference Result 190 states and 253 transitions.
[2025-05-07 17:25:53,129 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:25:53,129 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27) Word has length 151
[2025-05-07 17:25:53,130 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:53,130 INFO  L225             Difference]: With dead ends: 190
[2025-05-07 17:25:53,130 INFO  L226             Difference]: Without dead ends: 190
[2025-05-07 17:25:53,131 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:53,131 INFO  L437           NwaCegarLoop]: 217 mSDtfsCounter, 1 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:53,131 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1066 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:53,132 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 190 states.
[2025-05-07 17:25:53,136 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 185.
[2025-05-07 17:25:53,136 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 185 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 76 states have internal predecessors, (76), 68 states have call successors, (74), 37 states have call predecessors, (74), 45 states have return successors, (97), 71 states have call predecessors, (97), 68 states have call successors, (97)
[2025-05-07 17:25:53,137 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 247 transitions.
[2025-05-07 17:25:53,137 INFO  L79                 Accepts]: Start accepts. Automaton has 185 states and 247 transitions. Word has length 151
[2025-05-07 17:25:53,138 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:53,138 INFO  L485      AbstractCegarLoop]: Abstraction has 185 states and 247 transitions.
[2025-05-07 17:25:53,138 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:25:53,138 INFO  L278                IsEmpty]: Start isEmpty. Operand 185 states and 247 transitions.
[2025-05-07 17:25:53,139 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2025-05-07 17:25:53,139 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:53,139 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:53,147 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2025-05-07 17:25:53,339 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30
[2025-05-07 17:25:53,340 INFO  L403      AbstractCegarLoop]: === Iteration 31 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:53,341 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:53,341 INFO  L85        PathProgramCache]: Analyzing trace with hash 1716038569, now seen corresponding path program 1 times
[2025-05-07 17:25:53,341 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:53,341 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687734340]
[2025-05-07 17:25:53,342 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:53,342 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:53,449 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-05-07 17:25:53,458 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-05-07 17:25:53,459 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:53,459 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:53,779 INFO  L134       CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2025-05-07 17:25:53,779 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:53,779 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687734340]
[2025-05-07 17:25:53,779 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687734340] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:25:53,779 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236630971]
[2025-05-07 17:25:53,779 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:53,779 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:53,781 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:53,782 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:25:53,783 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-05-07 17:25:54,168 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-05-07 17:25:54,313 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-05-07 17:25:54,313 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:54,313 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:54,320 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2354 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-05-07 17:25:54,324 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:25:54,454 INFO  L134       CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-05-07 17:25:54,454 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:25:54,454 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [236630971] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:54,454 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:25:54,454 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 25
[2025-05-07 17:25:54,454 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285030315]
[2025-05-07 17:25:54,454 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:54,455 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-05-07 17:25:54,455 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:54,455 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-05-07 17:25:54,455 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600
[2025-05-07 17:25:54,456 INFO  L87              Difference]: Start difference. First operand 185 states and 247 transitions. Second operand  has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (38), 2 states have call predecessors, (38), 12 states have return successors, (40), 13 states have call predecessors, (40), 4 states have call successors, (40)
[2025-05-07 17:25:54,607 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:54,607 INFO  L93              Difference]: Finished difference Result 193 states and 262 transitions.
[2025-05-07 17:25:54,608 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-05-07 17:25:54,608 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (38), 2 states have call predecessors, (38), 12 states have return successors, (40), 13 states have call predecessors, (40), 4 states have call successors, (40) Word has length 147
[2025-05-07 17:25:54,608 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:54,609 INFO  L225             Difference]: With dead ends: 193
[2025-05-07 17:25:54,609 INFO  L226             Difference]: Without dead ends: 193
[2025-05-07 17:25:54,609 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600
[2025-05-07 17:25:54,609 INFO  L437           NwaCegarLoop]: 208 mSDtfsCounter, 1 mSDsluCounter, 2248 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2456 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:54,609 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2456 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:25:54,609 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 193 states.
[2025-05-07 17:25:54,612 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 185.
[2025-05-07 17:25:54,612 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 185 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 76 states have internal predecessors, (76), 68 states have call successors, (74), 37 states have call predecessors, (74), 45 states have return successors, (97), 71 states have call predecessors, (97), 68 states have call successors, (97)
[2025-05-07 17:25:54,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 247 transitions.
[2025-05-07 17:25:54,613 INFO  L79                 Accepts]: Start accepts. Automaton has 185 states and 247 transitions. Word has length 147
[2025-05-07 17:25:54,613 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:54,613 INFO  L485      AbstractCegarLoop]: Abstraction has 185 states and 247 transitions.
[2025-05-07 17:25:54,613 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (38), 2 states have call predecessors, (38), 12 states have return successors, (40), 13 states have call predecessors, (40), 4 states have call successors, (40)
[2025-05-07 17:25:54,613 INFO  L278                IsEmpty]: Start isEmpty. Operand 185 states and 247 transitions.
[2025-05-07 17:25:54,613 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 148
[2025-05-07 17:25:54,614 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:54,614 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:54,622 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2025-05-07 17:25:54,814 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,11 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:54,815 INFO  L403      AbstractCegarLoop]: === Iteration 32 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:54,815 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:54,816 INFO  L85        PathProgramCache]: Analyzing trace with hash -568107917, now seen corresponding path program 1 times
[2025-05-07 17:25:54,816 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:54,816 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786324785]
[2025-05-07 17:25:54,816 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:54,816 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:54,869 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-05-07 17:25:54,889 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-05-07 17:25:54,889 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:54,889 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:55,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 56 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked.
[2025-05-07 17:25:55,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:55,137 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786324785]
[2025-05-07 17:25:55,137 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786324785] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:25:55,137 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898126252]
[2025-05-07 17:25:55,137 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:55,137 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:55,139 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:55,140 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:25:55,141 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-05-07 17:25:55,740 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes.
[2025-05-07 17:25:55,953 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements.
[2025-05-07 17:25:55,953 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:55,953 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:55,960 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2340 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-05-07 17:25:55,962 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:25:55,988 INFO  L134       CoverageAnalysis]: Checked inductivity of 56 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-05-07 17:25:55,988 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:25:55,988 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898126252] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:55,988 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:25:55,988 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 13
[2025-05-07 17:25:55,988 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762588518]
[2025-05-07 17:25:55,988 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:55,988 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-05-07 17:25:55,988 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:55,989 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-05-07 17:25:55,989 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:25:55,989 INFO  L87              Difference]: Start difference. First operand 185 states and 247 transitions. Second operand  has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (38), 2 states have call predecessors, (38), 12 states have return successors, (40), 13 states have call predecessors, (40), 4 states have call successors, (40)
[2025-05-07 17:25:56,132 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:56,132 INFO  L93              Difference]: Finished difference Result 183 states and 241 transitions.
[2025-05-07 17:25:56,133 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-05-07 17:25:56,133 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (38), 2 states have call predecessors, (38), 12 states have return successors, (40), 13 states have call predecessors, (40), 4 states have call successors, (40) Word has length 147
[2025-05-07 17:25:56,133 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:56,133 INFO  L225             Difference]: With dead ends: 183
[2025-05-07 17:25:56,134 INFO  L226             Difference]: Without dead ends: 181
[2025-05-07 17:25:56,134 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:25:56,134 INFO  L437           NwaCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:56,134 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2340 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:25:56,135 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 181 states.
[2025-05-07 17:25:56,138 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 175.
[2025-05-07 17:25:56,138 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 175 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 72 states have internal predecessors, (72), 64 states have call successors, (70), 37 states have call predecessors, (70), 42 states have return successors, (82), 65 states have call predecessors, (82), 64 states have call successors, (82)
[2025-05-07 17:25:56,139 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 224 transitions.
[2025-05-07 17:25:56,139 INFO  L79                 Accepts]: Start accepts. Automaton has 175 states and 224 transitions. Word has length 147
[2025-05-07 17:25:56,139 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:56,139 INFO  L485      AbstractCegarLoop]: Abstraction has 175 states and 224 transitions.
[2025-05-07 17:25:56,139 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 4 states have call successors, (38), 2 states have call predecessors, (38), 12 states have return successors, (40), 13 states have call predecessors, (40), 4 states have call successors, (40)
[2025-05-07 17:25:56,139 INFO  L278                IsEmpty]: Start isEmpty. Operand 175 states and 224 transitions.
[2025-05-07 17:25:56,140 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2025-05-07 17:25:56,140 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:56,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:56,146 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2025-05-07 17:25:56,341 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32
[2025-05-07 17:25:56,341 INFO  L403      AbstractCegarLoop]: === Iteration 33 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:56,342 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:56,342 INFO  L85        PathProgramCache]: Analyzing trace with hash -1836957220, now seen corresponding path program 1 times
[2025-05-07 17:25:56,343 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:56,343 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427210943]
[2025-05-07 17:25:56,343 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:56,343 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:56,459 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-05-07 17:25:56,475 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-05-07 17:25:56,475 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:56,475 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:56,698 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2025-05-07 17:25:56,698 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:56,698 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427210943]
[2025-05-07 17:25:56,698 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427210943] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:25:56,698 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31573491]
[2025-05-07 17:25:56,698 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:56,698 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:56,700 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:56,701 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:25:56,702 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2025-05-07 17:25:57,162 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-05-07 17:25:57,313 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-05-07 17:25:57,313 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:57,313 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:57,320 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2455 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-05-07 17:25:57,322 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:25:57,363 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked.
[2025-05-07 17:25:57,363 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:25:57,363 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [31573491] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:57,363 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:25:57,363 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14
[2025-05-07 17:25:57,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179783404]
[2025-05-07 17:25:57,363 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:57,363 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:25:57,363 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:57,364 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:25:57,364 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:57,364 INFO  L87              Difference]: Start difference. First operand 175 states and 224 transitions. Second operand  has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:25:57,385 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:57,385 INFO  L93              Difference]: Finished difference Result 180 states and 230 transitions.
[2025-05-07 17:25:57,385 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:25:57,385 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27) Word has length 151
[2025-05-07 17:25:57,385 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:57,386 INFO  L225             Difference]: With dead ends: 180
[2025-05-07 17:25:57,386 INFO  L226             Difference]: Without dead ends: 180
[2025-05-07 17:25:57,386 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:57,387 INFO  L437           NwaCegarLoop]: 208 mSDtfsCounter, 1 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:57,387 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1022 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:57,387 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 180 states.
[2025-05-07 17:25:57,390 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 175.
[2025-05-07 17:25:57,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 175 states, 68 states have (on average 1.0588235294117647) internal successors, (72), 72 states have internal predecessors, (72), 64 states have call successors, (70), 37 states have call predecessors, (70), 42 states have return successors, (82), 65 states have call predecessors, (82), 64 states have call successors, (82)
[2025-05-07 17:25:57,391 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 224 transitions.
[2025-05-07 17:25:57,391 INFO  L79                 Accepts]: Start accepts. Automaton has 175 states and 224 transitions. Word has length 151
[2025-05-07 17:25:57,391 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:57,391 INFO  L485      AbstractCegarLoop]: Abstraction has 175 states and 224 transitions.
[2025-05-07 17:25:57,391 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:25:57,391 INFO  L278                IsEmpty]: Start isEmpty. Operand 175 states and 224 transitions.
[2025-05-07 17:25:57,392 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2025-05-07 17:25:57,392 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:57,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:57,402 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2025-05-07 17:25:57,593 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,13 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:57,594 INFO  L403      AbstractCegarLoop]: === Iteration 34 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:57,594 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:57,595 INFO  L85        PathProgramCache]: Analyzing trace with hash -1195587708, now seen corresponding path program 1 times
[2025-05-07 17:25:57,595 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:57,595 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131579453]
[2025-05-07 17:25:57,595 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:57,595 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:57,689 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-05-07 17:25:57,696 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-05-07 17:25:57,696 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:57,696 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:57,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked.
[2025-05-07 17:25:57,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:57,917 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131579453]
[2025-05-07 17:25:57,917 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131579453] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:25:57,917 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624804136]
[2025-05-07 17:25:57,917 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:57,917 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:57,919 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:57,920 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:25:57,921 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2025-05-07 17:25:58,408 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-05-07 17:25:58,633 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-05-07 17:25:58,633 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:58,633 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:58,640 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2446 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-05-07 17:25:58,642 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:25:58,686 INFO  L134       CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked.
[2025-05-07 17:25:58,686 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-05-07 17:25:58,686 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624804136] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:58,686 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-05-07 17:25:58,687 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14
[2025-05-07 17:25:58,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568961207]
[2025-05-07 17:25:58,687 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:58,687 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:25:58,687 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:58,687 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:25:58,688 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:58,688 INFO  L87              Difference]: Start difference. First operand 175 states and 224 transitions. Second operand  has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:25:58,710 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:58,710 INFO  L93              Difference]: Finished difference Result 169 states and 218 transitions.
[2025-05-07 17:25:58,710 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:25:58,710 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27) Word has length 151
[2025-05-07 17:25:58,711 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:58,711 INFO  L225             Difference]: With dead ends: 169
[2025-05-07 17:25:58,711 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:25:58,711 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:25:58,711 INFO  L437           NwaCegarLoop]: 202 mSDtfsCounter, 0 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:58,711 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 994 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:58,711 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:25:58,711 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:25:58,711 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-05-07 17:25:58,712 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:25:58,712 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 151
[2025-05-07 17:25:58,712 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:58,712 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:25:58,712 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 4 states have call successors, (27), 1 states have call predecessors, (27), 5 states have return successors, (27), 6 states have call predecessors, (27), 4 states have call successors, (27)
[2025-05-07 17:25:58,712 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:25:58,712 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:25:58,714 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:25:58,721 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2025-05-07 17:25:58,915 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34
[2025-05-07 17:25:58,924 INFO  L422         BasicCegarLoop]: Path program 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]
[2025-05-07 17:25:58,930 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:25:58,937 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:25:58 BoogieIcfgContainer
[2025-05-07 17:25:58,937 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:25:58,939 INFO  L158              Benchmark]: Toolchain (without parser) took 28718.99ms. Allocated memory was 234.9MB in the beginning and 536.9MB in the end (delta: 302.0MB). Free memory was 194.6MB in the beginning and 191.1MB in the end (delta: 3.5MB). Peak memory consumption was 296.9MB. Max. memory is 33.6GB.
[2025-05-07 17:25:58,939 INFO  L158              Benchmark]: SmtParser took 0.30ms. Allocated memory is still 234.9MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:25:58,940 INFO  L158              Benchmark]: ChcToBoogie took 57.34ms. Allocated memory is still 234.9MB. Free memory was 194.6MB in the beginning and 188.0MB in the end (delta: 6.6MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:25:58,940 INFO  L158              Benchmark]: Boogie Preprocessor took 89.29ms. Allocated memory is still 234.9MB. Free memory was 188.0MB in the beginning and 183.2MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:25:58,941 INFO  L158              Benchmark]: RCFGBuilder took 706.08ms. Allocated memory was 234.9MB in the beginning and 302.0MB in the end (delta: 67.1MB). Free memory was 183.2MB in the beginning and 235.7MB in the end (delta: -52.5MB). Peak memory consumption was 91.8MB. Max. memory is 33.6GB.
[2025-05-07 17:25:58,941 INFO  L158              Benchmark]: TraceAbstraction took 27861.96ms. Allocated memory was 302.0MB in the beginning and 536.9MB in the end (delta: 234.9MB). Free memory was 234.8MB in the beginning and 191.1MB in the end (delta: 43.7MB). Peak memory consumption was 272.2MB. Max. memory is 33.6GB.
[2025-05-07 17:25:58,943 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.30ms. Allocated memory is still 234.9MB. Free memory is still 172.8MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 57.34ms. Allocated memory is still 234.9MB. Free memory was 194.6MB in the beginning and 188.0MB in the end (delta: 6.6MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 89.29ms. Allocated memory is still 234.9MB. Free memory was 188.0MB in the beginning and 183.2MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 706.08ms. Allocated memory was 234.9MB in the beginning and 302.0MB in the end (delta: 67.1MB). Free memory was 183.2MB in the beginning and 235.7MB in the end (delta: -52.5MB). Peak memory consumption was 91.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 27861.96ms. Allocated memory was 302.0MB in the beginning and 536.9MB in the end (delta: 234.9MB). Free memory was 234.8MB in the beginning and 191.1MB in the end (delta: 43.7MB). Peak memory consumption was 272.2MB. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Unknown line] : the set of constraint Horn clauses is satisfiable
    For all program executions holds that the set of constraint Horn clauses is satisfiable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 40 procedures, 192 locations, 351 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.8s, OverallIterations: 34, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 72977 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65058 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6571 IncrementalHoareTripleChecker+Invalid, 6590 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 7919 mSDtfsCounter, 6571 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2298 GetRequests, 1894 SyntacticMatches, 1 SemanticMatches, 403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=13, InterpolantAutomatonStates: 354, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 109 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.5s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 5798 NumberOfCodeBlocks, 5798 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 5751 ConstructedInterpolants, 0 QuantifiedInterpolants, 7710 SizeOfPredicates, 1 NumberOfNonLiveVariables, 30978 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 47 InterpolantComputations, 34 PerfectInterpolantSequences, 2260/2491 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-05-07 17:25:58,966 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
sat
