./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/blockchain_state/balance_receive_ext_calls_2.sol_1_no_adts_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:27:56,240 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:27:56,277 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7837d4-e7c3-4779-b67c-1b437f50e346/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:27:56,280 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:27:56,280 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:27:56,293 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:27:56,293 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:27:56,293 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:27:56,293 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:27:56,293 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:27:56,294 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:27:56,294 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:27:56,294 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:27:56,294 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:27:56,294 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:27:56,294 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:27:56,294 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:27:56,294 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:27:56,294 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:27:56,295 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:27:56,295 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:27:56,295 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:27:56,295 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:27:56,295 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:27:56,295 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:27:56,296 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:27:56,296 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:27:56,480 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:27:56,488 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:27:56,490 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:27:56,492 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:27:56,492 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:27:56,493 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7837d4-e7c3-4779-b67c-1b437f50e346/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/blockchain_state/balance_receive_ext_calls_2.sol_1_no_adts_000.smt2
[2025-05-07 17:27:56,494 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:27:56,498 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:27:56,738 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff7837d4-e7c3-4779-b67c-1b437f50e346/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/solidity/no_adts/unit_tests/blockchain_state/balance_receive_ext_calls_2.sol_1_no_adts_000.smt2
[2025-05-07 17:27:56,740 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:27:56,741 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:27:56,742 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:27:56,742 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:27:56,742 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:27:56,744 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:27:56" (1/1) ...
[2025-05-07 17:27:56,772 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:56 Unit
[2025-05-07 17:27:56,772 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:27:56,772 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:27:56,773 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:27:56,773 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:27:56,785 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:56" (1/1) ...
[2025-05-07 17:27:56,785 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:56" (1/1) ...
[2025-05-07 17:27:56,806 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:56" (1/1) ...
[2025-05-07 17:27:56,806 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:56" (1/1) ...
[2025-05-07 17:27:56,809 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:56" (1/1) ...
[2025-05-07 17:27:56,810 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:56" (1/1) ...
[2025-05-07 17:27:56,812 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:56" (1/1) ...
[2025-05-07 17:27:56,813 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:56" (1/1) ...
[2025-05-07 17:27:56,814 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:56" (1/1) ...
[2025-05-07 17:27:56,823 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:27:56,824 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:27:56,824 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:27:56,824 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:27:56,825 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:56" (1/1) ...
[2025-05-07 17:27:56,827 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:27:56,835 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:27:56,843 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-05-07 17:27:56,845 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:27:56,854 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:27:56,854 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:27:56,854 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:27:56,854 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure error_target_5_0 given in one single declaration
[2025-05-07 17:27:56,854 INFO  L130     BoogieDeclarations]: Found specification of procedure error_target_5_0
[2025-05-07 17:27:56,854 INFO  L138     BoogieDeclarations]: Found implementation of procedure error_target_5_0
[2025-05-07 17:27:56,854 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_4_function_f__40_41_0 given in one single declaration
[2025-05-07 17:27:56,854 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_4_function_f__40_41_0
[2025-05-07 17:27:56,854 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_4_function_f__40_41_0
[2025-05-07 17:27:56,854 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_11_function_f__40_41_0 given in one single declaration
[2025-05-07 17:27:56,854 INFO  L130     BoogieDeclarations]: Found specification of procedure block_11_function_f__40_41_0
[2025-05-07 17:27:56,854 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_11_function_f__40_41_0
[2025-05-07 17:27:56,854 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_3_function_f__40_41_0 given in one single declaration
[2025-05-07 17:27:56,855 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_3_function_f__40_41_0
[2025-05-07 17:27:56,855 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_3_function_f__40_41_0
[2025-05-07 17:27:56,855 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_9_function_f__40_41_0 given in one single declaration
[2025-05-07 17:27:56,855 INFO  L130     BoogieDeclarations]: Found specification of procedure block_9_function_f__40_41_0
[2025-05-07 17:27:56,855 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_9_function_f__40_41_0
[2025-05-07 17:27:56,855 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_10_function_f__40_41_0 given in one single declaration
[2025-05-07 17:27:56,855 INFO  L130     BoogieDeclarations]: Found specification of procedure block_10_function_f__40_41_0
[2025-05-07 17:27:56,855 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_10_function_f__40_41_0
[2025-05-07 17:27:56,855 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_6_f_39_41_0 given in one single declaration
[2025-05-07 17:27:56,855 INFO  L130     BoogieDeclarations]: Found specification of procedure block_6_f_39_41_0
[2025-05-07 17:27:56,855 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_6_f_39_41_0
[2025-05-07 17:27:56,855 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_5_function_f__40_41_0 given in one single declaration
[2025-05-07 17:27:56,855 INFO  L130     BoogieDeclarations]: Found specification of procedure block_5_function_f__40_41_0
[2025-05-07 17:27:56,855 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_5_function_f__40_41_0
[2025-05-07 17:27:56,855 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure nondet_call_8_0 given in one single declaration
[2025-05-07 17:27:56,855 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_call_8_0
[2025-05-07 17:27:56,855 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_call_8_0
[2025-05-07 17:27:56,855 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure nondet_interface_1_C_41_0 given in one single declaration
[2025-05-07 17:27:56,856 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_interface_1_C_41_0
[2025-05-07 17:27:56,856 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_interface_1_C_41_0
[2025-05-07 17:27:56,856 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure block_7_return_function_f__40_41_0 given in one single declaration
[2025-05-07 17:27:56,856 INFO  L130     BoogieDeclarations]: Found specification of procedure block_7_return_function_f__40_41_0
[2025-05-07 17:27:56,856 INFO  L138     BoogieDeclarations]: Found implementation of procedure block_7_return_function_f__40_41_0
[2025-05-07 17:27:56,856 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure interface_0_C_41_0 given in one single declaration
[2025-05-07 17:27:56,856 INFO  L130     BoogieDeclarations]: Found specification of procedure interface_0_C_41_0
[2025-05-07 17:27:56,856 INFO  L138     BoogieDeclarations]: Found implementation of procedure interface_0_C_41_0
[2025-05-07 17:27:56,856 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure summary_constructor_2_C_41_0 given in one single declaration
[2025-05-07 17:27:56,856 INFO  L130     BoogieDeclarations]: Found specification of procedure summary_constructor_2_C_41_0
[2025-05-07 17:27:56,856 INFO  L138     BoogieDeclarations]: Found implementation of procedure summary_constructor_2_C_41_0
[2025-05-07 17:27:56,856 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure implicit_constructor_entry_15_C_41_0 given in one single declaration
[2025-05-07 17:27:56,856 INFO  L130     BoogieDeclarations]: Found specification of procedure implicit_constructor_entry_15_C_41_0
[2025-05-07 17:27:56,856 INFO  L138     BoogieDeclarations]: Found implementation of procedure implicit_constructor_entry_15_C_41_0
[2025-05-07 17:27:56,856 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_12_C_41_0 given in one single declaration
[2025-05-07 17:27:56,856 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_12_C_41_0
[2025-05-07 17:27:56,856 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_12_C_41_0
[2025-05-07 17:27:56,857 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_after_init_14_C_41_0 given in one single declaration
[2025-05-07 17:27:56,857 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_after_init_14_C_41_0
[2025-05-07 17:27:56,857 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_after_init_14_C_41_0
[2025-05-07 17:27:56,857 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure contract_initializer_entry_13_C_41_0 given in one single declaration
[2025-05-07 17:27:56,857 INFO  L130     BoogieDeclarations]: Found specification of procedure contract_initializer_entry_13_C_41_0
[2025-05-07 17:27:56,857 INFO  L138     BoogieDeclarations]: Found implementation of procedure contract_initializer_entry_13_C_41_0
[2025-05-07 17:27:56,857 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:27:56,857 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:27:56,857 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:27:56,967 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:27:56,969 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:27:57,150 INFO  L?                        ?]: Removed 157 outVars from TransFormulas that were not future-live.
[2025-05-07 17:27:57,150 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:27:57,161 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:27:57,161 INFO  L312             CfgBuilder]: Removed 9 assume(true) statements.
[2025-05-07 17:27:57,162 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:27:57 BoogieIcfgContainer
[2025-05-07 17:27:57,162 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:27:57,164 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:27:57,164 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:27:57,167 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:27:57,168 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:27:56" (1/3) ...
[2025-05-07 17:27:57,168 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3430b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:27:57, skipping insertion in model container
[2025-05-07 17:27:57,168 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:27:56" (2/3) ...
[2025-05-07 17:27:57,168 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3430b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:27:57, skipping insertion in model container
[2025-05-07 17:27:57,169 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:27:57" (3/3) ...
[2025-05-07 17:27:57,170 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:27:57,184 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:27:57,186 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 19 procedures, 79 locations, 126 edges, 19 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:27:57,222 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:27:57,233 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;@40736c3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:27:57,233 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:27:57,237 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 79 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 28 states have call successors, (30), 18 states have call predecessors, (30), 18 states have return successors, (30), 25 states have call predecessors, (30), 28 states have call successors, (30)
[2025-05-07 17:27:57,244 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2025-05-07 17:27:57,244 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:57,244 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:57,245 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:57,248 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:57,248 INFO  L85        PathProgramCache]: Analyzing trace with hash -1854440056, now seen corresponding path program 1 times
[2025-05-07 17:27:57,253 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:57,253 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239667848]
[2025-05-07 17:27:57,254 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:57,254 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:57,304 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes.
[2025-05-07 17:27:57,328 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements.
[2025-05-07 17:27:57,328 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:57,328 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:57,494 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:27:57,494 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:57,494 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239667848]
[2025-05-07 17:27:57,495 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239667848] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:57,495 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:57,496 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:27:57,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545510930]
[2025-05-07 17:27:57,498 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:57,501 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:27:57,501 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:57,518 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:27:57,519 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:57,520 INFO  L87              Difference]: Start difference. First operand  has 79 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 28 states have call successors, (30), 18 states have call predecessors, (30), 18 states have return successors, (30), 25 states have call predecessors, (30), 28 states have call successors, (30) Second operand  has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (15), 1 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15)
[2025-05-07 17:27:57,558 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:57,558 INFO  L93              Difference]: Finished difference Result 81 states and 98 transitions.
[2025-05-07 17:27:57,559 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:27:57,560 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (15), 1 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 55
[2025-05-07 17:27:57,560 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:57,568 INFO  L225             Difference]: With dead ends: 81
[2025-05-07 17:27:57,568 INFO  L226             Difference]: Without dead ends: 77
[2025-05-07 17:27:57,570 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:57,573 INFO  L437           NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:57,573 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 275 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:57,587 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 77 states.
[2025-05-07 17:27:57,613 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75.
[2025-05-07 17:27:57,614 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 75 states, 31 states have (on average 1.064516129032258) internal successors, (33), 33 states have internal predecessors, (33), 26 states have call successors, (28), 18 states have call predecessors, (28), 18 states have return successors, (28), 24 states have call predecessors, (28), 26 states have call successors, (28)
[2025-05-07 17:27:57,619 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions.
[2025-05-07 17:27:57,620 INFO  L79                 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 55
[2025-05-07 17:27:57,620 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:57,620 INFO  L485      AbstractCegarLoop]: Abstraction has 75 states and 89 transitions.
[2025-05-07 17:27:57,620 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (15), 1 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15)
[2025-05-07 17:27:57,620 INFO  L278                IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions.
[2025-05-07 17:27:57,623 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2025-05-07 17:27:57,623 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:57,623 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:57,623 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:27:57,623 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:57,624 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:57,624 INFO  L85        PathProgramCache]: Analyzing trace with hash 1735737220, now seen corresponding path program 1 times
[2025-05-07 17:27:57,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:57,624 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836135725]
[2025-05-07 17:27:57,624 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:57,625 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:57,651 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes.
[2025-05-07 17:27:57,684 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements.
[2025-05-07 17:27:57,684 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:57,684 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:57,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:27:57,809 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:57,809 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836135725]
[2025-05-07 17:27:57,809 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836135725] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:57,809 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:57,809 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:27:57,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609824545]
[2025-05-07 17:27:57,809 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:57,810 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:27:57,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:57,811 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:27:57,811 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:27:57,811 INFO  L87              Difference]: Start difference. First operand 75 states and 89 transitions. Second operand  has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)
[2025-05-07 17:27:57,864 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:57,864 INFO  L93              Difference]: Finished difference Result 81 states and 98 transitions.
[2025-05-07 17:27:57,864 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:27:57,864 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 55
[2025-05-07 17:27:57,865 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:57,865 INFO  L225             Difference]: With dead ends: 81
[2025-05-07 17:27:57,865 INFO  L226             Difference]: Without dead ends: 81
[2025-05-07 17:27:57,866 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:27:57,866 INFO  L437           NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:57,866 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 329 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:57,867 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2025-05-07 17:27:57,872 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79.
[2025-05-07 17:27:57,872 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 79 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 35 states have internal predecessors, (35), 26 states have call successors, (28), 18 states have call predecessors, (28), 20 states have return successors, (33), 25 states have call predecessors, (33), 26 states have call successors, (33)
[2025-05-07 17:27:57,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 96 transitions.
[2025-05-07 17:27:57,873 INFO  L79                 Accepts]: Start accepts. Automaton has 79 states and 96 transitions. Word has length 55
[2025-05-07 17:27:57,874 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:57,874 INFO  L485      AbstractCegarLoop]: Abstraction has 79 states and 96 transitions.
[2025-05-07 17:27:57,874 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (15), 1 states have call predecessors, (15), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15)
[2025-05-07 17:27:57,874 INFO  L278                IsEmpty]: Start isEmpty. Operand 79 states and 96 transitions.
[2025-05-07 17:27:57,875 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:27:57,875 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:57,875 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:57,875 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:27:57,875 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:57,875 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:57,875 INFO  L85        PathProgramCache]: Analyzing trace with hash -1652844216, now seen corresponding path program 1 times
[2025-05-07 17:27:57,875 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:57,875 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843959692]
[2025-05-07 17:27:57,876 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:57,876 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:57,896 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:27:57,909 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:27:57,909 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:57,909 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:58,028 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:27:58,028 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:58,028 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843959692]
[2025-05-07 17:27:58,028 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843959692] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:58,028 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:58,028 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:27:58,028 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647406930]
[2025-05-07 17:27:58,029 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:58,029 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:27:58,029 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:58,029 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:27:58,030 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:27:58,030 INFO  L87              Difference]: Start difference. First operand 79 states and 96 transitions. Second operand  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:27:58,074 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:58,075 INFO  L93              Difference]: Finished difference Result 84 states and 103 transitions.
[2025-05-07 17:27:58,075 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:27:58,075 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16) Word has length 58
[2025-05-07 17:27:58,075 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:58,076 INFO  L225             Difference]: With dead ends: 84
[2025-05-07 17:27:58,076 INFO  L226             Difference]: Without dead ends: 84
[2025-05-07 17:27:58,076 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:27:58,077 INFO  L437           NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:58,077 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 425 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:58,078 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2025-05-07 17:27:58,082 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2025-05-07 17:27:58,082 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 27 states have call successors, (29), 18 states have call predecessors, (29), 22 states have return successors, (37), 28 states have call predecessors, (37), 27 states have call successors, (37)
[2025-05-07 17:27:58,083 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 103 transitions.
[2025-05-07 17:27:58,083 INFO  L79                 Accepts]: Start accepts. Automaton has 84 states and 103 transitions. Word has length 58
[2025-05-07 17:27:58,084 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:58,084 INFO  L485      AbstractCegarLoop]: Abstraction has 84 states and 103 transitions.
[2025-05-07 17:27:58,084 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 4 states have call successors, (16), 1 states have call predecessors, (16), 5 states have return successors, (16), 6 states have call predecessors, (16), 4 states have call successors, (16)
[2025-05-07 17:27:58,084 INFO  L278                IsEmpty]: Start isEmpty. Operand 84 states and 103 transitions.
[2025-05-07 17:27:58,085 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:27:58,085 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:58,085 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:58,085 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-05-07 17:27:58,085 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:58,085 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:58,086 INFO  L85        PathProgramCache]: Analyzing trace with hash -931714712, now seen corresponding path program 1 times
[2025-05-07 17:27:58,086 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:58,086 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484228608]
[2025-05-07 17:27:58,086 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:58,086 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:58,105 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:27:58,132 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:27:58,132 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:58,132 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:58,407 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:27:58,408 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:58,408 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484228608]
[2025-05-07 17:27:58,408 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484228608] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:58,408 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:58,408 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:27:58,408 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702233150]
[2025-05-07 17:27:58,408 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:58,409 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:27:58,409 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:58,409 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:27:58,409 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:27:58,410 INFO  L87              Difference]: Start difference. First operand 84 states and 103 transitions. Second operand  has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:27:58,453 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:58,453 INFO  L93              Difference]: Finished difference Result 84 states and 102 transitions.
[2025-05-07 17:27:58,453 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:27:58,454 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16) Word has length 58
[2025-05-07 17:27:58,454 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:58,455 INFO  L225             Difference]: With dead ends: 84
[2025-05-07 17:27:58,455 INFO  L226             Difference]: Without dead ends: 84
[2025-05-07 17:27:58,455 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:27:58,456 INFO  L437           NwaCegarLoop]: 84 mSDtfsCounter, 1 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:58,456 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 325 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:58,457 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2025-05-07 17:27:58,464 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2025-05-07 17:27:58,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 27 states have call successors, (29), 18 states have call predecessors, (29), 22 states have return successors, (36), 28 states have call predecessors, (36), 27 states have call successors, (36)
[2025-05-07 17:27:58,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions.
[2025-05-07 17:27:58,465 INFO  L79                 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 58
[2025-05-07 17:27:58,465 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:58,466 INFO  L485      AbstractCegarLoop]: Abstraction has 84 states and 102 transitions.
[2025-05-07 17:27:58,466 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:27:58,466 INFO  L278                IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions.
[2025-05-07 17:27:58,467 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 59
[2025-05-07 17:27:58,467 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:58,467 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:58,468 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:27:58,468 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:58,468 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:58,468 INFO  L85        PathProgramCache]: Analyzing trace with hash -1918966082, now seen corresponding path program 1 times
[2025-05-07 17:27:58,468 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:58,468 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370686953]
[2025-05-07 17:27:58,468 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:58,469 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:58,493 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes.
[2025-05-07 17:27:58,503 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements.
[2025-05-07 17:27:58,503 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:58,503 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:58,642 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:27:58,642 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:58,642 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370686953]
[2025-05-07 17:27:58,642 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370686953] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:58,642 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:58,642 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-05-07 17:27:58,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747270986]
[2025-05-07 17:27:58,643 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:58,643 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:27:58,643 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:58,643 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:27:58,643 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:27:58,643 INFO  L87              Difference]: Start difference. First operand 84 states and 102 transitions. Second operand  has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:27:58,674 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:58,674 INFO  L93              Difference]: Finished difference Result 84 states and 101 transitions.
[2025-05-07 17:27:58,674 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:27:58,674 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 58
[2025-05-07 17:27:58,674 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:58,675 INFO  L225             Difference]: With dead ends: 84
[2025-05-07 17:27:58,675 INFO  L226             Difference]: Without dead ends: 84
[2025-05-07 17:27:58,675 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:27:58,676 INFO  L437           NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:58,676 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 329 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:27:58,676 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2025-05-07 17:27:58,679 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2025-05-07 17:27:58,680 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 37 states have internal predecessors, (37), 27 states have call successors, (29), 18 states have call predecessors, (29), 22 states have return successors, (35), 28 states have call predecessors, (35), 27 states have call successors, (35)
[2025-05-07 17:27:58,680 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 101 transitions.
[2025-05-07 17:27:58,680 INFO  L79                 Accepts]: Start accepts. Automaton has 84 states and 101 transitions. Word has length 58
[2025-05-07 17:27:58,681 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:58,681 INFO  L485      AbstractCegarLoop]: Abstraction has 84 states and 101 transitions.
[2025-05-07 17:27:58,681 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (16), 1 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16)
[2025-05-07 17:27:58,681 INFO  L278                IsEmpty]: Start isEmpty. Operand 84 states and 101 transitions.
[2025-05-07 17:27:58,682 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-05-07 17:27:58,682 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:58,682 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:58,682 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:27:58,682 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:58,682 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:58,682 INFO  L85        PathProgramCache]: Analyzing trace with hash -402443899, now seen corresponding path program 1 times
[2025-05-07 17:27:58,682 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:58,682 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218752666]
[2025-05-07 17:27:58,683 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:58,683 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:58,709 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:27:58,746 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:27:58,747 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:58,747 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:59,732 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-05-07 17:27:59,732 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:59,732 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218752666]
[2025-05-07 17:27:59,732 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218752666] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:27:59,732 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1024673067]
[2025-05-07 17:27:59,732 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:59,732 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:59,735 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:27:59,737 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:27:59,739 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:27:59,936 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:28:00,061 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:28:00,061 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:00,061 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:00,068 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 60 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:00,074 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:00,104 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1
[2025-05-07 17:28:00,334 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-05-07 17:28:00,334 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:02,053 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5
[2025-05-07 17:28:02,280 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22
[2025-05-07 17:28:02,384 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5
[2025-05-07 17:28:02,524 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-05-07 17:28:02,524 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1024673067] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:28:02,524 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:28:02,524 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 26
[2025-05-07 17:28:02,525 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594381637]
[2025-05-07 17:28:02,525 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:02,525 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 26 states
[2025-05-07 17:28:02,525 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:02,526 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants.
[2025-05-07 17:28:02,526 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650
[2025-05-07 17:28:02,527 INFO  L87              Difference]: Start difference. First operand 84 states and 101 transitions. Second operand  has 26 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 18 states have internal predecessors, (41), 17 states have call successors, (32), 2 states have call predecessors, (32), 13 states have return successors, (38), 20 states have call predecessors, (38), 17 states have call successors, (38)
[2025-05-07 17:28:02,986 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:02,986 INFO  L93              Difference]: Finished difference Result 98 states and 125 transitions.
[2025-05-07 17:28:02,986 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-05-07 17:28:02,987 INFO  L79                 Accepts]: Start accepts. Automaton has  has 26 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 18 states have internal predecessors, (41), 17 states have call successors, (32), 2 states have call predecessors, (32), 13 states have return successors, (38), 20 states have call predecessors, (38), 17 states have call successors, (38) Word has length 90
[2025-05-07 17:28:02,987 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:02,988 INFO  L225             Difference]: With dead ends: 98
[2025-05-07 17:28:02,988 INFO  L226             Difference]: Without dead ends: 98
[2025-05-07 17:28:02,988 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870
[2025-05-07 17:28:02,989 INFO  L437           NwaCegarLoop]: 75 mSDtfsCounter, 10 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:02,989 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1552 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-05-07 17:28:02,989 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2025-05-07 17:28:02,993 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96.
[2025-05-07 17:28:02,994 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 96 states, 40 states have (on average 1.05) internal successors, (42), 42 states have internal predecessors, (42), 29 states have call successors, (31), 18 states have call predecessors, (31), 27 states have return successors, (48), 35 states have call predecessors, (48), 29 states have call successors, (48)
[2025-05-07 17:28:02,994 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 121 transitions.
[2025-05-07 17:28:02,994 INFO  L79                 Accepts]: Start accepts. Automaton has 96 states and 121 transitions. Word has length 90
[2025-05-07 17:28:02,994 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:02,994 INFO  L485      AbstractCegarLoop]: Abstraction has 96 states and 121 transitions.
[2025-05-07 17:28:02,995 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 26 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 18 states have internal predecessors, (41), 17 states have call successors, (32), 2 states have call predecessors, (32), 13 states have return successors, (38), 20 states have call predecessors, (38), 17 states have call successors, (38)
[2025-05-07 17:28:02,995 INFO  L278                IsEmpty]: Start isEmpty. Operand 96 states and 121 transitions.
[2025-05-07 17:28:02,995 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2025-05-07 17:28:02,995 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:02,996 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:03,002 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:28:03,196 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6
[2025-05-07 17:28:03,197 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:03,198 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:03,199 INFO  L85        PathProgramCache]: Analyzing trace with hash 417049991, now seen corresponding path program 1 times
[2025-05-07 17:28:03,199 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:03,199 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013426507]
[2025-05-07 17:28:03,199 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:03,200 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:03,256 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes.
[2025-05-07 17:28:03,266 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements.
[2025-05-07 17:28:03,266 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:03,266 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:03,373 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2025-05-07 17:28:03,373 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:03,373 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013426507]
[2025-05-07 17:28:03,373 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013426507] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:03,373 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:03,373 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:28:03,373 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853486080]
[2025-05-07 17:28:03,374 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:03,374 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:28:03,374 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:03,374 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:28:03,374 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:28:03,375 INFO  L87              Difference]: Start difference. First operand 96 states and 121 transitions. Second operand  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 6 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23)
[2025-05-07 17:28:03,453 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:03,453 INFO  L93              Difference]: Finished difference Result 103 states and 135 transitions.
[2025-05-07 17:28:03,453 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:28:03,454 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 6 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23) Word has length 87
[2025-05-07 17:28:03,454 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:03,455 INFO  L225             Difference]: With dead ends: 103
[2025-05-07 17:28:03,455 INFO  L226             Difference]: Without dead ends: 103
[2025-05-07 17:28:03,455 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:28:03,456 INFO  L437           NwaCegarLoop]: 81 mSDtfsCounter, 1 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:03,456 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 542 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:03,457 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103 states.
[2025-05-07 17:28:03,461 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101.
[2025-05-07 17:28:03,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 101 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 44 states have internal predecessors, (44), 30 states have call successors, (32), 18 states have call predecessors, (32), 29 states have return successors, (57), 38 states have call predecessors, (57), 30 states have call successors, (57)
[2025-05-07 17:28:03,462 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 133 transitions.
[2025-05-07 17:28:03,462 INFO  L79                 Accepts]: Start accepts. Automaton has 101 states and 133 transitions. Word has length 87
[2025-05-07 17:28:03,462 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:03,462 INFO  L485      AbstractCegarLoop]: Abstraction has 101 states and 133 transitions.
[2025-05-07 17:28:03,462 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 6 states have call successors, (21), 1 states have call predecessors, (21), 7 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23)
[2025-05-07 17:28:03,463 INFO  L278                IsEmpty]: Start isEmpty. Operand 101 states and 133 transitions.
[2025-05-07 17:28:03,463 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2025-05-07 17:28:03,463 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:03,463 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:03,464 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:28:03,464 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:03,464 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:03,464 INFO  L85        PathProgramCache]: Analyzing trace with hash 995821569, now seen corresponding path program 1 times
[2025-05-07 17:28:03,464 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:03,464 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457280116]
[2025-05-07 17:28:03,464 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:03,464 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:03,488 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes.
[2025-05-07 17:28:03,496 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements.
[2025-05-07 17:28:03,496 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:03,496 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:03,575 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2025-05-07 17:28:03,575 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:03,575 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457280116]
[2025-05-07 17:28:03,575 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457280116] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:03,575 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:03,575 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-05-07 17:28:03,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019080874]
[2025-05-07 17:28:03,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:03,576 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:28:03,576 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:03,576 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:28:03,576 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:28:03,577 INFO  L87              Difference]: Start difference. First operand 101 states and 133 transitions. Second operand  has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (22), 1 states have call predecessors, (22), 5 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23)
[2025-05-07 17:28:03,611 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:03,611 INFO  L93              Difference]: Finished difference Result 106 states and 140 transitions.
[2025-05-07 17:28:03,611 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:28:03,611 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (22), 1 states have call predecessors, (22), 5 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23) Word has length 90
[2025-05-07 17:28:03,612 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:03,613 INFO  L225             Difference]: With dead ends: 106
[2025-05-07 17:28:03,613 INFO  L226             Difference]: Without dead ends: 106
[2025-05-07 17:28:03,613 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:28:03,614 INFO  L437           NwaCegarLoop]: 92 mSDtfsCounter, 1 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:03,614 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 443 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:28:03,614 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 106 states.
[2025-05-07 17:28:03,621 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106.
[2025-05-07 17:28:03,622 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 106 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 46 states have internal predecessors, (46), 31 states have call successors, (33), 18 states have call predecessors, (33), 31 states have return successors, (61), 41 states have call predecessors, (61), 31 states have call successors, (61)
[2025-05-07 17:28:03,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 140 transitions.
[2025-05-07 17:28:03,623 INFO  L79                 Accepts]: Start accepts. Automaton has 106 states and 140 transitions. Word has length 90
[2025-05-07 17:28:03,623 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:03,623 INFO  L485      AbstractCegarLoop]: Abstraction has 106 states and 140 transitions.
[2025-05-07 17:28:03,624 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 4 states have call successors, (22), 1 states have call predecessors, (22), 5 states have return successors, (23), 6 states have call predecessors, (23), 4 states have call successors, (23)
[2025-05-07 17:28:03,624 INFO  L278                IsEmpty]: Start isEmpty. Operand 106 states and 140 transitions.
[2025-05-07 17:28:03,625 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-05-07 17:28:03,625 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:03,625 INFO  L218           NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:03,625 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-05-07 17:28:03,626 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:03,626 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:03,626 INFO  L85        PathProgramCache]: Analyzing trace with hash -437334264, now seen corresponding path program 2 times
[2025-05-07 17:28:03,626 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:03,626 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867294099]
[2025-05-07 17:28:03,626 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:28:03,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:03,662 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes.
[2025-05-07 17:28:03,708 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements.
[2025-05-07 17:28:03,708 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:28:03,708 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:04,875 INFO  L134       CoverageAnalysis]: Checked inductivity of 94 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked.
[2025-05-07 17:28:04,875 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:04,875 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867294099]
[2025-05-07 17:28:04,875 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867294099] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:04,875 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430608368]
[2025-05-07 17:28:04,875 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:28:04,875 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:04,878 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:04,879 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:28:04,880 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-05-07 17:28:05,137 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes.
[2025-05-07 17:28:05,291 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 122 of 122 statements.
[2025-05-07 17:28:05,291 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:28:05,291 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:05,296 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1576 conjuncts, 79 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:05,301 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:05,515 INFO  L134       CoverageAnalysis]: Checked inductivity of 94 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked.
[2025-05-07 17:28:05,515 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:08,708 INFO  L325             Elim1Store]: treesize reduction 5, result has 37.5 percent of original size
[2025-05-07 17:28:08,708 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12
[2025-05-07 17:28:09,298 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5
[2025-05-07 17:28:09,688 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5
[2025-05-07 17:28:09,839 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5
[2025-05-07 17:28:10,031 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22
[2025-05-07 17:28:10,104 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5
[2025-05-07 17:28:12,214 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [430608368] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:12,214 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-05-07 17:28:12,214 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 25
[2025-05-07 17:28:12,214 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174440373]
[2025-05-07 17:28:12,214 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:12,215 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2025-05-07 17:28:12,215 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:12,215 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2025-05-07 17:28:12,215 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=898, Unknown=1, NotChecked=0, Total=992
[2025-05-07 17:28:12,216 INFO  L87              Difference]: Start difference. First operand 106 states and 140 transitions. Second operand  has 25 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 20 states have internal predecessors, (45), 12 states have call successors, (29), 2 states have call predecessors, (29), 17 states have return successors, (39), 22 states have call predecessors, (39), 12 states have call successors, (39)
[2025-05-07 17:28:12,585 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:12,586 INFO  L93              Difference]: Finished difference Result 120 states and 169 transitions.
[2025-05-07 17:28:12,586 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-05-07 17:28:12,586 INFO  L79                 Accepts]: Start accepts. Automaton has  has 25 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 20 states have internal predecessors, (45), 12 states have call successors, (29), 2 states have call predecessors, (29), 17 states have return successors, (39), 22 states have call predecessors, (39), 12 states have call successors, (39) Word has length 122
[2025-05-07 17:28:12,586 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:12,587 INFO  L225             Difference]: With dead ends: 120
[2025-05-07 17:28:12,588 INFO  L226             Difference]: Without dead ends: 120
[2025-05-07 17:28:12,588 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=132, Invalid=1199, Unknown=1, NotChecked=0, Total=1332
[2025-05-07 17:28:12,589 INFO  L437           NwaCegarLoop]: 76 mSDtfsCounter, 14 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:12,589 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1148 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:28:12,589 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 120 states.
[2025-05-07 17:28:12,596 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 106.
[2025-05-07 17:28:12,596 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 106 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 46 states have internal predecessors, (46), 31 states have call successors, (33), 18 states have call predecessors, (33), 31 states have return successors, (61), 41 states have call predecessors, (61), 31 states have call successors, (61)
[2025-05-07 17:28:12,597 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 140 transitions.
[2025-05-07 17:28:12,597 INFO  L79                 Accepts]: Start accepts. Automaton has 106 states and 140 transitions. Word has length 122
[2025-05-07 17:28:12,598 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:12,598 INFO  L485      AbstractCegarLoop]: Abstraction has 106 states and 140 transitions.
[2025-05-07 17:28:12,598 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 20 states have internal predecessors, (45), 12 states have call successors, (29), 2 states have call predecessors, (29), 17 states have return successors, (39), 22 states have call predecessors, (39), 12 states have call successors, (39)
[2025-05-07 17:28:12,598 INFO  L278                IsEmpty]: Start isEmpty. Operand 106 states and 140 transitions.
[2025-05-07 17:28:12,599 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-05-07 17:28:12,599 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:12,600 INFO  L218           NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:12,605 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-05-07 17:28:12,800 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:12,801 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:12,801 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:12,801 INFO  L85        PathProgramCache]: Analyzing trace with hash 949579756, now seen corresponding path program 1 times
[2025-05-07 17:28:12,801 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:12,801 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033193637]
[2025-05-07 17:28:12,801 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:12,802 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:12,851 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-05-07 17:28:12,862 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-05-07 17:28:12,862 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:12,862 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:12,979 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked.
[2025-05-07 17:28:12,979 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:12,979 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033193637]
[2025-05-07 17:28:12,979 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033193637] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:12,979 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:12,979 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:28:12,979 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820576308]
[2025-05-07 17:28:12,979 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:12,980 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:28:12,980 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:12,980 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:28:12,980 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:28:12,980 INFO  L87              Difference]: Start difference. First operand 106 states and 140 transitions. Second operand  has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 6 states have call successors, (27), 1 states have call predecessors, (27), 7 states have return successors, (31), 8 states have call predecessors, (31), 6 states have call successors, (31)
[2025-05-07 17:28:13,040 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:13,040 INFO  L93              Difference]: Finished difference Result 117 states and 165 transitions.
[2025-05-07 17:28:13,041 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:28:13,041 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 6 states have call successors, (27), 1 states have call predecessors, (27), 7 states have return successors, (31), 8 states have call predecessors, (31), 6 states have call successors, (31) Word has length 122
[2025-05-07 17:28:13,041 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:13,042 INFO  L225             Difference]: With dead ends: 117
[2025-05-07 17:28:13,042 INFO  L226             Difference]: Without dead ends: 117
[2025-05-07 17:28:13,043 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:28:13,043 INFO  L437           NwaCegarLoop]: 95 mSDtfsCounter, 1 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:13,043 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 633 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:13,044 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2025-05-07 17:28:13,050 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117.
[2025-05-07 17:28:13,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 117 states, 48 states have (on average 1.0416666666666667) internal successors, (50), 50 states have internal predecessors, (50), 34 states have call successors, (36), 18 states have call predecessors, (36), 35 states have return successors, (79), 48 states have call predecessors, (79), 34 states have call successors, (79)
[2025-05-07 17:28:13,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 165 transitions.
[2025-05-07 17:28:13,051 INFO  L79                 Accepts]: Start accepts. Automaton has 117 states and 165 transitions. Word has length 122
[2025-05-07 17:28:13,051 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:13,051 INFO  L485      AbstractCegarLoop]: Abstraction has 117 states and 165 transitions.
[2025-05-07 17:28:13,052 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 6 states have call successors, (27), 1 states have call predecessors, (27), 7 states have return successors, (31), 8 states have call predecessors, (31), 6 states have call successors, (31)
[2025-05-07 17:28:13,052 INFO  L278                IsEmpty]: Start isEmpty. Operand 117 states and 165 transitions.
[2025-05-07 17:28:13,053 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2025-05-07 17:28:13,053 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:13,053 INFO  L218           NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:13,053 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:28:13,053 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:13,054 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:13,054 INFO  L85        PathProgramCache]: Analyzing trace with hash 1958757248, now seen corresponding path program 1 times
[2025-05-07 17:28:13,054 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:13,054 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943701045]
[2025-05-07 17:28:13,054 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:13,054 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:13,094 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes.
[2025-05-07 17:28:13,109 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements.
[2025-05-07 17:28:13,109 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:13,109 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:13,221 INFO  L134       CoverageAnalysis]: Checked inductivity of 89 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked.
[2025-05-07 17:28:13,221 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:13,221 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943701045]
[2025-05-07 17:28:13,221 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943701045] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:13,221 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:13,221 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-05-07 17:28:13,221 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695507883]
[2025-05-07 17:28:13,221 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:13,221 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-05-07 17:28:13,221 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:13,222 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-05-07 17:28:13,222 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:28:13,222 INFO  L87              Difference]: Start difference. First operand 117 states and 165 transitions. Second operand  has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (25), 1 states have call predecessors, (25), 7 states have return successors, (28), 8 states have call predecessors, (28), 6 states have call successors, (28)
[2025-05-07 17:28:13,280 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:13,280 INFO  L93              Difference]: Finished difference Result 117 states and 164 transitions.
[2025-05-07 17:28:13,281 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-05-07 17:28:13,281 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), 6 states have call successors, (25), 1 states have call predecessors, (25), 7 states have return successors, (28), 8 states have call predecessors, (28), 6 states have call successors, (28) Word has length 119
[2025-05-07 17:28:13,281 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:13,282 INFO  L225             Difference]: With dead ends: 117
[2025-05-07 17:28:13,282 INFO  L226             Difference]: Without dead ends: 117
[2025-05-07 17:28:13,282 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-05-07 17:28:13,282 INFO  L437           NwaCegarLoop]: 89 mSDtfsCounter, 1 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:13,283 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 595 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:13,283 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 117 states.
[2025-05-07 17:28:13,288 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112.
[2025-05-07 17:28:13,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 112 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 48 states have internal predecessors, (48), 33 states have call successors, (35), 18 states have call predecessors, (35), 33 states have return successors, (74), 45 states have call predecessors, (74), 33 states have call successors, (74)
[2025-05-07 17:28:13,290 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions.
[2025-05-07 17:28:13,290 INFO  L79                 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 119
[2025-05-07 17:28:13,290 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:13,290 INFO  L485      AbstractCegarLoop]: Abstraction has 112 states and 157 transitions.
[2025-05-07 17:28:13,291 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), 6 states have call successors, (25), 1 states have call predecessors, (25), 7 states have return successors, (28), 8 states have call predecessors, (28), 6 states have call successors, (28)
[2025-05-07 17:28:13,291 INFO  L278                IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions.
[2025-05-07 17:28:13,292 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2025-05-07 17:28:13,292 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:13,293 INFO  L218           NwaCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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]
[2025-05-07 17:28:13,293 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:28:13,293 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:13,293 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:13,293 INFO  L85        PathProgramCache]: Analyzing trace with hash -833396983, now seen corresponding path program 2 times
[2025-05-07 17:28:13,293 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:13,293 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130082612]
[2025-05-07 17:28:13,293 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:28:13,293 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:13,322 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes.
[2025-05-07 17:28:13,339 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 154 of 154 statements.
[2025-05-07 17:28:13,339 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:28:13,339 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:13,453 INFO  L134       CoverageAnalysis]: Checked inductivity of 188 backedges. 54 proven. 4 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked.
[2025-05-07 17:28:13,454 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:13,454 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130082612]
[2025-05-07 17:28:13,454 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130082612] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:13,454 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760811752]
[2025-05-07 17:28:13,454 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:28:13,454 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:13,456 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:13,457 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:28:13,458 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-05-07 17:28:13,759 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes.
[2025-05-07 17:28:13,935 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 154 of 154 statements.
[2025-05-07 17:28:13,935 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:28:13,935 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:13,940 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2000 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:13,944 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:13,999 INFO  L134       CoverageAnalysis]: Checked inductivity of 188 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked.
[2025-05-07 17:28:13,999 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:15,054 INFO  L134       CoverageAnalysis]: Checked inductivity of 188 backedges. 54 proven. 4 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked.
[2025-05-07 17:28:15,054 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760811752] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:28:15,054 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:28:15,055 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12
[2025-05-07 17:28:15,055 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426646752]
[2025-05-07 17:28:15,055 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:15,055 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-05-07 17:28:15,055 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:15,056 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-05-07 17:28:15,056 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2025-05-07 17:28:15,056 INFO  L87              Difference]: Start difference. First operand 112 states and 157 transitions. Second operand  has 12 states, 10 states have (on average 4.6) internal successors, (46), 12 states have internal predecessors, (46), 10 states have call successors, (36), 2 states have call predecessors, (36), 10 states have return successors, (43), 12 states have call predecessors, (43), 10 states have call successors, (43)
[2025-05-07 17:28:15,143 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:15,143 INFO  L93              Difference]: Finished difference Result 128 states and 182 transitions.
[2025-05-07 17:28:15,144 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-05-07 17:28:15,144 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 10 states have (on average 4.6) internal successors, (46), 12 states have internal predecessors, (46), 10 states have call successors, (36), 2 states have call predecessors, (36), 10 states have return successors, (43), 12 states have call predecessors, (43), 10 states have call successors, (43) Word has length 154
[2025-05-07 17:28:15,144 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:15,145 INFO  L225             Difference]: With dead ends: 128
[2025-05-07 17:28:15,145 INFO  L226             Difference]: Without dead ends: 128
[2025-05-07 17:28:15,145 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 299 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:15,145 INFO  L437           NwaCegarLoop]: 99 mSDtfsCounter, 2 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:15,146 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 749 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:15,146 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 128 states.
[2025-05-07 17:28:15,153 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120.
[2025-05-07 17:28:15,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 120 states, 49 states have (on average 1.0408163265306123) internal successors, (51), 51 states have internal predecessors, (51), 35 states have call successors, (37), 18 states have call predecessors, (37), 36 states have return successors, (80), 50 states have call predecessors, (80), 35 states have call successors, (80)
[2025-05-07 17:28:15,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions.
[2025-05-07 17:28:15,155 INFO  L79                 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 154
[2025-05-07 17:28:15,156 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:15,156 INFO  L485      AbstractCegarLoop]: Abstraction has 120 states and 168 transitions.
[2025-05-07 17:28:15,156 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 10 states have (on average 4.6) internal successors, (46), 12 states have internal predecessors, (46), 10 states have call successors, (36), 2 states have call predecessors, (36), 10 states have return successors, (43), 12 states have call predecessors, (43), 10 states have call successors, (43)
[2025-05-07 17:28:15,156 INFO  L278                IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions.
[2025-05-07 17:28:15,158 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 155
[2025-05-07 17:28:15,158 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:15,158 INFO  L218           NwaCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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]
[2025-05-07 17:28:15,163 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-05-07 17:28:15,359 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:15,359 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:15,360 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:15,361 INFO  L85        PathProgramCache]: Analyzing trace with hash 2110673793, now seen corresponding path program 3 times
[2025-05-07 17:28:15,361 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:15,361 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296509651]
[2025-05-07 17:28:15,361 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:28:15,361 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:15,438 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 154 statements into 4 equivalence classes.
[2025-05-07 17:28:15,462 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 137 of 154 statements.
[2025-05-07 17:28:15,462 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-05-07 17:28:15,462 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:15,601 INFO  L134       CoverageAnalysis]: Checked inductivity of 188 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked.
[2025-05-07 17:28:15,601 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:15,601 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296509651]
[2025-05-07 17:28:15,601 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296509651] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:28:15,601 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529685280]
[2025-05-07 17:28:15,601 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-05-07 17:28:15,601 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:28:15,603 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:28:15,604 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:28:15,605 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-05-07 17:28:15,928 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 154 statements into 4 equivalence classes.
[2025-05-07 17:28:16,058 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 137 of 154 statements.
[2025-05-07 17:28:16,058 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-05-07 17:28:16,058 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:16,063 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1632 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-05-07 17:28:16,066 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:28:16,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 188 backedges. 82 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked.
[2025-05-07 17:28:16,116 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:28:17,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 188 backedges. 60 proven. 4 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked.
[2025-05-07 17:28:17,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529685280] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:28:17,624 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:28:17,624 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14
[2025-05-07 17:28:17,625 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899098774]
[2025-05-07 17:28:17,625 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:28:17,625 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-05-07 17:28:17,625 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:17,625 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-05-07 17:28:17,625 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:17,625 INFO  L87              Difference]: Start difference. First operand 120 states and 168 transitions. Second operand  has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 14 states have internal predecessors, (50), 10 states have call successors, (38), 2 states have call predecessors, (38), 12 states have return successors, (49), 14 states have call predecessors, (49), 10 states have call successors, (49)
[2025-05-07 17:28:17,722 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:17,722 INFO  L93              Difference]: Finished difference Result 98 states and 126 transitions.
[2025-05-07 17:28:17,722 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-05-07 17:28:17,722 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), 10 states have call successors, (38), 2 states have call predecessors, (38), 12 states have return successors, (49), 14 states have call predecessors, (49), 10 states have call successors, (49) Word has length 154
[2025-05-07 17:28:17,722 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:17,722 INFO  L225             Difference]: With dead ends: 98
[2025-05-07 17:28:17,722 INFO  L226             Difference]: Without dead ends: 0
[2025-05-07 17:28:17,722 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 297 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182
[2025-05-07 17:28:17,723 INFO  L437           NwaCegarLoop]: 96 mSDtfsCounter, 4 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:17,723 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 980 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:28:17,723 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-05-07 17:28:17,723 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-05-07 17:28:17,723 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:28:17,723 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-05-07 17:28:17,723 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154
[2025-05-07 17:28:17,723 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:17,723 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-05-07 17:28:17,724 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), 10 states have call successors, (38), 2 states have call predecessors, (38), 12 states have return successors, (49), 14 states have call predecessors, (49), 10 states have call successors, (49)
[2025-05-07 17:28:17,724 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-05-07 17:28:17,724 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-05-07 17:28:17,725 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-05-07 17:28:17,731 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-05-07 17:28:17,926 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-05-07 17:28:17,934 INFO  L422         BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:17,940 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-05-07 17:28:17,945 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.05 05:28:17 BoogieIcfgContainer
[2025-05-07 17:28:17,945 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-05-07 17:28:17,945 INFO  L158              Benchmark]: Toolchain (without parser) took 21204.57ms. Allocated memory was 234.9MB in the beginning and 436.2MB in the end (delta: 201.3MB). Free memory was 153.3MB in the beginning and 183.4MB in the end (delta: -30.2MB). Peak memory consumption was 178.1MB. Max. memory is 33.6GB.
[2025-05-07 17:28:17,946 INFO  L158              Benchmark]: SmtParser took 0.29ms. Allocated memory is still 234.9MB. Free memory is still 172.7MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:17,946 INFO  L158              Benchmark]: ChcToBoogie took 30.50ms. Allocated memory is still 234.9MB. Free memory was 153.3MB in the beginning and 150.8MB in the end (delta: 2.5MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-05-07 17:28:17,946 INFO  L158              Benchmark]: Boogie Preprocessor took 51.07ms. Allocated memory is still 234.9MB. Free memory was 150.8MB in the beginning and 147.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-05-07 17:28:17,946 INFO  L158              Benchmark]: RCFGBuilder took 337.77ms. Allocated memory is still 234.9MB. Free memory was 147.7MB in the beginning and 191.8MB in the end (delta: -44.2MB). Peak memory consumption was 41.9MB. Max. memory is 33.6GB.
[2025-05-07 17:28:17,946 INFO  L158              Benchmark]: TraceAbstraction took 20781.09ms. Allocated memory was 234.9MB in the beginning and 436.2MB in the end (delta: 201.3MB). Free memory was 191.4MB in the beginning and 183.4MB in the end (delta: 8.0MB). Peak memory consumption was 203.3MB. Max. memory is 33.6GB.
[2025-05-07 17:28:17,947 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.29ms. Allocated memory is still 234.9MB. Free memory is still 172.7MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 30.50ms. Allocated memory is still 234.9MB. Free memory was 153.3MB in the beginning and 150.8MB in the end (delta: 2.5MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * Boogie Preprocessor took 51.07ms. Allocated memory is still 234.9MB. Free memory was 150.8MB in the beginning and 147.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 337.77ms. Allocated memory is still 234.9MB. Free memory was 147.7MB in the beginning and 191.8MB in the end (delta: -44.2MB). Peak memory consumption was 41.9MB. Max. memory is 33.6GB.
 * TraceAbstraction took 20781.09ms. Allocated memory was 234.9MB in the beginning and 436.2MB in the end (delta: 201.3MB). Free memory was 191.4MB in the beginning and 183.4MB in the end (delta: 8.0MB). Peak memory consumption was 203.3MB. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Unknown line] : the set of constraint Horn clauses is satisfiable
    For all program executions holds that the set of constraint Horn clauses is satisfiable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 19 procedures, 79 locations, 126 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.7s, OverallIterations: 13, TraceHistogramMax: 7, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 8325 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7186 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1415 IncrementalHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 1139 mSDtfsCounter, 1415 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1136 GetRequests, 1001 SyntacticMatches, 11 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=12, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 35 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 1742 NumberOfCodeBlocks, 1708 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2120 ConstructedInterpolants, 0 QuantifiedInterpolants, 3620 SizeOfPredicates, 35 NumberOfNonLiveVariables, 6344 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 20 InterpolantComputations, 9 PerfectInterpolantSequences, 1558/1634 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:28:17,962 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
