./chc-comp-wrapper.sh ../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-162.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:20,697 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:20,799 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed3d002d-3a12-44f9-afe4-c49500d8aa5b/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:20,806 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:20,807 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:20,845 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:20,846 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:20,846 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:20,847 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:20,848 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:20,848 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:20,849 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:20,849 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:20,850 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:20,850 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:20,850 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:20,850 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:20,850 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:20,850 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:20,851 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:20,851 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:20,851 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:20,851 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:20,852 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:20,852 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:20,852 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:20,853 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:21,227 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:21,240 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:21,243 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:21,246 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:21,247 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:21,248 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed3d002d-3a12-44f9-afe4-c49500d8aa5b/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-162.smt2
[2025-04-28 21:21:21,251 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:21,256 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:21,681 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed3d002d-3a12-44f9-afe4-c49500d8aa5b/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-162.smt2
[2025-04-28 21:21:21,686 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:21,688 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:21,689 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:21,690 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:21,690 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:21,696 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:21" (1/1) ...
[2025-04-28 21:21:21,749 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:21 Unit
[2025-04-28 21:21:21,749 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:21,751 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:21,752 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:21,752 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:21,770 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:21" (1/1) ...
[2025-04-28 21:21:21,770 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:21" (1/1) ...
[2025-04-28 21:21:21,801 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:21" (1/1) ...
[2025-04-28 21:21:21,802 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:21" (1/1) ...
[2025-04-28 21:21:21,808 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:21" (1/1) ...
[2025-04-28 21:21:21,810 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:21" (1/1) ...
[2025-04-28 21:21:21,813 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:21" (1/1) ...
[2025-04-28 21:21:21,815 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:21" (1/1) ...
[2025-04-28 21:21:21,815 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:21" (1/1) ...
[2025-04-28 21:21:21,831 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:21,832 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:21,832 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:21,832 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:21,833 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:21" (1/1) ...
[2025-04-28 21:21:21,840 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:21,854 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:21,867 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-04-28 21:21:21,871 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-04-28 21:21:21,884 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:21,884 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:21,885 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:21,885 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure CHC_COMP_FALSE given in one single declaration
[2025-04-28 21:21:21,885 INFO  L130     BoogieDeclarations]: Found specification of procedure CHC_COMP_FALSE
[2025-04-28 21:21:21,885 INFO  L138     BoogieDeclarations]: Found implementation of procedure CHC_COMP_FALSE
[2025-04-28 21:21:21,885 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration
[2025-04-28 21:21:21,885 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_MAIN_42
[2025-04-28 21:21:21,885 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_MAIN_42
[2025-04-28 21:21:21,885 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:21,885 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:21,885 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:21,952 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:21,955 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:22,329 INFO  L?                        ?]: Removed 0 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:22,329 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:22,348 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:22,351 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-04-28 21:21:22,352 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:22 BoogieIcfgContainer
[2025-04-28 21:21:22,352 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:22,354 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:22,354 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:22,362 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:22,363 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:21" (1/3) ...
[2025-04-28 21:21:22,364 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aead78a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:22, skipping insertion in model container
[2025-04-28 21:21:22,364 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:21" (2/3) ...
[2025-04-28 21:21:22,365 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aead78a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:22, skipping insertion in model container
[2025-04-28 21:21:22,365 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:22" (3/3) ...
[2025-04-28 21:21:22,366 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:22,384 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:22,388 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 4 procedures, 46 locations, 121 edges, 4 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:22,439 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:22,459 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;@40ec487, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:22,459 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:22,463 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 46 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 19 states have internal predecessors, (19), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 24 states have call predecessors, (34), 34 states have call successors, (34)
[2025-04-28 21:21:22,477 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2025-04-28 21:21:22,477 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:22,478 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:22,478 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:22,484 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:22,485 INFO  L85        PathProgramCache]: Analyzing trace with hash -1767461499, now seen corresponding path program 1 times
[2025-04-28 21:21:22,493 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:22,493 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504973314]
[2025-04-28 21:21:22,494 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:22,495 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:22,524 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-04-28 21:21:22,542 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-04-28 21:21:22,542 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:22,542 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:22,762 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:22,763 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:22,763 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504973314]
[2025-04-28 21:21:22,764 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504973314] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:22,764 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:22,768 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:22,770 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758850788]
[2025-04-28 21:21:22,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:22,775 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:22,775 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:22,800 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:22,801 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:22,802 INFO  L87              Difference]: Start difference. First operand  has 46 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 19 states have internal predecessors, (19), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 24 states have call predecessors, (34), 34 states have call successors, (34) Second operand  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-04-28 21:21:23,223 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:23,224 INFO  L93              Difference]: Finished difference Result 48 states and 119 transitions.
[2025-04-28 21:21:23,225 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:23,227 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 12
[2025-04-28 21:21:23,227 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:23,270 INFO  L225             Difference]: With dead ends: 48
[2025-04-28 21:21:23,271 INFO  L226             Difference]: Without dead ends: 48
[2025-04-28 21:21:23,274 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-04-28 21:21:23,277 INFO  L437           NwaCegarLoop]: 56 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:23,280 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 121 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-04-28 21:21:23,306 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2025-04-28 21:21:23,396 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46.
[2025-04-28 21:21:23,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 46 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 18 states have internal predecessors, (18), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (65), 24 states have call predecessors, (65), 34 states have call successors, (65)
[2025-04-28 21:21:23,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 117 transitions.
[2025-04-28 21:21:23,411 INFO  L79                 Accepts]: Start accepts. Automaton has 46 states and 117 transitions. Word has length 12
[2025-04-28 21:21:23,427 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:23,427 INFO  L485      AbstractCegarLoop]: Abstraction has 46 states and 117 transitions.
[2025-04-28 21:21:23,428 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-04-28 21:21:23,428 INFO  L278                IsEmpty]: Start isEmpty. Operand 46 states and 117 transitions.
[2025-04-28 21:21:23,440 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2025-04-28 21:21:23,441 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:23,441 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:23,441 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:23,441 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:23,446 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:23,447 INFO  L85        PathProgramCache]: Analyzing trace with hash -129336803, now seen corresponding path program 1 times
[2025-04-28 21:21:23,447 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:23,447 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112218171]
[2025-04-28 21:21:23,447 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:23,447 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:23,461 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-04-28 21:21:23,484 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-04-28 21:21:23,487 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:23,487 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:23,623 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:23,625 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:23,625 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112218171]
[2025-04-28 21:21:23,625 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112218171] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:23,626 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:23,626 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:23,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629774600]
[2025-04-28 21:21:23,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:23,628 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:23,628 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:23,629 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:23,629 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:23,629 INFO  L87              Difference]: Start difference. First operand 46 states and 117 transitions. Second operand  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-04-28 21:21:23,973 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:23,974 INFO  L93              Difference]: Finished difference Result 48 states and 118 transitions.
[2025-04-28 21:21:23,974 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:23,974 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 12
[2025-04-28 21:21:23,975 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:23,977 INFO  L225             Difference]: With dead ends: 48
[2025-04-28 21:21:23,977 INFO  L226             Difference]: Without dead ends: 48
[2025-04-28 21:21:23,978 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-04-28 21:21:23,979 INFO  L437           NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:23,979 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 124 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:23,980 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2025-04-28 21:21:24,002 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46.
[2025-04-28 21:21:24,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 46 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 18 states have internal predecessors, (18), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (64), 24 states have call predecessors, (64), 34 states have call successors, (64)
[2025-04-28 21:21:24,008 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 116 transitions.
[2025-04-28 21:21:24,010 INFO  L79                 Accepts]: Start accepts. Automaton has 46 states and 116 transitions. Word has length 12
[2025-04-28 21:21:24,011 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:24,011 INFO  L485      AbstractCegarLoop]: Abstraction has 46 states and 116 transitions.
[2025-04-28 21:21:24,011 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-04-28 21:21:24,011 INFO  L278                IsEmpty]: Start isEmpty. Operand 46 states and 116 transitions.
[2025-04-28 21:21:24,014 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:24,017 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:24,018 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:24,018 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:24,018 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:24,019 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:24,019 INFO  L85        PathProgramCache]: Analyzing trace with hash -582408795, now seen corresponding path program 1 times
[2025-04-28 21:21:24,021 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:24,021 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646066232]
[2025-04-28 21:21:24,021 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:24,022 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:24,033 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:24,048 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:24,048 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:24,048 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:24,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:24,212 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:24,213 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646066232]
[2025-04-28 21:21:24,213 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646066232] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:24,213 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:24,213 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:24,213 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966868427]
[2025-04-28 21:21:24,213 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:24,213 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:24,213 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:24,216 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:24,216 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:24,216 INFO  L87              Difference]: Start difference. First operand 46 states and 116 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:24,524 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:24,524 INFO  L93              Difference]: Finished difference Result 48 states and 117 transitions.
[2025-04-28 21:21:24,524 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:24,524 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 16
[2025-04-28 21:21:24,525 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:24,526 INFO  L225             Difference]: With dead ends: 48
[2025-04-28 21:21:24,526 INFO  L226             Difference]: Without dead ends: 48
[2025-04-28 21:21:24,527 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-04-28 21:21:24,528 INFO  L437           NwaCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:24,528 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 127 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:24,529 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2025-04-28 21:21:24,546 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46.
[2025-04-28 21:21:24,551 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 46 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 18 states have internal predecessors, (18), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (63), 24 states have call predecessors, (63), 34 states have call successors, (63)
[2025-04-28 21:21:24,553 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 115 transitions.
[2025-04-28 21:21:24,553 INFO  L79                 Accepts]: Start accepts. Automaton has 46 states and 115 transitions. Word has length 16
[2025-04-28 21:21:24,556 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:24,556 INFO  L485      AbstractCegarLoop]: Abstraction has 46 states and 115 transitions.
[2025-04-28 21:21:24,556 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:24,556 INFO  L278                IsEmpty]: Start isEmpty. Operand 46 states and 115 transitions.
[2025-04-28 21:21:24,559 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:24,559 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:24,559 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:24,559 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:24,560 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:24,560 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:24,560 INFO  L85        PathProgramCache]: Analyzing trace with hash 1411317840, now seen corresponding path program 1 times
[2025-04-28 21:21:24,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:24,563 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831881227]
[2025-04-28 21:21:24,564 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:24,564 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:24,573 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:24,590 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:24,590 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:24,591 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:24,743 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:24,744 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:24,744 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831881227]
[2025-04-28 21:21:24,744 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831881227] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:24,744 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:24,744 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:24,744 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711985785]
[2025-04-28 21:21:24,744 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:24,744 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:24,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:24,745 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:24,745 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:24,746 INFO  L87              Difference]: Start difference. First operand 46 states and 115 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:25,000 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:25,000 INFO  L93              Difference]: Finished difference Result 48 states and 116 transitions.
[2025-04-28 21:21:25,001 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:25,001 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 16
[2025-04-28 21:21:25,001 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:25,003 INFO  L225             Difference]: With dead ends: 48
[2025-04-28 21:21:25,004 INFO  L226             Difference]: Without dead ends: 48
[2025-04-28 21:21:25,004 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-04-28 21:21:25,005 INFO  L437           NwaCegarLoop]: 59 mSDtfsCounter, 1 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:25,005 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 130 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:25,006 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48 states.
[2025-04-28 21:21:25,018 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46.
[2025-04-28 21:21:25,019 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 46 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 18 states have internal predecessors, (18), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (62), 24 states have call predecessors, (62), 34 states have call successors, (62)
[2025-04-28 21:21:25,020 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 114 transitions.
[2025-04-28 21:21:25,021 INFO  L79                 Accepts]: Start accepts. Automaton has 46 states and 114 transitions. Word has length 16
[2025-04-28 21:21:25,021 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:25,021 INFO  L485      AbstractCegarLoop]: Abstraction has 46 states and 114 transitions.
[2025-04-28 21:21:25,021 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:21:25,021 INFO  L278                IsEmpty]: Start isEmpty. Operand 46 states and 114 transitions.
[2025-04-28 21:21:25,024 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:25,024 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:25,024 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:25,024 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:21:25,025 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:25,025 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:25,025 INFO  L85        PathProgramCache]: Analyzing trace with hash -1719297736, now seen corresponding path program 1 times
[2025-04-28 21:21:25,025 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:25,025 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282810921]
[2025-04-28 21:21:25,025 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:25,026 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:25,036 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:25,051 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:25,054 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:25,054 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:25,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:25,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:25,138 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282810921]
[2025-04-28 21:21:25,138 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282810921] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:25,138 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:25,138 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:25,138 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421688976]
[2025-04-28 21:21:25,138 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:25,138 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:25,139 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:25,139 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:25,139 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:25,139 INFO  L87              Difference]: Start difference. First operand 46 states and 114 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:25,377 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:25,377 INFO  L93              Difference]: Finished difference Result 50 states and 148 transitions.
[2025-04-28 21:21:25,377 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:25,377 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 24
[2025-04-28 21:21:25,378 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:25,380 INFO  L225             Difference]: With dead ends: 50
[2025-04-28 21:21:25,380 INFO  L226             Difference]: Without dead ends: 50
[2025-04-28 21:21:25,380 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-04-28 21:21:25,381 INFO  L437           NwaCegarLoop]: 85 mSDtfsCounter, 1 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:25,381 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 202 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:25,384 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 50 states.
[2025-04-28 21:21:25,408 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48.
[2025-04-28 21:21:25,412 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 48 states, 8 states have (on average 2.375) internal successors, (19), 19 states have internal predecessors, (19), 34 states have call successors, (34), 3 states have call predecessors, (34), 5 states have return successors, (93), 25 states have call predecessors, (93), 34 states have call successors, (93)
[2025-04-28 21:21:25,414 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 146 transitions.
[2025-04-28 21:21:25,416 INFO  L79                 Accepts]: Start accepts. Automaton has 48 states and 146 transitions. Word has length 24
[2025-04-28 21:21:25,416 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:25,416 INFO  L485      AbstractCegarLoop]: Abstraction has 48 states and 146 transitions.
[2025-04-28 21:21:25,416 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:25,417 INFO  L278                IsEmpty]: Start isEmpty. Operand 48 states and 146 transitions.
[2025-04-28 21:21:25,423 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:25,423 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:25,424 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:25,424 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-04-28 21:21:25,424 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:25,424 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:25,424 INFO  L85        PathProgramCache]: Analyzing trace with hash 914224013, now seen corresponding path program 1 times
[2025-04-28 21:21:25,425 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:25,425 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236667777]
[2025-04-28 21:21:25,425 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:25,425 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:25,435 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:25,441 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:25,442 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:25,442 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:25,645 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-04-28 21:21:25,645 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:25,645 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236667777]
[2025-04-28 21:21:25,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236667777] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:25,646 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122649539]
[2025-04-28 21:21:25,646 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:25,646 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:25,652 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:25,656 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:25,658 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:25,714 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:25,759 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:25,760 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:25,760 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:25,763 INFO  L256         TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:25,769 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:25,956 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:25,956 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:26,628 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:26,629 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122649539] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:26,630 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:26,630 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 13
[2025-04-28 21:21:26,630 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33645553]
[2025-04-28 21:21:26,630 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:26,631 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-28 21:21:26,631 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:26,632 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-28 21:21:26,633 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:26,633 INFO  L87              Difference]: Start difference. First operand 48 states and 146 transitions. Second operand  has 13 states, 6 states have (on average 3.0) internal successors, (18), 12 states have internal predecessors, (18), 10 states have call successors, (12), 1 states have call predecessors, (12), 6 states have return successors, (12), 5 states have call predecessors, (12), 10 states have call successors, (12)
[2025-04-28 21:21:28,368 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:28,368 INFO  L93              Difference]: Finished difference Result 77 states and 275 transitions.
[2025-04-28 21:21:28,369 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:28,369 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 6 states have (on average 3.0) internal successors, (18), 12 states have internal predecessors, (18), 10 states have call successors, (12), 1 states have call predecessors, (12), 6 states have return successors, (12), 5 states have call predecessors, (12), 10 states have call successors, (12) Word has length 24
[2025-04-28 21:21:28,369 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:28,372 INFO  L225             Difference]: With dead ends: 77
[2025-04-28 21:21:28,372 INFO  L226             Difference]: Without dead ends: 77
[2025-04-28 21:21:28,372 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:28,373 INFO  L437           NwaCegarLoop]: 68 mSDtfsCounter, 19 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:28,376 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 310 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-04-28 21:21:28,377 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 77 states.
[2025-04-28 21:21:28,425 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71.
[2025-04-28 21:21:28,425 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 71 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 26 states have internal predecessors, (27), 52 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (189), 40 states have call predecessors, (189), 52 states have call successors, (189)
[2025-04-28 21:21:28,427 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 268 transitions.
[2025-04-28 21:21:28,429 INFO  L79                 Accepts]: Start accepts. Automaton has 71 states and 268 transitions. Word has length 24
[2025-04-28 21:21:28,429 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:28,430 INFO  L485      AbstractCegarLoop]: Abstraction has 71 states and 268 transitions.
[2025-04-28 21:21:28,430 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 6 states have (on average 3.0) internal successors, (18), 12 states have internal predecessors, (18), 10 states have call successors, (12), 1 states have call predecessors, (12), 6 states have return successors, (12), 5 states have call predecessors, (12), 10 states have call successors, (12)
[2025-04-28 21:21:28,430 INFO  L278                IsEmpty]: Start isEmpty. Operand 71 states and 268 transitions.
[2025-04-28 21:21:28,435 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:28,436 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:28,436 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:28,442 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:28,636 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6
[2025-04-28 21:21:28,637 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:28,637 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:28,637 INFO  L85        PathProgramCache]: Analyzing trace with hash 313953133, now seen corresponding path program 1 times
[2025-04-28 21:21:28,637 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:28,638 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429512877]
[2025-04-28 21:21:28,638 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:28,638 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:28,643 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:28,648 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:28,648 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:28,648 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:28,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:28,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:28,770 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429512877]
[2025-04-28 21:21:28,770 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429512877] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:28,770 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823062349]
[2025-04-28 21:21:28,770 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:28,770 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:28,773 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:28,775 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:28,778 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:28,825 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:28,851 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:28,852 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:28,852 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:28,853 INFO  L256         TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:28,855 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:28,927 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:28,928 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:29,339 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:29,340 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [823062349] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:29,340 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:29,340 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10
[2025-04-28 21:21:29,340 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622523]
[2025-04-28 21:21:29,340 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:29,341 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:29,341 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:29,342 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:29,342 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:29,342 INFO  L87              Difference]: Start difference. First operand 71 states and 268 transitions. Second operand  has 10 states, 5 states have (on average 3.0) internal successors, (15), 10 states have internal predecessors, (15), 8 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9)
[2025-04-28 21:21:30,233 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:30,233 INFO  L93              Difference]: Finished difference Result 75 states and 272 transitions.
[2025-04-28 21:21:30,233 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:30,234 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 5 states have (on average 3.0) internal successors, (15), 10 states have internal predecessors, (15), 8 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) Word has length 20
[2025-04-28 21:21:30,234 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:30,236 INFO  L225             Difference]: With dead ends: 75
[2025-04-28 21:21:30,236 INFO  L226             Difference]: Without dead ends: 75
[2025-04-28 21:21:30,237 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:30,240 INFO  L437           NwaCegarLoop]: 60 mSDtfsCounter, 7 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:30,241 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 245 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-04-28 21:21:30,242 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 75 states.
[2025-04-28 21:21:30,276 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71.
[2025-04-28 21:21:30,276 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 71 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 26 states have internal predecessors, (27), 52 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (188), 40 states have call predecessors, (188), 52 states have call successors, (188)
[2025-04-28 21:21:30,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 267 transitions.
[2025-04-28 21:21:30,279 INFO  L79                 Accepts]: Start accepts. Automaton has 71 states and 267 transitions. Word has length 20
[2025-04-28 21:21:30,279 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:30,279 INFO  L485      AbstractCegarLoop]: Abstraction has 71 states and 267 transitions.
[2025-04-28 21:21:30,279 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 5 states have (on average 3.0) internal successors, (15), 10 states have internal predecessors, (15), 8 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9)
[2025-04-28 21:21:30,279 INFO  L278                IsEmpty]: Start isEmpty. Operand 71 states and 267 transitions.
[2025-04-28 21:21:30,284 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:30,284 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:30,285 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:30,291 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:21:30,486 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:30,486 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:30,486 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:30,487 INFO  L85        PathProgramCache]: Analyzing trace with hash 899879941, now seen corresponding path program 1 times
[2025-04-28 21:21:30,487 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:30,487 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424913511]
[2025-04-28 21:21:30,487 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:30,487 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:30,493 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:30,510 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:30,510 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:30,511 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:30,579 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:30,579 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:30,579 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424913511]
[2025-04-28 21:21:30,579 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424913511] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:30,580 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:30,580 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:30,580 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239899415]
[2025-04-28 21:21:30,580 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:30,580 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:30,580 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:30,580 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:30,581 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:30,581 INFO  L87              Difference]: Start difference. First operand 71 states and 267 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:30,772 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:30,772 INFO  L93              Difference]: Finished difference Result 75 states and 270 transitions.
[2025-04-28 21:21:30,772 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:30,773 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-04-28 21:21:30,773 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:30,776 INFO  L225             Difference]: With dead ends: 75
[2025-04-28 21:21:30,776 INFO  L226             Difference]: Without dead ends: 75
[2025-04-28 21:21:30,776 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-04-28 21:21:30,777 INFO  L437           NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:30,777 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 210 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:30,778 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 75 states.
[2025-04-28 21:21:30,799 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71.
[2025-04-28 21:21:30,800 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 71 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 26 states have internal predecessors, (27), 52 states have call successors, (52), 4 states have call predecessors, (52), 7 states have return successors, (186), 40 states have call predecessors, (186), 52 states have call successors, (186)
[2025-04-28 21:21:30,801 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 265 transitions.
[2025-04-28 21:21:30,801 INFO  L79                 Accepts]: Start accepts. Automaton has 71 states and 265 transitions. Word has length 20
[2025-04-28 21:21:30,802 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:30,802 INFO  L485      AbstractCegarLoop]: Abstraction has 71 states and 265 transitions.
[2025-04-28 21:21:30,802 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:30,802 INFO  L278                IsEmpty]: Start isEmpty. Operand 71 states and 265 transitions.
[2025-04-28 21:21:30,806 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:30,808 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:30,808 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:30,808 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-04-28 21:21:30,808 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:30,811 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:30,811 INFO  L85        PathProgramCache]: Analyzing trace with hash 1524325403, now seen corresponding path program 1 times
[2025-04-28 21:21:30,811 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:30,811 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836920777]
[2025-04-28 21:21:30,811 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:30,811 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:30,821 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:30,826 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:30,827 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:30,827 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:30,979 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:30,979 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:30,979 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836920777]
[2025-04-28 21:21:30,979 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836920777] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:30,980 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142108667]
[2025-04-28 21:21:30,980 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:30,980 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:30,982 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:30,985 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:30,988 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:31,034 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:31,057 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:31,057 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:31,057 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,058 INFO  L256         TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:31,060 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:31,136 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:31,136 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:31,487 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:31,487 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [142108667] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:31,488 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:31,488 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10
[2025-04-28 21:21:31,488 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003902198]
[2025-04-28 21:21:31,488 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:31,488 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:31,488 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:31,489 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:31,489 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:31,489 INFO  L87              Difference]: Start difference. First operand 71 states and 265 transitions. Second operand  has 10 states, 5 states have (on average 3.0) internal successors, (15), 10 states have internal predecessors, (15), 8 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9)
[2025-04-28 21:21:32,705 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:32,705 INFO  L93              Difference]: Finished difference Result 89 states and 438 transitions.
[2025-04-28 21:21:32,706 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:32,706 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 5 states have (on average 3.0) internal successors, (15), 10 states have internal predecessors, (15), 8 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9) Word has length 20
[2025-04-28 21:21:32,706 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:32,710 INFO  L225             Difference]: With dead ends: 89
[2025-04-28 21:21:32,710 INFO  L226             Difference]: Without dead ends: 89
[2025-04-28 21:21:32,711 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:32,711 INFO  L437           NwaCegarLoop]: 58 mSDtfsCounter, 7 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:32,711 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 214 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-04-28 21:21:32,712 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 89 states.
[2025-04-28 21:21:32,755 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77.
[2025-04-28 21:21:32,756 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 77 states, 13 states have (on average 2.230769230769231) internal successors, (29), 28 states have internal predecessors, (29), 54 states have call successors, (54), 4 states have call predecessors, (54), 9 states have return successors, (243), 44 states have call predecessors, (243), 54 states have call successors, (243)
[2025-04-28 21:21:32,758 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 326 transitions.
[2025-04-28 21:21:32,758 INFO  L79                 Accepts]: Start accepts. Automaton has 77 states and 326 transitions. Word has length 20
[2025-04-28 21:21:32,758 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:32,758 INFO  L485      AbstractCegarLoop]: Abstraction has 77 states and 326 transitions.
[2025-04-28 21:21:32,759 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 5 states have (on average 3.0) internal successors, (15), 10 states have internal predecessors, (15), 8 states have call successors, (9), 1 states have call predecessors, (9), 5 states have return successors, (9), 3 states have call predecessors, (9), 8 states have call successors, (9)
[2025-04-28 21:21:32,759 INFO  L278                IsEmpty]: Start isEmpty. Operand 77 states and 326 transitions.
[2025-04-28 21:21:32,764 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:32,764 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:32,764 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:32,769 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:32,964 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:32,965 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:32,965 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:32,965 INFO  L85        PathProgramCache]: Analyzing trace with hash -508925466, now seen corresponding path program 1 times
[2025-04-28 21:21:32,966 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:32,966 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781044810]
[2025-04-28 21:21:32,966 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:32,966 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:32,971 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:32,979 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:32,979 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:32,979 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:33,158 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:33,158 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781044810]
[2025-04-28 21:21:33,158 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781044810] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:33,158 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005846026]
[2025-04-28 21:21:33,158 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:33,158 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:33,160 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:33,163 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:33,168 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:33,218 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:33,254 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:33,254 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:33,254 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,255 INFO  L256         TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:33,257 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:33,405 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:33,407 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:33,948 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:33,949 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005846026] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:33,949 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:33,949 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16
[2025-04-28 21:21:33,949 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607645786]
[2025-04-28 21:21:33,949 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:33,950 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-04-28 21:21:33,950 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:33,950 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-04-28 21:21:33,950 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:33,951 INFO  L87              Difference]: Start difference. First operand 77 states and 326 transitions. Second operand  has 16 states, 8 states have (on average 2.625) internal successors, (21), 14 states have internal predecessors, (21), 11 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (12), 5 states have call predecessors, (12), 11 states have call successors, (12)
[2025-04-28 21:21:36,002 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:36,002 INFO  L93              Difference]: Finished difference Result 128 states and 677 transitions.
[2025-04-28 21:21:36,002 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2025-04-28 21:21:36,003 INFO  L79                 Accepts]: Start accepts. Automaton has  has 16 states, 8 states have (on average 2.625) internal successors, (21), 14 states have internal predecessors, (21), 11 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (12), 5 states have call predecessors, (12), 11 states have call successors, (12) Word has length 24
[2025-04-28 21:21:36,003 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:36,008 INFO  L225             Difference]: With dead ends: 128
[2025-04-28 21:21:36,008 INFO  L226             Difference]: Without dead ends: 128
[2025-04-28 21:21:36,009 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600
[2025-04-28 21:21:36,009 INFO  L437           NwaCegarLoop]: 73 mSDtfsCounter, 19 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 1758 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:36,010 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 444 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1758 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-04-28 21:21:36,010 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 128 states.
[2025-04-28 21:21:36,076 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 99.
[2025-04-28 21:21:36,077 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 99 states, 16 states have (on average 2.3125) internal successors, (37), 35 states have internal predecessors, (37), 71 states have call successors, (71), 5 states have call predecessors, (71), 11 states have return successors, (321), 58 states have call predecessors, (321), 71 states have call successors, (321)
[2025-04-28 21:21:36,079 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 429 transitions.
[2025-04-28 21:21:36,080 INFO  L79                 Accepts]: Start accepts. Automaton has 99 states and 429 transitions. Word has length 24
[2025-04-28 21:21:36,080 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:36,080 INFO  L485      AbstractCegarLoop]: Abstraction has 99 states and 429 transitions.
[2025-04-28 21:21:36,080 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 8 states have (on average 2.625) internal successors, (21), 14 states have internal predecessors, (21), 11 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (12), 5 states have call predecessors, (12), 11 states have call successors, (12)
[2025-04-28 21:21:36,080 INFO  L278                IsEmpty]: Start isEmpty. Operand 99 states and 429 transitions.
[2025-04-28 21:21:36,087 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:36,087 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:36,087 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:36,093 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:36,291 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2025-04-28 21:21:36,292 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:36,292 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:36,292 INFO  L85        PathProgramCache]: Analyzing trace with hash 2110252211, now seen corresponding path program 1 times
[2025-04-28 21:21:36,292 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:36,292 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404375224]
[2025-04-28 21:21:36,293 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,293 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:36,299 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:36,311 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:36,311 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,311 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,385 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:36,385 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:36,386 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404375224]
[2025-04-28 21:21:36,386 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404375224] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:36,386 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:36,386 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:36,386 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644155790]
[2025-04-28 21:21:36,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:36,386 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:36,387 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:36,387 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:36,387 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:36,388 INFO  L87              Difference]: Start difference. First operand 99 states and 429 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:36,600 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:36,600 INFO  L93              Difference]: Finished difference Result 107 states and 497 transitions.
[2025-04-28 21:21:36,601 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:36,601 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-04-28 21:21:36,601 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:36,606 INFO  L225             Difference]: With dead ends: 107
[2025-04-28 21:21:36,606 INFO  L226             Difference]: Without dead ends: 107
[2025-04-28 21:21:36,607 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-04-28 21:21:36,610 INFO  L437           NwaCegarLoop]: 83 mSDtfsCounter, 1 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:36,611 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 195 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:36,612 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 107 states.
[2025-04-28 21:21:36,665 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101.
[2025-04-28 21:21:36,666 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 101 states, 17 states have (on average 2.235294117647059) internal successors, (38), 36 states have internal predecessors, (38), 71 states have call successors, (71), 5 states have call predecessors, (71), 12 states have return successors, (380), 59 states have call predecessors, (380), 71 states have call successors, (380)
[2025-04-28 21:21:36,668 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 489 transitions.
[2025-04-28 21:21:36,669 INFO  L79                 Accepts]: Start accepts. Automaton has 101 states and 489 transitions. Word has length 20
[2025-04-28 21:21:36,669 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:36,669 INFO  L485      AbstractCegarLoop]: Abstraction has 101 states and 489 transitions.
[2025-04-28 21:21:36,669 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:36,669 INFO  L278                IsEmpty]: Start isEmpty. Operand 101 states and 489 transitions.
[2025-04-28 21:21:36,677 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:36,677 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:36,677 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:36,677 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-04-28 21:21:36,677 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:36,678 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:36,678 INFO  L85        PathProgramCache]: Analyzing trace with hash -904108724, now seen corresponding path program 1 times
[2025-04-28 21:21:36,678 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:36,678 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851324576]
[2025-04-28 21:21:36,678 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,678 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:36,682 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:36,694 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:36,694 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,694 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:36,841 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:36,841 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851324576]
[2025-04-28 21:21:36,841 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851324576] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:36,841 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792649895]
[2025-04-28 21:21:36,842 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,842 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:36,844 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:36,846 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:36,850 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:21:36,902 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:36,926 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:36,926 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,926 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,928 INFO  L256         TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:36,929 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:36,954 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:36,954 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:36,954 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792649895] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:36,954 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:36,954 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6
[2025-04-28 21:21:36,954 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008241155]
[2025-04-28 21:21:36,954 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:36,955 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:36,955 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:36,955 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:36,955 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:36,955 INFO  L87              Difference]: Start difference. First operand 101 states and 489 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:37,151 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:37,151 INFO  L93              Difference]: Finished difference Result 103 states and 490 transitions.
[2025-04-28 21:21:37,152 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:37,152 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-04-28 21:21:37,152 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:37,155 INFO  L225             Difference]: With dead ends: 103
[2025-04-28 21:21:37,155 INFO  L226             Difference]: Without dead ends: 103
[2025-04-28 21:21:37,156 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:37,156 INFO  L437           NwaCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:37,156 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:37,157 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103 states.
[2025-04-28 21:21:37,193 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101.
[2025-04-28 21:21:37,193 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 101 states, 17 states have (on average 2.235294117647059) internal successors, (38), 36 states have internal predecessors, (38), 71 states have call successors, (71), 5 states have call predecessors, (71), 12 states have return successors, (379), 59 states have call predecessors, (379), 71 states have call successors, (379)
[2025-04-28 21:21:37,197 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 488 transitions.
[2025-04-28 21:21:37,197 INFO  L79                 Accepts]: Start accepts. Automaton has 101 states and 488 transitions. Word has length 20
[2025-04-28 21:21:37,197 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:37,197 INFO  L485      AbstractCegarLoop]: Abstraction has 101 states and 488 transitions.
[2025-04-28 21:21:37,197 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:37,197 INFO  L278                IsEmpty]: Start isEmpty. Operand 101 states and 488 transitions.
[2025-04-28 21:21:37,204 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:37,204 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:37,204 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:37,209 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:37,405 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:37,405 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:37,405 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:37,405 INFO  L85        PathProgramCache]: Analyzing trace with hash -1483160476, now seen corresponding path program 1 times
[2025-04-28 21:21:37,406 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:37,406 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695075789]
[2025-04-28 21:21:37,406 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:37,406 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:37,410 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:37,414 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:37,414 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:37,414 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:37,471 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:37,472 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695075789]
[2025-04-28 21:21:37,472 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695075789] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:37,472 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244869361]
[2025-04-28 21:21:37,472 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:37,472 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:37,474 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:37,476 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:37,479 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:21:37,527 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:37,549 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:37,550 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:37,550 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,551 INFO  L256         TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:37,552 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:37,577 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:37,578 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:37,578 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [244869361] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:37,578 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:37,578 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5
[2025-04-28 21:21:37,579 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619348386]
[2025-04-28 21:21:37,579 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:37,579 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:37,579 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:37,579 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:37,580 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:37,580 INFO  L87              Difference]: Start difference. First operand 101 states and 488 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:37,764 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:37,765 INFO  L93              Difference]: Finished difference Result 103 states and 489 transitions.
[2025-04-28 21:21:37,765 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:37,765 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-04-28 21:21:37,766 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:37,769 INFO  L225             Difference]: With dead ends: 103
[2025-04-28 21:21:37,769 INFO  L226             Difference]: Without dead ends: 103
[2025-04-28 21:21:37,769 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:37,771 INFO  L437           NwaCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:37,771 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 138 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:37,772 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 103 states.
[2025-04-28 21:21:37,809 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101.
[2025-04-28 21:21:37,811 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 101 states, 17 states have (on average 2.235294117647059) internal successors, (38), 36 states have internal predecessors, (38), 71 states have call successors, (71), 5 states have call predecessors, (71), 12 states have return successors, (378), 59 states have call predecessors, (378), 71 states have call successors, (378)
[2025-04-28 21:21:37,814 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 487 transitions.
[2025-04-28 21:21:37,814 INFO  L79                 Accepts]: Start accepts. Automaton has 101 states and 487 transitions. Word has length 20
[2025-04-28 21:21:37,814 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:37,814 INFO  L485      AbstractCegarLoop]: Abstraction has 101 states and 487 transitions.
[2025-04-28 21:21:37,815 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:37,815 INFO  L278                IsEmpty]: Start isEmpty. Operand 101 states and 487 transitions.
[2025-04-28 21:21:37,822 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2025-04-28 21:21:37,823 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:37,823 INFO  L218           NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:37,827 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:38,026 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2025-04-28 21:21:38,027 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:38,027 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:38,027 INFO  L85        PathProgramCache]: Analyzing trace with hash -1037387700, now seen corresponding path program 1 times
[2025-04-28 21:21:38,027 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:38,027 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172837497]
[2025-04-28 21:21:38,027 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:38,028 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:38,035 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:21:38,046 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:38,050 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:38,050 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,234 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:38,234 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:38,235 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172837497]
[2025-04-28 21:21:38,235 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172837497] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:38,235 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809564934]
[2025-04-28 21:21:38,235 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:38,235 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:38,237 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:38,239 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:38,246 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-04-28 21:21:38,293 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:21:38,331 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:38,331 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:38,331 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,333 INFO  L256         TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:38,334 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:38,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:38,422 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:38,888 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:38,889 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809564934] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:38,889 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:38,889 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13
[2025-04-28 21:21:38,889 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422152610]
[2025-04-28 21:21:38,889 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:38,890 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-28 21:21:38,890 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:38,890 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-28 21:21:38,890 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:38,891 INFO  L87              Difference]: Start difference. First operand 101 states and 487 transitions. Second operand  has 13 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 12 states have internal predecessors, (20), 10 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (12), 3 states have call predecessors, (12), 10 states have call successors, (12)
[2025-04-28 21:21:40,028 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,028 INFO  L93              Difference]: Finished difference Result 138 states and 642 transitions.
[2025-04-28 21:21:40,029 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:40,029 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 12 states have internal predecessors, (20), 10 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (12), 3 states have call predecessors, (12), 10 states have call successors, (12) Word has length 28
[2025-04-28 21:21:40,029 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,035 INFO  L225             Difference]: With dead ends: 138
[2025-04-28 21:21:40,035 INFO  L226             Difference]: Without dead ends: 138
[2025-04-28 21:21:40,036 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:40,036 INFO  L437           NwaCegarLoop]: 76 mSDtfsCounter, 18 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,036 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 237 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-04-28 21:21:40,037 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 138 states.
[2025-04-28 21:21:40,107 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 121.
[2025-04-28 21:21:40,108 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 121 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 42 states have internal predecessors, (45), 88 states have call successors, (88), 6 states have call predecessors, (88), 13 states have return successors, (470), 72 states have call predecessors, (470), 88 states have call successors, (470)
[2025-04-28 21:21:40,112 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 603 transitions.
[2025-04-28 21:21:40,112 INFO  L79                 Accepts]: Start accepts. Automaton has 121 states and 603 transitions. Word has length 28
[2025-04-28 21:21:40,112 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,112 INFO  L485      AbstractCegarLoop]: Abstraction has 121 states and 603 transitions.
[2025-04-28 21:21:40,112 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 12 states have internal predecessors, (20), 10 states have call successors, (12), 2 states have call predecessors, (12), 6 states have return successors, (12), 3 states have call predecessors, (12), 10 states have call successors, (12)
[2025-04-28 21:21:40,113 INFO  L278                IsEmpty]: Start isEmpty. Operand 121 states and 603 transitions.
[2025-04-28 21:21:40,122 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2025-04-28 21:21:40,122 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,122 INFO  L218           NwaCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:40,127 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:40,325 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2025-04-28 21:21:40,326 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:40,327 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:40,327 INFO  L85        PathProgramCache]: Analyzing trace with hash 128311604, now seen corresponding path program 1 times
[2025-04-28 21:21:40,327 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:40,327 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153883402]
[2025-04-28 21:21:40,327 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,327 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,336 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:21:40,343 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:40,343 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,343 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,384 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-04-28 21:21:40,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:40,384 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153883402]
[2025-04-28 21:21:40,385 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153883402] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:40,385 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045696442]
[2025-04-28 21:21:40,385 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,385 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:40,387 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:40,389 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:40,398 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-04-28 21:21:40,451 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:21:40,495 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:40,495 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,495 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,497 INFO  L256         TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:40,498 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:40,595 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:40,595 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:41,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:41,012 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045696442] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:41,012 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:41,012 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 12
[2025-04-28 21:21:41,012 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769645133]
[2025-04-28 21:21:41,012 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:41,013 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-04-28 21:21:41,013 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:41,013 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-04-28 21:21:41,013 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:21:41,014 INFO  L87              Difference]: Start difference. First operand 121 states and 603 transitions. Second operand  has 12 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 11 states have internal predecessors, (19), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14)
[2025-04-28 21:21:42,313 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:42,313 INFO  L93              Difference]: Finished difference Result 160 states and 758 transitions.
[2025-04-28 21:21:42,314 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:42,314 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 11 states have internal predecessors, (19), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14) Word has length 28
[2025-04-28 21:21:42,314 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:42,319 INFO  L225             Difference]: With dead ends: 160
[2025-04-28 21:21:42,319 INFO  L226             Difference]: Without dead ends: 156
[2025-04-28 21:21:42,320 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306
[2025-04-28 21:21:42,320 INFO  L437           NwaCegarLoop]: 76 mSDtfsCounter, 12 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:42,321 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 399 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-04-28 21:21:42,321 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 156 states.
[2025-04-28 21:21:42,407 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 139.
[2025-04-28 21:21:42,408 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 139 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 47 states have internal predecessors, (51), 103 states have call successors, (103), 7 states have call predecessors, (103), 14 states have return successors, (553), 84 states have call predecessors, (553), 103 states have call successors, (553)
[2025-04-28 21:21:42,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 707 transitions.
[2025-04-28 21:21:42,412 INFO  L79                 Accepts]: Start accepts. Automaton has 139 states and 707 transitions. Word has length 28
[2025-04-28 21:21:42,412 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:42,412 INFO  L485      AbstractCegarLoop]: Abstraction has 139 states and 707 transitions.
[2025-04-28 21:21:42,412 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 11 states have internal predecessors, (19), 10 states have call successors, (14), 2 states have call predecessors, (14), 6 states have return successors, (14), 5 states have call predecessors, (14), 10 states have call successors, (14)
[2025-04-28 21:21:42,412 INFO  L278                IsEmpty]: Start isEmpty. Operand 139 states and 707 transitions.
[2025-04-28 21:21:42,422 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:42,423 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:42,423 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:42,428 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:42,623 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-04-28 21:21:42,623 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:42,624 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:42,624 INFO  L85        PathProgramCache]: Analyzing trace with hash 1780076626, now seen corresponding path program 1 times
[2025-04-28 21:21:42,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:42,624 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834830924]
[2025-04-28 21:21:42,624 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:42,624 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:42,631 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:42,635 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:42,635 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:42,635 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:42,689 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:42,689 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:42,689 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834830924]
[2025-04-28 21:21:42,689 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834830924] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:42,689 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161832255]
[2025-04-28 21:21:42,689 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:42,689 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:42,692 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:42,694 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:42,697 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-04-28 21:21:42,756 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:42,787 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:42,787 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:42,788 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:42,789 INFO  L256         TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 14 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:42,791 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:42,811 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-04-28 21:21:42,812 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:42,812 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [161832255] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:42,812 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:42,812 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4
[2025-04-28 21:21:42,813 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588556169]
[2025-04-28 21:21:42,813 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:42,813 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:42,813 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:42,814 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:42,814 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:42,814 INFO  L87              Difference]: Start difference. First operand 139 states and 707 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:42,981 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:42,981 INFO  L93              Difference]: Finished difference Result 141 states and 708 transitions.
[2025-04-28 21:21:42,981 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:42,982 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6) Word has length 24
[2025-04-28 21:21:42,982 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:42,986 INFO  L225             Difference]: With dead ends: 141
[2025-04-28 21:21:42,986 INFO  L226             Difference]: Without dead ends: 141
[2025-04-28 21:21:42,987 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-04-28 21:21:42,987 INFO  L437           NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:42,987 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 140 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:42,988 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 141 states.
[2025-04-28 21:21:43,053 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139.
[2025-04-28 21:21:43,054 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 139 states, 21 states have (on average 2.4285714285714284) internal successors, (51), 47 states have internal predecessors, (51), 103 states have call successors, (103), 7 states have call predecessors, (103), 14 states have return successors, (552), 84 states have call predecessors, (552), 103 states have call successors, (552)
[2025-04-28 21:21:43,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 706 transitions.
[2025-04-28 21:21:43,058 INFO  L79                 Accepts]: Start accepts. Automaton has 139 states and 706 transitions. Word has length 24
[2025-04-28 21:21:43,058 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:43,058 INFO  L485      AbstractCegarLoop]: Abstraction has 139 states and 706 transitions.
[2025-04-28 21:21:43,059 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:43,059 INFO  L278                IsEmpty]: Start isEmpty. Operand 139 states and 706 transitions.
[2025-04-28 21:21:43,067 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2025-04-28 21:21:43,068 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:43,068 INFO  L218           NwaCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:43,073 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2025-04-28 21:21:43,271 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2025-04-28 21:21:43,272 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:43,272 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:43,272 INFO  L85        PathProgramCache]: Analyzing trace with hash 132349443, now seen corresponding path program 1 times
[2025-04-28 21:21:43,272 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:43,272 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275497140]
[2025-04-28 21:21:43,272 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:43,273 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:43,277 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:21:43,281 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:43,281 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:43,282 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:43,431 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-04-28 21:21:43,431 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:43,431 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275497140]
[2025-04-28 21:21:43,432 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275497140] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:43,432 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463611329]
[2025-04-28 21:21:43,432 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:43,432 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:43,434 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:43,436 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:43,440 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-04-28 21:21:43,493 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes.
[2025-04-28 21:21:43,530 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:43,530 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:43,530 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:43,531 INFO  L256         TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:43,532 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:43,589 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-04-28 21:21:43,589 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:43,825 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-04-28 21:21:43,825 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [463611329] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:43,825 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:43,825 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11
[2025-04-28 21:21:43,825 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895972071]
[2025-04-28 21:21:43,825 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:43,826 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-04-28 21:21:43,826 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:43,826 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-04-28 21:21:43,826 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:43,827 INFO  L87              Difference]: Start difference. First operand 139 states and 706 transitions. Second operand  has 11 states, 5 states have (on average 3.2) internal successors, (16), 11 states have internal predecessors, (16), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 4 states have call predecessors, (13), 10 states have call successors, (13)
[2025-04-28 21:21:45,498 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:45,498 INFO  L93              Difference]: Finished difference Result 248 states and 1732 transitions.
[2025-04-28 21:21:45,498 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-04-28 21:21:45,499 INFO  L79                 Accepts]: Start accepts. Automaton has  has 11 states, 5 states have (on average 3.2) internal successors, (16), 11 states have internal predecessors, (16), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 4 states have call predecessors, (13), 10 states have call successors, (13) Word has length 28
[2025-04-28 21:21:45,499 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:45,511 INFO  L225             Difference]: With dead ends: 248
[2025-04-28 21:21:45,511 INFO  L226             Difference]: Without dead ends: 248
[2025-04-28 21:21:45,511 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:45,512 INFO  L437           NwaCegarLoop]: 68 mSDtfsCounter, 12 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:45,512 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 285 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-04-28 21:21:45,513 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 248 states.
[2025-04-28 21:21:45,696 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 160.
[2025-04-28 21:21:45,697 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 160 states, 25 states have (on average 2.2) internal successors, (55), 51 states have internal predecessors, (55), 116 states have call successors, (116), 7 states have call predecessors, (116), 18 states have return successors, (1042), 101 states have call predecessors, (1042), 116 states have call successors, (1042)
[2025-04-28 21:21:45,707 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 1213 transitions.
[2025-04-28 21:21:45,707 INFO  L79                 Accepts]: Start accepts. Automaton has 160 states and 1213 transitions. Word has length 28
[2025-04-28 21:21:45,707 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:45,707 INFO  L485      AbstractCegarLoop]: Abstraction has 160 states and 1213 transitions.
[2025-04-28 21:21:45,708 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 5 states have (on average 3.2) internal successors, (16), 11 states have internal predecessors, (16), 10 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 4 states have call predecessors, (13), 10 states have call successors, (13)
[2025-04-28 21:21:45,708 INFO  L278                IsEmpty]: Start isEmpty. Operand 160 states and 1213 transitions.
[2025-04-28 21:21:45,721 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-04-28 21:21:45,721 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:45,721 INFO  L218           NwaCegarLoop]: trace histogram [6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:45,727 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:45,921 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2025-04-28 21:21:45,922 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:45,923 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:45,923 INFO  L85        PathProgramCache]: Analyzing trace with hash 14550478, now seen corresponding path program 1 times
[2025-04-28 21:21:45,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:45,924 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072814757]
[2025-04-28 21:21:45,924 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:45,924 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:45,929 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:45,932 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:45,932 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:45,933 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:45,977 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2025-04-28 21:21:45,977 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:45,977 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072814757]
[2025-04-28 21:21:45,977 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072814757] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:45,977 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68121511]
[2025-04-28 21:21:45,977 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:45,977 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:45,980 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:45,982 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:45,985 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-04-28 21:21:46,046 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:46,091 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:46,091 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:46,091 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:46,095 INFO  L256         TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:46,096 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:46,157 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:46,157 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:46,493 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-04-28 21:21:46,493 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [68121511] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:46,494 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:46,494 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 9
[2025-04-28 21:21:46,494 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275276224]
[2025-04-28 21:21:46,494 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:46,498 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:46,499 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:46,499 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:46,499 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:46,499 INFO  L87              Difference]: Start difference. First operand 160 states and 1213 transitions. Second operand  has 9 states, 5 states have (on average 3.6) internal successors, (18), 9 states have internal predecessors, (18), 8 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 4 states have call predecessors, (15), 8 states have call successors, (15)
[2025-04-28 21:21:47,125 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:47,126 INFO  L93              Difference]: Finished difference Result 171 states and 1233 transitions.
[2025-04-28 21:21:47,126 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:47,126 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 5 states have (on average 3.6) internal successors, (18), 9 states have internal predecessors, (18), 8 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 4 states have call predecessors, (15), 8 states have call successors, (15) Word has length 32
[2025-04-28 21:21:47,127 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:47,136 INFO  L225             Difference]: With dead ends: 171
[2025-04-28 21:21:47,136 INFO  L226             Difference]: Without dead ends: 171
[2025-04-28 21:21:47,136 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:21:47,137 INFO  L437           NwaCegarLoop]: 62 mSDtfsCounter, 5 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:47,137 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 236 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-04-28 21:21:47,138 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 171 states.
[2025-04-28 21:21:47,259 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 160.
[2025-04-28 21:21:47,260 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 160 states, 25 states have (on average 2.2) internal successors, (55), 51 states have internal predecessors, (55), 116 states have call successors, (116), 7 states have call predecessors, (116), 18 states have return successors, (1039), 101 states have call predecessors, (1039), 116 states have call successors, (1039)
[2025-04-28 21:21:47,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 1210 transitions.
[2025-04-28 21:21:47,268 INFO  L79                 Accepts]: Start accepts. Automaton has 160 states and 1210 transitions. Word has length 32
[2025-04-28 21:21:47,268 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:47,268 INFO  L485      AbstractCegarLoop]: Abstraction has 160 states and 1210 transitions.
[2025-04-28 21:21:47,268 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 5 states have (on average 3.6) internal successors, (18), 9 states have internal predecessors, (18), 8 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (15), 4 states have call predecessors, (15), 8 states have call successors, (15)
[2025-04-28 21:21:47,268 INFO  L278                IsEmpty]: Start isEmpty. Operand 160 states and 1210 transitions.
[2025-04-28 21:21:47,280 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-04-28 21:21:47,280 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:47,280 INFO  L218           NwaCegarLoop]: trace histogram [8, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:47,286 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:47,485 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:47,485 INFO  L403      AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:47,485 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:47,485 INFO  L85        PathProgramCache]: Analyzing trace with hash 1310664804, now seen corresponding path program 2 times
[2025-04-28 21:21:47,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:47,486 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877512998]
[2025-04-28 21:21:47,486 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:47,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:47,496 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes.
[2025-04-28 21:21:47,519 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:21:47,519 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:47,519 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:47,622 INFO  L134       CoverageAnalysis]: Checked inductivity of 86 backedges. 32 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2025-04-28 21:21:47,622 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:47,623 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877512998]
[2025-04-28 21:21:47,623 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877512998] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:47,623 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934236998]
[2025-04-28 21:21:47,623 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:47,623 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:47,625 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:47,627 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:47,631 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2025-04-28 21:21:47,721 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes.
[2025-04-28 21:21:47,787 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements.
[2025-04-28 21:21:47,788 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:47,788 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:47,790 INFO  L256         TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 20 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:47,793 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:48,009 INFO  L134       CoverageAnalysis]: Checked inductivity of 86 backedges. 18 proven. 32 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2025-04-28 21:21:48,009 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:49,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 86 backedges. 18 proven. 32 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2025-04-28 21:21:49,117 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [934236998] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:49,117 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:49,117 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 19
[2025-04-28 21:21:49,117 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082123479]
[2025-04-28 21:21:49,117 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:49,118 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2025-04-28 21:21:49,119 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:49,119 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2025-04-28 21:21:49,119 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:49,120 INFO  L87              Difference]: Start difference. First operand 160 states and 1210 transitions. Second operand  has 19 states, 8 states have (on average 3.375) internal successors, (27), 18 states have internal predecessors, (27), 17 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (22), 7 states have call predecessors, (22), 17 states have call successors, (22)
