./chc-comp-wrapper.sh ../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-160.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:29,429 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:29,512 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693f540c-7bb6-4fa3-a271-22583b6209cd/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:29,517 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:29,517 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:29,554 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:29,555 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:29,555 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:29,556 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:29,556 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:29,556 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:29,556 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:29,557 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:29,557 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:29,557 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:29,557 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:29,557 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:29,557 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:29,557 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:29,558 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:29,558 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:29,558 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:29,558 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:29,558 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:29,558 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:29,559 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:29,559 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:29,863 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:29,875 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:29,878 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:29,881 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:29,881 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:29,883 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693f540c-7bb6-4fa3-a271-22583b6209cd/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-160.smt2
[2025-04-28 21:21:29,884 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:29,889 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:30,123 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_693f540c-7bb6-4fa3-a271-22583b6209cd/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-160.smt2
[2025-04-28 21:21:30,127 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:30,129 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:30,130 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:30,131 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:30,131 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:30,138 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,168 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30 Unit
[2025-04-28 21:21:30,168 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:30,169 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:30,169 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:30,169 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:30,185 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,185 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,218 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,218 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,222 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,227 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,230 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,231 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,231 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,245 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:30,246 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:30,246 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:30,246 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:30,247 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (1/1) ...
[2025-04-28 21:21:30,252 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:30,267 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:30,282 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:30,286 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:30,298 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:30,299 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:30,299 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:30,299 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_MAIN_4 given in one single declaration
[2025-04-28 21:21:30,299 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_MAIN_4
[2025-04-28 21:21:30,299 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_MAIN_4
[2025-04-28 21:21:30,299 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_MAIN_3 given in one single declaration
[2025-04-28 21:21:30,299 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_MAIN_3
[2025-04-28 21:21:30,299 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_MAIN_3
[2025-04-28 21:21:30,299 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_MAIN_2 given in one single declaration
[2025-04-28 21:21:30,299 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_MAIN_2
[2025-04-28 21:21:30,299 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_MAIN_2
[2025-04-28 21:21:30,300 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_MAIN_1 given in one single declaration
[2025-04-28 21:21:30,300 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_MAIN_1
[2025-04-28 21:21:30,300 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_MAIN_1
[2025-04-28 21:21:30,300 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:30,300 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:30,300 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:30,353 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:30,356 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:30,562 INFO  L?                        ?]: Removed 0 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:30,563 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:30,583 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:30,584 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-04-28 21:21:30,584 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:30 BoogieIcfgContainer
[2025-04-28 21:21:30,586 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:30,588 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:30,590 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:30,593 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:30,594 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:30" (1/3) ...
[2025-04-28 21:21:30,594 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117420e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:30, skipping insertion in model container
[2025-04-28 21:21:30,595 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:30" (2/3) ...
[2025-04-28 21:21:30,595 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@117420e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:30, skipping insertion in model container
[2025-04-28 21:21:30,595 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:30" (3/3) ...
[2025-04-28 21:21:30,597 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:30,615 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:30,620 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 6 procedures, 36 locations, 76 edges, 6 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:30,670 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:30,689 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;@636b373f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:30,689 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:30,693 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 36 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 25 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 6 states have call predecessors, (17), 17 states have call successors, (17)
[2025-04-28 21:21:30,705 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2025-04-28 21:21:30,706 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:30,706 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:30,706 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:30,711 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:30,712 INFO  L85        PathProgramCache]: Analyzing trace with hash 985810174, now seen corresponding path program 1 times
[2025-04-28 21:21:30,720 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:30,721 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502593101]
[2025-04-28 21:21:30,721 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:30,722 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:30,754 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-04-28 21:21:30,777 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:30,777 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:30,777 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,041 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:31,042 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:31,042 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502593101]
[2025-04-28 21:21:31,043 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502593101] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:31,043 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:31,046 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:31,049 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257929830]
[2025-04-28 21:21:31,050 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:31,056 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:31,058 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:31,086 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:31,088 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:31,090 INFO  L87              Difference]: Start difference. First operand  has 36 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 25 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 5 states have return successors, (17), 6 states have call predecessors, (17), 17 states have call successors, (17) Second operand  has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:31,338 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:31,338 INFO  L93              Difference]: Finished difference Result 42 states and 76 transitions.
[2025-04-28 21:21:31,341 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:31,342 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 21
[2025-04-28 21:21:31,343 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:31,351 INFO  L225             Difference]: With dead ends: 42
[2025-04-28 21:21:31,351 INFO  L226             Difference]: Without dead ends: 42
[2025-04-28 21:21:31,353 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:31,357 INFO  L437           NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:31,358 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 223 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:31,374 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2025-04-28 21:21:31,437 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42.
[2025-04-28 21:21:31,438 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42 states, 15 states have (on average 1.8) internal successors, (27), 27 states have internal predecessors, (27), 17 states have call successors, (17), 5 states have call predecessors, (17), 9 states have return successors, (32), 9 states have call predecessors, (32), 17 states have call successors, (32)
[2025-04-28 21:21:31,447 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 76 transitions.
[2025-04-28 21:21:31,449 INFO  L79                 Accepts]: Start accepts. Automaton has 42 states and 76 transitions. Word has length 21
[2025-04-28 21:21:31,450 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:31,450 INFO  L485      AbstractCegarLoop]: Abstraction has 42 states and 76 transitions.
[2025-04-28 21:21:31,450 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:31,450 INFO  L278                IsEmpty]: Start isEmpty. Operand 42 states and 76 transitions.
[2025-04-28 21:21:31,453 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:31,453 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:31,453 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:31,455 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:31,456 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:31,458 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:31,458 INFO  L85        PathProgramCache]: Analyzing trace with hash -2121009600, now seen corresponding path program 1 times
[2025-04-28 21:21:31,458 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:31,458 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852629053]
[2025-04-28 21:21:31,458 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:31,459 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:31,473 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:31,512 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:31,512 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:31,513 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:31,788 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:31,789 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:31,789 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852629053]
[2025-04-28 21:21:31,789 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852629053] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:31,789 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:31,789 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:31,789 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373605829]
[2025-04-28 21:21:31,789 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:31,791 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:31,792 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:31,792 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:31,792 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:31,793 INFO  L87              Difference]: Start difference. First operand 42 states and 76 transitions. Second operand  has 8 states, 5 states have (on average 2.6) internal successors, (13), 8 states have internal predecessors, (13), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:32,299 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:32,299 INFO  L93              Difference]: Finished difference Result 66 states and 135 transitions.
[2025-04-28 21:21:32,300 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:21:32,300 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 5 states have (on average 2.6) internal successors, (13), 8 states have internal predecessors, (13), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25
[2025-04-28 21:21:32,300 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:32,304 INFO  L225             Difference]: With dead ends: 66
[2025-04-28 21:21:32,305 INFO  L226             Difference]: Without dead ends: 66
[2025-04-28 21:21:32,306 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:21:32,307 INFO  L437           NwaCegarLoop]: 49 mSDtfsCounter, 9 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:32,309 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 278 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-04-28 21:21:32,310 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 66 states.
[2025-04-28 21:21:32,328 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54.
[2025-04-28 21:21:32,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 54 states, 20 states have (on average 1.75) internal successors, (35), 34 states have internal predecessors, (35), 20 states have call successors, (20), 6 states have call predecessors, (20), 13 states have return successors, (49), 13 states have call predecessors, (49), 20 states have call successors, (49)
[2025-04-28 21:21:32,330 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 104 transitions.
[2025-04-28 21:21:32,330 INFO  L79                 Accepts]: Start accepts. Automaton has 54 states and 104 transitions. Word has length 25
[2025-04-28 21:21:32,331 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:32,331 INFO  L485      AbstractCegarLoop]: Abstraction has 54 states and 104 transitions.
[2025-04-28 21:21:32,331 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 5 states have (on average 2.6) internal successors, (13), 8 states have internal predecessors, (13), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:32,331 INFO  L278                IsEmpty]: Start isEmpty. Operand 54 states and 104 transitions.
[2025-04-28 21:21:32,333 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:32,333 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:32,333 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:32,334 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:32,334 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:32,334 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:32,335 INFO  L85        PathProgramCache]: Analyzing trace with hash -155838240, now seen corresponding path program 1 times
[2025-04-28 21:21:32,335 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:32,335 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942690145]
[2025-04-28 21:21:32,335 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:32,335 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:32,342 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:32,363 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:32,363 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:32,364 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,492 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:32,492 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:32,492 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942690145]
[2025-04-28 21:21:32,492 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942690145] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:32,492 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121776876]
[2025-04-28 21:21:32,493 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:32,493 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:32,497 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:32,500 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:32,502 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:32,546 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:32,570 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:32,570 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:32,570 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:32,572 INFO  L256         TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:32,578 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:32,661 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:32,662 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:33,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:33,397 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121776876] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:33,397 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:33,398 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9
[2025-04-28 21:21:33,398 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287481501]
[2025-04-28 21:21:33,398 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:33,398 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:33,398 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:33,399 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:33,399 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:33,399 INFO  L87              Difference]: Start difference. First operand 54 states and 104 transitions. Second operand  has 9 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 9 states have internal predecessors, (14), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7)
[2025-04-28 21:21:33,633 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:33,634 INFO  L93              Difference]: Finished difference Result 78 states and 169 transitions.
[2025-04-28 21:21:33,634 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:33,634 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 9 states have internal predecessors, (14), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 25
[2025-04-28 21:21:33,635 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:33,637 INFO  L225             Difference]: With dead ends: 78
[2025-04-28 21:21:33,637 INFO  L226             Difference]: Without dead ends: 78
[2025-04-28 21:21:33,637 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:33,638 INFO  L437           NwaCegarLoop]: 56 mSDtfsCounter, 3 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:33,638 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 389 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:33,639 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 78 states.
[2025-04-28 21:21:33,655 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70.
[2025-04-28 21:21:33,656 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 70 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 42 states have internal predecessors, (43), 20 states have call successors, (20), 6 states have call predecessors, (20), 21 states have return successors, (82), 21 states have call predecessors, (82), 20 states have call successors, (82)
[2025-04-28 21:21:33,658 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 145 transitions.
[2025-04-28 21:21:33,658 INFO  L79                 Accepts]: Start accepts. Automaton has 70 states and 145 transitions. Word has length 25
[2025-04-28 21:21:33,658 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:33,659 INFO  L485      AbstractCegarLoop]: Abstraction has 70 states and 145 transitions.
[2025-04-28 21:21:33,659 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 9 states have internal predecessors, (14), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7)
[2025-04-28 21:21:33,659 INFO  L278                IsEmpty]: Start isEmpty. Operand 70 states and 145 transitions.
[2025-04-28 21:21:33,662 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:33,662 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:33,662 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:33,671 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:33,862 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:33,863 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:33,863 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:33,864 INFO  L85        PathProgramCache]: Analyzing trace with hash 521786435, now seen corresponding path program 1 times
[2025-04-28 21:21:33,864 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:33,864 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964024755]
[2025-04-28 21:21:33,864 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:33,864 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,871 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:33,881 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:33,881 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:33,881 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,051 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:34,051 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:34,051 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964024755]
[2025-04-28 21:21:34,051 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964024755] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:34,051 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251474266]
[2025-04-28 21:21:34,051 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:34,051 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:34,054 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:34,056 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:34,060 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:34,113 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:34,145 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:34,145 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:34,145 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,150 INFO  L256         TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:34,156 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:34,213 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:34,213 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:34,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:34,799 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [251474266] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:34,799 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:34,799 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9
[2025-04-28 21:21:34,799 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854338131]
[2025-04-28 21:21:34,799 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:34,800 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:34,800 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:34,802 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:34,803 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:34,804 INFO  L87              Difference]: Start difference. First operand 70 states and 145 transitions. Second operand  has 9 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 9 states have internal predecessors, (14), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7)
[2025-04-28 21:21:35,026 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:35,026 INFO  L93              Difference]: Finished difference Result 118 states and 275 transitions.
[2025-04-28 21:21:35,028 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:35,029 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 9 states have internal predecessors, (14), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 25
[2025-04-28 21:21:35,029 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:35,036 INFO  L225             Difference]: With dead ends: 118
[2025-04-28 21:21:35,036 INFO  L226             Difference]: Without dead ends: 118
[2025-04-28 21:21:35,037 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:35,037 INFO  L437           NwaCegarLoop]: 56 mSDtfsCounter, 3 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:35,038 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 391 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:35,038 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 118 states.
[2025-04-28 21:21:35,069 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102.
[2025-04-28 21:21:35,070 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 102 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 6 states have call predecessors, (20), 37 states have return successors, (148), 37 states have call predecessors, (148), 20 states have call successors, (148)
[2025-04-28 21:21:35,072 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 227 transitions.
[2025-04-28 21:21:35,072 INFO  L79                 Accepts]: Start accepts. Automaton has 102 states and 227 transitions. Word has length 25
[2025-04-28 21:21:35,072 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:35,072 INFO  L485      AbstractCegarLoop]: Abstraction has 102 states and 227 transitions.
[2025-04-28 21:21:35,072 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 9 states have internal predecessors, (14), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7)
[2025-04-28 21:21:35,073 INFO  L278                IsEmpty]: Start isEmpty. Operand 102 states and 227 transitions.
[2025-04-28 21:21:35,075 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:35,075 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:35,075 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:35,081 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:21:35,279 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:35,280 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:35,280 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:35,280 INFO  L85        PathProgramCache]: Analyzing trace with hash 1851197640, now seen corresponding path program 1 times
[2025-04-28 21:21:35,280 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:35,280 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876494572]
[2025-04-28 21:21:35,281 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:35,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:35,287 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:35,294 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:35,294 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:35,294 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:35,392 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:35,393 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:35,393 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876494572]
[2025-04-28 21:21:35,393 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876494572] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:35,393 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423078035]
[2025-04-28 21:21:35,393 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:35,393 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:35,396 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:35,398 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:35,402 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:35,450 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:35,470 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:35,470 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:35,470 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:35,471 INFO  L256         TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:35,472 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:35,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:35,513 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:35,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:35,897 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [423078035] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:35,897 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:35,897 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8
[2025-04-28 21:21:35,898 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497328441]
[2025-04-28 21:21:35,898 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:35,898 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:35,898 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:35,899 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:35,899 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:35,899 INFO  L87              Difference]: Start difference. First operand 102 states and 227 transitions. Second operand  has 8 states, 5 states have (on average 2.8) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7)
[2025-04-28 21:21:36,053 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:36,053 INFO  L93              Difference]: Finished difference Result 174 states and 363 transitions.
[2025-04-28 21:21:36,053 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:36,053 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 5 states have (on average 2.8) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 25
[2025-04-28 21:21:36,054 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:36,057 INFO  L225             Difference]: With dead ends: 174
[2025-04-28 21:21:36,058 INFO  L226             Difference]: Without dead ends: 174
[2025-04-28 21:21:36,058 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:36,059 INFO  L437           NwaCegarLoop]: 55 mSDtfsCounter, 3 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:36,059 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 338 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:36,060 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 174 states.
[2025-04-28 21:21:36,114 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 110.
[2025-04-28 21:21:36,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 110 states, 48 states have (on average 1.3125) internal successors, (63), 62 states have internal predecessors, (63), 20 states have call successors, (20), 6 states have call predecessors, (20), 41 states have return successors, (166), 41 states have call predecessors, (166), 20 states have call successors, (166)
[2025-04-28 21:21:36,119 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions.
[2025-04-28 21:21:36,119 INFO  L79                 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 25
[2025-04-28 21:21:36,119 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:36,119 INFO  L485      AbstractCegarLoop]: Abstraction has 110 states and 249 transitions.
[2025-04-28 21:21:36,119 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 5 states have (on average 2.8) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7)
[2025-04-28 21:21:36,120 INFO  L278                IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions.
[2025-04-28 21:21:36,122 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:36,122 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:36,122 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:36,128 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-04-28 21:21:36,322 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:36,323 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:36,323 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:36,323 INFO  L85        PathProgramCache]: Analyzing trace with hash 1570357901, now seen corresponding path program 1 times
[2025-04-28 21:21:36,323 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:36,324 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828315606]
[2025-04-28 21:21:36,324 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,324 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:36,328 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:36,338 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:36,339 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,339 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:36,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:36,440 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828315606]
[2025-04-28 21:21:36,440 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828315606] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:36,440 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826058785]
[2025-04-28 21:21:36,440 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,441 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:36,444 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:36,446 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:36,449 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:36,494 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:36,513 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:36,513 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,513 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,514 INFO  L256         TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:36,516 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:36,556 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:36,557 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:37,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:37,080 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [826058785] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:37,080 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:37,080 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9
[2025-04-28 21:21:37,080 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122054786]
[2025-04-28 21:21:37,080 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:37,080 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:37,080 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:37,081 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:37,081 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:37,081 INFO  L87              Difference]: Start difference. First operand 110 states and 249 transitions. Second operand  has 9 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 9 states have internal predecessors, (14), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7)
[2025-04-28 21:21:37,297 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:37,297 INFO  L93              Difference]: Finished difference Result 146 states and 342 transitions.
[2025-04-28 21:21:37,298 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:37,298 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 9 states have internal predecessors, (14), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 25
[2025-04-28 21:21:37,298 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:37,301 INFO  L225             Difference]: With dead ends: 146
[2025-04-28 21:21:37,301 INFO  L226             Difference]: Without dead ends: 146
[2025-04-28 21:21:37,301 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:37,302 INFO  L437           NwaCegarLoop]: 56 mSDtfsCounter, 3 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:37,302 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 391 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:37,303 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 146 states.
[2025-04-28 21:21:37,327 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 102.
[2025-04-28 21:21:37,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 102 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 58 states have internal predecessors, (59), 20 states have call successors, (20), 6 states have call predecessors, (20), 37 states have return successors, (146), 37 states have call predecessors, (146), 20 states have call successors, (146)
[2025-04-28 21:21:37,329 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 225 transitions.
[2025-04-28 21:21:37,329 INFO  L79                 Accepts]: Start accepts. Automaton has 102 states and 225 transitions. Word has length 25
[2025-04-28 21:21:37,329 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:37,329 INFO  L485      AbstractCegarLoop]: Abstraction has 102 states and 225 transitions.
[2025-04-28 21:21:37,329 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 9 states have internal predecessors, (14), 5 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7)
[2025-04-28 21:21:37,330 INFO  L278                IsEmpty]: Start isEmpty. Operand 102 states and 225 transitions.
[2025-04-28 21:21:37,331 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:37,332 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:37,332 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:37,337 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:37,532 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:37,532 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:37,533 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:37,533 INFO  L85        PathProgramCache]: Analyzing trace with hash 2098641837, now seen corresponding path program 1 times
[2025-04-28 21:21:37,533 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:37,533 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535719825]
[2025-04-28 21:21:37,533 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:37,533 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:37,538 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:37,543 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:37,544 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:37,544 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,654 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:37,654 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:37,654 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535719825]
[2025-04-28 21:21:37,654 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535719825] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:37,654 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863477547]
[2025-04-28 21:21:37,654 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:37,655 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:37,657 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:37,659 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:37,663 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:21:37,710 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:37,727 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:37,727 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:37,727 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,728 INFO  L256         TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:37,729 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:37,751 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:37,751 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:38,087 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:38,087 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [863477547] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:38,087 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:38,087 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8
[2025-04-28 21:21:38,088 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492146593]
[2025-04-28 21:21:38,088 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:38,088 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:38,088 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:38,089 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:38,089 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:38,089 INFO  L87              Difference]: Start difference. First operand 102 states and 225 transitions. Second operand  has 8 states, 5 states have (on average 2.8) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7)
[2025-04-28 21:21:38,211 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:38,211 INFO  L93              Difference]: Finished difference Result 158 states and 341 transitions.
[2025-04-28 21:21:38,211 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:38,211 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 5 states have (on average 2.8) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) Word has length 25
[2025-04-28 21:21:38,212 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:38,214 INFO  L225             Difference]: With dead ends: 158
[2025-04-28 21:21:38,214 INFO  L226             Difference]: Without dead ends: 158
[2025-04-28 21:21:38,214 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:38,215 INFO  L437           NwaCegarLoop]: 55 mSDtfsCounter, 4 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:38,215 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 244 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:38,216 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 158 states.
[2025-04-28 21:21:38,236 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 90.
[2025-04-28 21:21:38,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 90 states, 38 states have (on average 1.394736842105263) internal successors, (53), 52 states have internal predecessors, (53), 20 states have call successors, (20), 6 states have call predecessors, (20), 31 states have return successors, (126), 31 states have call predecessors, (126), 20 states have call successors, (126)
[2025-04-28 21:21:38,238 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 199 transitions.
[2025-04-28 21:21:38,238 INFO  L79                 Accepts]: Start accepts. Automaton has 90 states and 199 transitions. Word has length 25
[2025-04-28 21:21:38,238 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:38,238 INFO  L485      AbstractCegarLoop]: Abstraction has 90 states and 199 transitions.
[2025-04-28 21:21:38,239 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 5 states have (on average 2.8) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7)
[2025-04-28 21:21:38,239 INFO  L278                IsEmpty]: Start isEmpty. Operand 90 states and 199 transitions.
[2025-04-28 21:21:38,240 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:38,240 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:38,241 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:38,246 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-04-28 21:21:38,444 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:38,445 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:38,445 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:38,445 INFO  L85        PathProgramCache]: Analyzing trace with hash -1456912669, now seen corresponding path program 1 times
[2025-04-28 21:21:38,445 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:38,445 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881661973]
[2025-04-28 21:21:38,445 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:38,445 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:38,449 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:38,453 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:38,453 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:38,454 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,516 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:38,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:38,516 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881661973]
[2025-04-28 21:21:38,516 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881661973] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:38,516 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:38,517 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:38,517 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883118515]
[2025-04-28 21:21:38,517 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:38,517 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:38,517 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:38,518 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:38,518 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:38,518 INFO  L87              Difference]: Start difference. First operand 90 states and 199 transitions. Second operand  has 6 states, 4 states have (on average 3.25) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:38,681 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:38,681 INFO  L93              Difference]: Finished difference Result 124 states and 285 transitions.
[2025-04-28 21:21:38,682 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:38,682 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 3.25) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25
[2025-04-28 21:21:38,682 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:38,684 INFO  L225             Difference]: With dead ends: 124
[2025-04-28 21:21:38,684 INFO  L226             Difference]: Without dead ends: 124
[2025-04-28 21:21:38,684 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:38,685 INFO  L437           NwaCegarLoop]: 54 mSDtfsCounter, 7 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:38,685 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 225 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:38,686 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 124 states.
[2025-04-28 21:21:38,699 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106.
[2025-04-28 21:21:38,699 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 106 states, 45 states have (on average 1.4) internal successors, (63), 61 states have internal predecessors, (63), 23 states have call successors, (23), 7 states have call predecessors, (23), 37 states have return successors, (165), 37 states have call predecessors, (165), 23 states have call successors, (165)
[2025-04-28 21:21:38,701 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 251 transitions.
[2025-04-28 21:21:38,701 INFO  L79                 Accepts]: Start accepts. Automaton has 106 states and 251 transitions. Word has length 25
[2025-04-28 21:21:38,701 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:38,701 INFO  L485      AbstractCegarLoop]: Abstraction has 106 states and 251 transitions.
[2025-04-28 21:21:38,701 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 3.25) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:38,702 INFO  L278                IsEmpty]: Start isEmpty. Operand 106 states and 251 transitions.
[2025-04-28 21:21:38,703 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:38,703 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:38,704 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:38,704 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-04-28 21:21:38,704 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:38,704 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:38,704 INFO  L85        PathProgramCache]: Analyzing trace with hash 783860781, now seen corresponding path program 1 times
[2025-04-28 21:21:38,705 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:38,705 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656534186]
[2025-04-28 21:21:38,705 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:38,705 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:38,708 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:38,713 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:38,713 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:38,713 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,786 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:38,786 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:38,786 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656534186]
[2025-04-28 21:21:38,786 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656534186] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:38,787 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:38,787 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:38,787 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133241297]
[2025-04-28 21:21:38,787 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:38,787 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:38,787 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:38,788 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:38,788 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:38,788 INFO  L87              Difference]: Start difference. First operand 106 states and 251 transitions. Second operand  has 6 states, 4 states have (on average 3.25) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:38,915 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:38,915 INFO  L93              Difference]: Finished difference Result 118 states and 262 transitions.
[2025-04-28 21:21:38,916 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:38,916 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 3.25) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25
[2025-04-28 21:21:38,916 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:38,917 INFO  L225             Difference]: With dead ends: 118
[2025-04-28 21:21:38,918 INFO  L226             Difference]: Without dead ends: 114
[2025-04-28 21:21:38,918 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:38,919 INFO  L437           NwaCegarLoop]: 57 mSDtfsCounter, 7 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:38,920 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 237 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:38,921 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 114 states.
[2025-04-28 21:21:38,939 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102.
[2025-04-28 21:21:38,939 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 102 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 59 states have internal predecessors, (61), 23 states have call successors, (23), 7 states have call predecessors, (23), 35 states have return successors, (142), 35 states have call predecessors, (142), 23 states have call successors, (142)
[2025-04-28 21:21:38,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 226 transitions.
[2025-04-28 21:21:38,943 INFO  L79                 Accepts]: Start accepts. Automaton has 102 states and 226 transitions. Word has length 25
[2025-04-28 21:21:38,944 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:38,944 INFO  L485      AbstractCegarLoop]: Abstraction has 102 states and 226 transitions.
[2025-04-28 21:21:38,945 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 3.25) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:38,945 INFO  L278                IsEmpty]: Start isEmpty. Operand 102 states and 226 transitions.
[2025-04-28 21:21:38,946 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:38,947 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:38,947 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:38,947 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-04-28 21:21:38,947 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:38,947 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:38,947 INFO  L85        PathProgramCache]: Analyzing trace with hash -336525944, now seen corresponding path program 1 times
[2025-04-28 21:21:38,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:38,947 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044558695]
[2025-04-28 21:21:38,947 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:38,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:38,952 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:38,958 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:38,959 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:38,959 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,026 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:39,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:39,026 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044558695]
[2025-04-28 21:21:39,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044558695] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:39,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:39,026 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:39,026 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091433873]
[2025-04-28 21:21:39,027 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,027 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:39,027 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,028 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:39,028 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:39,031 INFO  L87              Difference]: Start difference. First operand 102 states and 226 transitions. Second operand  has 7 states, 5 states have (on average 2.6) internal successors, (13), 7 states have internal predecessors, (13), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:39,267 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:39,268 INFO  L93              Difference]: Finished difference Result 155 states and 396 transitions.
[2025-04-28 21:21:39,269 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:39,269 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 2.6) internal successors, (13), 7 states have internal predecessors, (13), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 25
[2025-04-28 21:21:39,269 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:39,272 INFO  L225             Difference]: With dead ends: 155
[2025-04-28 21:21:39,272 INFO  L226             Difference]: Without dead ends: 149
[2025-04-28 21:21:39,272 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:39,273 INFO  L437           NwaCegarLoop]: 57 mSDtfsCounter, 11 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:39,274 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 270 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:39,275 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 149 states.
[2025-04-28 21:21:39,295 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 129.
[2025-04-28 21:21:39,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 129 states, 54 states have (on average 1.462962962962963) internal successors, (79), 75 states have internal predecessors, (79), 31 states have call successors, (31), 10 states have call predecessors, (31), 43 states have return successors, (208), 43 states have call predecessors, (208), 31 states have call successors, (208)
[2025-04-28 21:21:39,297 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 318 transitions.
[2025-04-28 21:21:39,298 INFO  L79                 Accepts]: Start accepts. Automaton has 129 states and 318 transitions. Word has length 25
[2025-04-28 21:21:39,298 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:39,298 INFO  L485      AbstractCegarLoop]: Abstraction has 129 states and 318 transitions.
[2025-04-28 21:21:39,298 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 2.6) internal successors, (13), 7 states have internal predecessors, (13), 4 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:39,298 INFO  L278                IsEmpty]: Start isEmpty. Operand 129 states and 318 transitions.
[2025-04-28 21:21:39,300 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:39,301 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,301 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:39,301 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-04-28 21:21:39,301 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,301 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,301 INFO  L85        PathProgramCache]: Analyzing trace with hash 731760162, now seen corresponding path program 1 times
[2025-04-28 21:21:39,302 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,302 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118163231]
[2025-04-28 21:21:39,302 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,302 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,305 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:39,308 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:39,309 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,309 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:39,397 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:39,397 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118163231]
[2025-04-28 21:21:39,397 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118163231] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:39,397 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:39,398 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:39,398 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855670657]
[2025-04-28 21:21:39,398 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,398 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:39,398 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,398 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:39,399 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:39,399 INFO  L87              Difference]: Start difference. First operand 129 states and 318 transitions. Second operand  has 8 states, 6 states have (on average 2.0) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:39,564 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:39,564 INFO  L93              Difference]: Finished difference Result 145 states and 362 transitions.
[2025-04-28 21:21:39,565 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:39,565 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 2.0) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 25
[2025-04-28 21:21:39,565 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:39,567 INFO  L225             Difference]: With dead ends: 145
[2025-04-28 21:21:39,567 INFO  L226             Difference]: Without dead ends: 143
[2025-04-28 21:21:39,567 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:39,568 INFO  L437           NwaCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:39,568 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 278 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:39,569 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 143 states.
[2025-04-28 21:21:39,583 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 135.
[2025-04-28 21:21:39,583 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 135 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 78 states have internal predecessors, (82), 31 states have call successors, (31), 10 states have call predecessors, (31), 46 states have return successors, (227), 46 states have call predecessors, (227), 31 states have call successors, (227)
[2025-04-28 21:21:39,586 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 340 transitions.
[2025-04-28 21:21:39,586 INFO  L79                 Accepts]: Start accepts. Automaton has 135 states and 340 transitions. Word has length 25
[2025-04-28 21:21:39,586 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:39,586 INFO  L485      AbstractCegarLoop]: Abstraction has 135 states and 340 transitions.
[2025-04-28 21:21:39,586 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 2.0) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:39,586 INFO  L278                IsEmpty]: Start isEmpty. Operand 135 states and 340 transitions.
[2025-04-28 21:21:39,589 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:39,589 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,589 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:39,589 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-04-28 21:21:39,589 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,590 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,590 INFO  L85        PathProgramCache]: Analyzing trace with hash -709436180, now seen corresponding path program 1 times
[2025-04-28 21:21:39,590 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,590 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605486578]
[2025-04-28 21:21:39,590 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,590 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,594 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:39,597 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:39,597 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,597 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,698 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:39,698 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:39,698 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605486578]
[2025-04-28 21:21:39,698 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605486578] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:39,699 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:39,699 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:39,699 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127505518]
[2025-04-28 21:21:39,699 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,699 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:39,699 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,700 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:39,700 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:39,700 INFO  L87              Difference]: Start difference. First operand 135 states and 340 transitions. Second operand  has 8 states, 6 states have (on average 2.0) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:39,867 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:39,867 INFO  L93              Difference]: Finished difference Result 149 states and 379 transitions.
[2025-04-28 21:21:39,867 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:39,868 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 2.0) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 25
[2025-04-28 21:21:39,868 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:39,870 INFO  L225             Difference]: With dead ends: 149
[2025-04-28 21:21:39,870 INFO  L226             Difference]: Without dead ends: 147
[2025-04-28 21:21:39,871 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:39,871 INFO  L437           NwaCegarLoop]: 53 mSDtfsCounter, 3 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:39,871 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 327 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:39,872 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 147 states.
[2025-04-28 21:21:39,886 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137.
[2025-04-28 21:21:39,887 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 137 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 79 states have internal predecessors, (83), 31 states have call successors, (31), 10 states have call predecessors, (31), 47 states have return successors, (231), 47 states have call predecessors, (231), 31 states have call successors, (231)
[2025-04-28 21:21:39,889 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 345 transitions.
[2025-04-28 21:21:39,889 INFO  L79                 Accepts]: Start accepts. Automaton has 137 states and 345 transitions. Word has length 25
[2025-04-28 21:21:39,889 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:39,889 INFO  L485      AbstractCegarLoop]: Abstraction has 137 states and 345 transitions.
[2025-04-28 21:21:39,889 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 2.0) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:39,890 INFO  L278                IsEmpty]: Start isEmpty. Operand 137 states and 345 transitions.
[2025-04-28 21:21:39,892 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:39,892 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,892 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:39,892 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-04-28 21:21:39,892 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,893 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,893 INFO  L85        PathProgramCache]: Analyzing trace with hash 11161991, now seen corresponding path program 1 times
[2025-04-28 21:21:39,893 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,893 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562339977]
[2025-04-28 21:21:39,893 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,893 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,897 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-04-28 21:21:39,899 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:39,899 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,899 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,977 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:39,977 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:39,978 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562339977]
[2025-04-28 21:21:39,978 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562339977] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:39,978 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:39,978 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:39,978 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981110261]
[2025-04-28 21:21:39,978 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,978 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:39,978 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,979 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:39,979 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:39,979 INFO  L87              Difference]: Start difference. First operand 137 states and 345 transitions. Second operand  has 8 states, 6 states have (on average 2.0) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:40,130 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,130 INFO  L93              Difference]: Finished difference Result 147 states and 366 transitions.
[2025-04-28 21:21:40,131 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:40,131 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 2.0) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 25
[2025-04-28 21:21:40,131 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,135 INFO  L225             Difference]: With dead ends: 147
[2025-04-28 21:21:40,135 INFO  L226             Difference]: Without dead ends: 145
[2025-04-28 21:21:40,136 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:40,137 INFO  L437           NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,137 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 281 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:40,138 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 145 states.
[2025-04-28 21:21:40,156 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 133.
[2025-04-28 21:21:40,156 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 133 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 77 states have internal predecessors, (81), 31 states have call successors, (31), 10 states have call predecessors, (31), 45 states have return successors, (217), 45 states have call predecessors, (217), 31 states have call successors, (217)
[2025-04-28 21:21:40,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 329 transitions.
[2025-04-28 21:21:40,158 INFO  L79                 Accepts]: Start accepts. Automaton has 133 states and 329 transitions. Word has length 25
[2025-04-28 21:21:40,158 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,158 INFO  L485      AbstractCegarLoop]: Abstraction has 133 states and 329 transitions.
[2025-04-28 21:21:40,159 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 2.0) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:40,159 INFO  L278                IsEmpty]: Start isEmpty. Operand 133 states and 329 transitions.
[2025-04-28 21:21:40,161 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:40,161 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,162 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:40,162 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-04-28 21:21:40,162 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:40,162 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:40,163 INFO  L85        PathProgramCache]: Analyzing trace with hash 1077049810, now seen corresponding path program 1 times
[2025-04-28 21:21:40,163 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:40,163 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595885904]
[2025-04-28 21:21:40,163 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,163 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,168 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:40,175 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:40,178 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,178 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,241 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:40,241 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:40,241 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595885904]
[2025-04-28 21:21:40,242 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595885904] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:40,242 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:40,242 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:40,242 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621975538]
[2025-04-28 21:21:40,242 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:40,242 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:40,242 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:40,243 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:40,243 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:40,243 INFO  L87              Difference]: Start difference. First operand 133 states and 329 transitions. Second operand  has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:40,432 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,432 INFO  L93              Difference]: Finished difference Result 204 states and 566 transitions.
[2025-04-28 21:21:40,433 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:40,433 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 29
[2025-04-28 21:21:40,433 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,437 INFO  L225             Difference]: With dead ends: 204
[2025-04-28 21:21:40,437 INFO  L226             Difference]: Without dead ends: 174
[2025-04-28 21:21:40,437 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:40,438 INFO  L437           NwaCegarLoop]: 56 mSDtfsCounter, 9 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,440 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 271 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:40,441 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 174 states.
[2025-04-28 21:21:40,458 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 138.
[2025-04-28 21:21:40,459 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 138 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 80 states have internal predecessors, (84), 33 states have call successors, (33), 11 states have call predecessors, (33), 46 states have return successors, (205), 46 states have call predecessors, (205), 33 states have call successors, (205)
[2025-04-28 21:21:40,460 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 322 transitions.
[2025-04-28 21:21:40,460 INFO  L79                 Accepts]: Start accepts. Automaton has 138 states and 322 transitions. Word has length 29
[2025-04-28 21:21:40,461 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,461 INFO  L485      AbstractCegarLoop]: Abstraction has 138 states and 322 transitions.
[2025-04-28 21:21:40,461 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:40,461 INFO  L278                IsEmpty]: Start isEmpty. Operand 138 states and 322 transitions.
[2025-04-28 21:21:40,464 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:40,464 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,464 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:40,465 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-04-28 21:21:40,465 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:40,465 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:40,465 INFO  L85        PathProgramCache]: Analyzing trace with hash -150577705, now seen corresponding path program 1 times
[2025-04-28 21:21:40,465 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:40,465 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902959623]
[2025-04-28 21:21:40,465 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,465 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,471 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:40,486 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:40,486 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,486 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,848 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:40,848 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:40,848 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902959623]
[2025-04-28 21:21:40,848 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902959623] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:40,848 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107148829]
[2025-04-28 21:21:40,848 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,848 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:40,851 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:40,854 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:40,858 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:21:40,909 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:40,927 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:40,927 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,927 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,929 INFO  L256         TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 46 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:40,931 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:41,168 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:41,168 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:43,179 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:43,179 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107148829] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:43,179 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:43,179 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18
[2025-04-28 21:21:43,180 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733278550]
[2025-04-28 21:21:43,180 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:43,180 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2025-04-28 21:21:43,180 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:43,180 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2025-04-28 21:21:43,181 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306
[2025-04-28 21:21:43,181 INFO  L87              Difference]: Start difference. First operand 138 states and 322 transitions. Second operand  has 18 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 18 states have internal predecessors, (21), 10 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13)
[2025-04-28 21:21:43,876 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:43,876 INFO  L93              Difference]: Finished difference Result 185 states and 456 transitions.
[2025-04-28 21:21:43,877 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-04-28 21:21:43,877 INFO  L79                 Accepts]: Start accepts. Automaton has  has 18 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 18 states have internal predecessors, (21), 10 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) Word has length 29
[2025-04-28 21:21:43,878 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:43,880 INFO  L225             Difference]: With dead ends: 185
[2025-04-28 21:21:43,880 INFO  L226             Difference]: Without dead ends: 185
[2025-04-28 21:21:43,881 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:21:43,881 INFO  L437           NwaCegarLoop]: 57 mSDtfsCounter, 14 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:43,882 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 572 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-04-28 21:21:43,882 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 185 states.
[2025-04-28 21:21:43,898 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145.
[2025-04-28 21:21:43,898 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 145 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 84 states have internal predecessors, (87), 34 states have call successors, (34), 11 states have call predecessors, (34), 49 states have return successors, (220), 49 states have call predecessors, (220), 34 states have call successors, (220)
[2025-04-28 21:21:43,900 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 341 transitions.
[2025-04-28 21:21:43,900 INFO  L79                 Accepts]: Start accepts. Automaton has 145 states and 341 transitions. Word has length 29
[2025-04-28 21:21:43,900 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:43,900 INFO  L485      AbstractCegarLoop]: Abstraction has 145 states and 341 transitions.
[2025-04-28 21:21:43,901 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 18 states have internal predecessors, (21), 10 states have call successors, (12), 1 states have call predecessors, (12), 8 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13)
[2025-04-28 21:21:43,901 INFO  L278                IsEmpty]: Start isEmpty. Operand 145 states and 341 transitions.
[2025-04-28 21:21:43,903 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:43,903 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:43,903 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:43,908 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-04-28 21:21:44,107 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-04-28 21:21:44,108 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:44,108 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:44,108 INFO  L85        PathProgramCache]: Analyzing trace with hash 371237916, now seen corresponding path program 1 times
[2025-04-28 21:21:44,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:44,108 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147137399]
[2025-04-28 21:21:44,108 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:44,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:44,118 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:44,127 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:44,127 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:44,127 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,235 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:44,235 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:44,235 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147137399]
[2025-04-28 21:21:44,235 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147137399] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:44,235 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1521685359]
[2025-04-28 21:21:44,235 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:44,235 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:44,238 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:44,240 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:44,243 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-04-28 21:21:44,300 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:44,324 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:44,324 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:44,324 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,325 INFO  L256         TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:44,327 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:44,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:44,368 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:44,863 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:44,863 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1521685359] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:44,863 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:44,863 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11
[2025-04-28 21:21:44,864 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308071089]
[2025-04-28 21:21:44,864 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:44,864 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-04-28 21:21:44,864 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:44,865 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-04-28 21:21:44,865 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:44,865 INFO  L87              Difference]: Start difference. First operand 145 states and 341 transitions. Second operand  has 11 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 11 states have internal predecessors, (17), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9)
[2025-04-28 21:21:45,090 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:45,091 INFO  L93              Difference]: Finished difference Result 225 states and 541 transitions.
[2025-04-28 21:21:45,091 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:45,091 INFO  L79                 Accepts]: Start accepts. Automaton has  has 11 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 11 states have internal predecessors, (17), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) Word has length 29
[2025-04-28 21:21:45,091 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:45,095 INFO  L225             Difference]: With dead ends: 225
[2025-04-28 21:21:45,095 INFO  L226             Difference]: Without dead ends: 225
[2025-04-28 21:21:45,095 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:45,096 INFO  L437           NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:45,097 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 422 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:45,097 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 225 states.
[2025-04-28 21:21:45,118 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 187.
[2025-04-28 21:21:45,119 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 187 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 105 states have internal predecessors, (108), 34 states have call successors, (34), 11 states have call predecessors, (34), 70 states have return successors, (312), 70 states have call predecessors, (312), 34 states have call successors, (312)
[2025-04-28 21:21:45,121 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 454 transitions.
[2025-04-28 21:21:45,124 INFO  L79                 Accepts]: Start accepts. Automaton has 187 states and 454 transitions. Word has length 29
[2025-04-28 21:21:45,124 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:45,124 INFO  L485      AbstractCegarLoop]: Abstraction has 187 states and 454 transitions.
[2025-04-28 21:21:45,124 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 11 states have internal predecessors, (17), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9)
[2025-04-28 21:21:45,124 INFO  L278                IsEmpty]: Start isEmpty. Operand 187 states and 454 transitions.
[2025-04-28 21:21:45,127 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:45,127 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:45,127 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:45,136 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:45,331 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2025-04-28 21:21:45,332 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:45,332 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:45,332 INFO  L85        PathProgramCache]: Analyzing trace with hash -1199434121, now seen corresponding path program 1 times
[2025-04-28 21:21:45,332 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:45,333 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432382141]
[2025-04-28 21:21:45,333 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:45,333 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:45,338 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:45,343 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:45,344 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:45,344 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:45,410 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:45,410 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:45,410 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432382141]
[2025-04-28 21:21:45,410 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432382141] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:45,410 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:45,410 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:45,411 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275397994]
[2025-04-28 21:21:45,411 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:45,411 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:45,411 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:45,411 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:45,411 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:45,412 INFO  L87              Difference]: Start difference. First operand 187 states and 454 transitions. Second operand  has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:45,593 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:45,593 INFO  L93              Difference]: Finished difference Result 213 states and 500 transitions.
[2025-04-28 21:21:45,593 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:45,594 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 29
[2025-04-28 21:21:45,594 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:45,596 INFO  L225             Difference]: With dead ends: 213
[2025-04-28 21:21:45,597 INFO  L226             Difference]: Without dead ends: 191
[2025-04-28 21:21:45,597 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:45,597 INFO  L437           NwaCegarLoop]: 58 mSDtfsCounter, 7 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:45,598 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 287 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:45,598 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 191 states.
[2025-04-28 21:21:45,613 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 181.
[2025-04-28 21:21:45,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 181 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 102 states have internal predecessors, (105), 34 states have call successors, (34), 11 states have call predecessors, (34), 67 states have return successors, (272), 67 states have call predecessors, (272), 34 states have call successors, (272)
[2025-04-28 21:21:45,615 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 411 transitions.
[2025-04-28 21:21:45,615 INFO  L79                 Accepts]: Start accepts. Automaton has 181 states and 411 transitions. Word has length 29
[2025-04-28 21:21:45,615 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:45,615 INFO  L485      AbstractCegarLoop]: Abstraction has 181 states and 411 transitions.
[2025-04-28 21:21:45,616 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 5 states have (on average 2.8) internal successors, (14), 7 states have internal predecessors, (14), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:45,616 INFO  L278                IsEmpty]: Start isEmpty. Operand 181 states and 411 transitions.
[2025-04-28 21:21:45,618 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:45,618 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:45,618 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:45,619 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-04-28 21:21:45,619 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:45,619 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:45,619 INFO  L85        PathProgramCache]: Analyzing trace with hash -1167692950, now seen corresponding path program 1 times
[2025-04-28 21:21:45,619 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:45,619 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364817259]
[2025-04-28 21:21:45,619 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:45,619 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:45,623 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:45,627 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:45,627 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:45,627 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:45,697 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:45,697 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:45,697 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364817259]
[2025-04-28 21:21:45,697 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364817259] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:45,698 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512183662]
[2025-04-28 21:21:45,698 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:45,698 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:45,700 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:45,702 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:45,707 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-04-28 21:21:45,768 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:45,786 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:45,786 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:45,787 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:45,787 INFO  L256         TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:45,789 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:45,821 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:45,821 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:46,389 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:46,390 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [512183662] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:46,390 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:46,390 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 10
[2025-04-28 21:21:46,390 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314613203]
[2025-04-28 21:21:46,390 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:46,390 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:46,390 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:46,391 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:46,391 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:46,391 INFO  L87              Difference]: Start difference. First operand 181 states and 411 transitions. Second operand  has 10 states, 6 states have (on average 3.0) internal successors, (18), 10 states have internal predecessors, (18), 6 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10)
[2025-04-28 21:21:46,625 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:46,625 INFO  L93              Difference]: Finished difference Result 261 states and 594 transitions.
[2025-04-28 21:21:46,625 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:21:46,625 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 6 states have (on average 3.0) internal successors, (18), 10 states have internal predecessors, (18), 6 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 29
[2025-04-28 21:21:46,626 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:46,629 INFO  L225             Difference]: With dead ends: 261
[2025-04-28 21:21:46,629 INFO  L226             Difference]: Without dead ends: 245
[2025-04-28 21:21:46,629 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:46,630 INFO  L437           NwaCegarLoop]: 51 mSDtfsCounter, 7 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:46,630 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 341 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:46,631 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 245 states.
[2025-04-28 21:21:46,650 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 177.
[2025-04-28 21:21:46,651 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 177 states, 76 states have (on average 1.381578947368421) internal successors, (105), 101 states have internal predecessors, (105), 37 states have call successors, (37), 12 states have call predecessors, (37), 63 states have return successors, (252), 63 states have call predecessors, (252), 37 states have call successors, (252)
[2025-04-28 21:21:46,652 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 394 transitions.
[2025-04-28 21:21:46,653 INFO  L79                 Accepts]: Start accepts. Automaton has 177 states and 394 transitions. Word has length 29
[2025-04-28 21:21:46,653 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:46,653 INFO  L485      AbstractCegarLoop]: Abstraction has 177 states and 394 transitions.
[2025-04-28 21:21:46,653 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 6 states have (on average 3.0) internal successors, (18), 10 states have internal predecessors, (18), 6 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10)
[2025-04-28 21:21:46,653 INFO  L278                IsEmpty]: Start isEmpty. Operand 177 states and 394 transitions.
[2025-04-28 21:21:46,656 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:46,656 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:46,656 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:46,661 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:46,860 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:46,861 INFO  L403      AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:46,861 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:46,861 INFO  L85        PathProgramCache]: Analyzing trace with hash -1497049072, now seen corresponding path program 1 times
[2025-04-28 21:21:46,861 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:46,861 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952470063]
[2025-04-28 21:21:46,861 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:46,861 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:46,865 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:46,868 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:46,868 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:46,868 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:46,973 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-04-28 21:21:46,973 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:46,974 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952470063]
[2025-04-28 21:21:46,974 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952470063] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:46,974 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:46,974 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-04-28 21:21:46,974 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798856596]
[2025-04-28 21:21:46,974 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:46,975 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:46,976 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:46,976 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:46,976 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:46,976 INFO  L87              Difference]: Start difference. First operand 177 states and 394 transitions. Second operand  has 9 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:47,177 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:47,177 INFO  L93              Difference]: Finished difference Result 193 states and 428 transitions.
[2025-04-28 21:21:47,177 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:47,178 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 29
[2025-04-28 21:21:47,178 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:47,180 INFO  L225             Difference]: With dead ends: 193
[2025-04-28 21:21:47,180 INFO  L226             Difference]: Without dead ends: 191
[2025-04-28 21:21:47,181 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:47,181 INFO  L437           NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:47,182 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 374 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:47,183 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 191 states.
[2025-04-28 21:21:47,198 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 175.
[2025-04-28 21:21:47,199 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 175 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 100 states have internal predecessors, (104), 37 states have call successors, (37), 12 states have call predecessors, (37), 62 states have return successors, (248), 62 states have call predecessors, (248), 37 states have call successors, (248)
[2025-04-28 21:21:47,201 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 389 transitions.
[2025-04-28 21:21:47,201 INFO  L79                 Accepts]: Start accepts. Automaton has 175 states and 389 transitions. Word has length 29
[2025-04-28 21:21:47,201 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:47,201 INFO  L485      AbstractCegarLoop]: Abstraction has 175 states and 389 transitions.
[2025-04-28 21:21:47,201 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:47,202 INFO  L278                IsEmpty]: Start isEmpty. Operand 175 states and 389 transitions.
[2025-04-28 21:21:47,204 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:47,204 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:47,204 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:47,204 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-04-28 21:21:47,204 INFO  L403      AbstractCegarLoop]: === Iteration 20 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:47,205 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:47,205 INFO  L85        PathProgramCache]: Analyzing trace with hash 2049294820, now seen corresponding path program 1 times
[2025-04-28 21:21:47,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:47,205 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983850916]
[2025-04-28 21:21:47,205 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:47,205 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:47,208 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:47,212 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:47,212 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:47,212 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:47,383 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:47,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:47,384 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983850916]
[2025-04-28 21:21:47,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983850916] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:47,384 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949711678]
[2025-04-28 21:21:47,384 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:47,384 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:47,387 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:47,390 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:47,393 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-04-28 21:21:47,477 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:47,494 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:47,494 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:47,494 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:47,495 INFO  L256         TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:47,496 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:47,563 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:47,564 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:47,910 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:47,910 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [949711678] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:47,910 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:47,910 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 18
[2025-04-28 21:21:47,910 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441933451]
[2025-04-28 21:21:47,910 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:47,911 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2025-04-28 21:21:47,911 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:47,911 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2025-04-28 21:21:47,912 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306
[2025-04-28 21:21:47,912 INFO  L87              Difference]: Start difference. First operand 175 states and 389 transitions. Second operand  has 18 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (15), 10 states have call predecessors, (15), 9 states have call successors, (15)
[2025-04-28 21:21:48,510 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:48,510 INFO  L93              Difference]: Finished difference Result 261 states and 610 transitions.
[2025-04-28 21:21:48,511 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2025-04-28 21:21:48,511 INFO  L79                 Accepts]: Start accepts. Automaton has  has 18 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (15), 10 states have call predecessors, (15), 9 states have call successors, (15) Word has length 29
[2025-04-28 21:21:48,511 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:48,515 INFO  L225             Difference]: With dead ends: 261
[2025-04-28 21:21:48,515 INFO  L226             Difference]: Without dead ends: 249
[2025-04-28 21:21:48,515 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600
[2025-04-28 21:21:48,516 INFO  L437           NwaCegarLoop]: 52 mSDtfsCounter, 11 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:48,516 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 573 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-04-28 21:21:48,517 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 249 states.
[2025-04-28 21:21:48,540 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 185.
[2025-04-28 21:21:48,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 185 states, 80 states have (on average 1.3625) internal successors, (109), 105 states have internal predecessors, (109), 37 states have call successors, (37), 12 states have call predecessors, (37), 67 states have return successors, (269), 67 states have call predecessors, (269), 37 states have call successors, (269)
[2025-04-28 21:21:48,542 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 415 transitions.
[2025-04-28 21:21:48,542 INFO  L79                 Accepts]: Start accepts. Automaton has 185 states and 415 transitions. Word has length 29
[2025-04-28 21:21:48,543 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:48,543 INFO  L485      AbstractCegarLoop]: Abstraction has 185 states and 415 transitions.
[2025-04-28 21:21:48,543 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (15), 10 states have call predecessors, (15), 9 states have call successors, (15)
[2025-04-28 21:21:48,543 INFO  L278                IsEmpty]: Start isEmpty. Operand 185 states and 415 transitions.
[2025-04-28 21:21:48,546 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:48,546 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:48,547 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:48,552 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2025-04-28 21:21:48,750 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2025-04-28 21:21:48,753 INFO  L403      AbstractCegarLoop]: === Iteration 21 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:48,753 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:48,754 INFO  L85        PathProgramCache]: Analyzing trace with hash -676981205, now seen corresponding path program 1 times
[2025-04-28 21:21:48,754 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:48,754 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375258073]
[2025-04-28 21:21:48,754 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:48,754 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:48,763 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:48,770 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:48,770 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:48,774 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:48,894 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-04-28 21:21:48,895 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:48,895 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375258073]
[2025-04-28 21:21:48,895 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375258073] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:48,895 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:48,895 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-04-28 21:21:48,895 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891244304]
[2025-04-28 21:21:48,895 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:48,895 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:48,896 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:48,896 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:48,896 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:48,896 INFO  L87              Difference]: Start difference. First operand 185 states and 415 transitions. Second operand  has 9 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:49,057 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:49,057 INFO  L93              Difference]: Finished difference Result 205 states and 457 transitions.
[2025-04-28 21:21:49,058 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:21:49,058 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 29
[2025-04-28 21:21:49,059 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:49,061 INFO  L225             Difference]: With dead ends: 205
[2025-04-28 21:21:49,062 INFO  L226             Difference]: Without dead ends: 201
[2025-04-28 21:21:49,062 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:49,063 INFO  L437           NwaCegarLoop]: 53 mSDtfsCounter, 5 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:49,063 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 362 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:49,064 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 201 states.
[2025-04-28 21:21:49,079 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 189.
[2025-04-28 21:21:49,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 189 states, 82 states have (on average 1.353658536585366) internal successors, (111), 107 states have internal predecessors, (111), 37 states have call successors, (37), 12 states have call predecessors, (37), 69 states have return successors, (277), 69 states have call predecessors, (277), 37 states have call successors, (277)
[2025-04-28 21:21:49,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 425 transitions.
[2025-04-28 21:21:49,082 INFO  L79                 Accepts]: Start accepts. Automaton has 189 states and 425 transitions. Word has length 29
[2025-04-28 21:21:49,082 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:49,082 INFO  L485      AbstractCegarLoop]: Abstraction has 189 states and 425 transitions.
[2025-04-28 21:21:49,083 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:49,083 INFO  L278                IsEmpty]: Start isEmpty. Operand 189 states and 425 transitions.
[2025-04-28 21:21:49,085 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:49,085 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:49,085 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:49,086 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-04-28 21:21:49,086 INFO  L403      AbstractCegarLoop]: === Iteration 22 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:49,086 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:49,086 INFO  L85        PathProgramCache]: Analyzing trace with hash 1607770741, now seen corresponding path program 1 times
[2025-04-28 21:21:49,086 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:49,086 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651833609]
[2025-04-28 21:21:49,086 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:49,087 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:49,090 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-04-28 21:21:49,093 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:49,093 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:49,093 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:49,189 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-04-28 21:21:49,190 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:49,190 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651833609]
[2025-04-28 21:21:49,190 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651833609] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:49,190 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:49,190 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-04-28 21:21:49,190 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913407002]
[2025-04-28 21:21:49,190 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:49,190 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:49,190 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:49,191 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:49,191 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:49,191 INFO  L87              Difference]: Start difference. First operand 189 states and 425 transitions. Second operand  has 9 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:49,374 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:49,375 INFO  L93              Difference]: Finished difference Result 221 states and 497 transitions.
[2025-04-28 21:21:49,375 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:49,375 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 29
[2025-04-28 21:21:49,375 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:49,378 INFO  L225             Difference]: With dead ends: 221
[2025-04-28 21:21:49,378 INFO  L226             Difference]: Without dead ends: 217
[2025-04-28 21:21:49,379 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:49,380 INFO  L437           NwaCegarLoop]: 57 mSDtfsCounter, 4 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:49,380 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 395 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:49,381 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 217 states.
[2025-04-28 21:21:49,397 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 193.
[2025-04-28 21:21:49,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 193 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 109 states have internal predecessors, (113), 37 states have call successors, (37), 12 states have call predecessors, (37), 71 states have return successors, (285), 71 states have call predecessors, (285), 37 states have call successors, (285)
[2025-04-28 21:21:49,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 435 transitions.
[2025-04-28 21:21:49,400 INFO  L79                 Accepts]: Start accepts. Automaton has 193 states and 435 transitions. Word has length 29
[2025-04-28 21:21:49,400 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:49,400 INFO  L485      AbstractCegarLoop]: Abstraction has 193 states and 435 transitions.
[2025-04-28 21:21:49,400 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 9 states have internal predecessors, (13), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:49,400 INFO  L278                IsEmpty]: Start isEmpty. Operand 193 states and 435 transitions.
[2025-04-28 21:21:49,403 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:49,403 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:49,403 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:49,403 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-04-28 21:21:49,404 INFO  L403      AbstractCegarLoop]: === Iteration 23 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:49,404 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:49,404 INFO  L85        PathProgramCache]: Analyzing trace with hash -613678119, now seen corresponding path program 1 times
[2025-04-28 21:21:49,404 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:49,404 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832439838]
[2025-04-28 21:21:49,404 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:49,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:49,408 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-04-28 21:21:49,414 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:49,415 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:49,415 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:49,510 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:49,510 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:49,510 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832439838]
[2025-04-28 21:21:49,510 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832439838] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:49,510 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:49,510 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:49,510 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249359888]
[2025-04-28 21:21:49,510 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:49,511 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:49,511 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:49,511 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:49,511 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:49,511 INFO  L87              Difference]: Start difference. First operand 193 states and 435 transitions. Second operand  has 8 states, 6 states have (on average 2.5) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8)
[2025-04-28 21:21:49,785 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:49,786 INFO  L93              Difference]: Finished difference Result 308 states and 744 transitions.
[2025-04-28 21:21:49,786 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:21:49,786 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 2.5) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 33
[2025-04-28 21:21:49,786 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:49,790 INFO  L225             Difference]: With dead ends: 308
[2025-04-28 21:21:49,790 INFO  L226             Difference]: Without dead ends: 280
[2025-04-28 21:21:49,791 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:49,791 INFO  L437           NwaCegarLoop]: 57 mSDtfsCounter, 11 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:49,791 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 313 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:49,792 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 280 states.
[2025-04-28 21:21:49,813 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 220.
[2025-04-28 21:21:49,814 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 220 states, 97 states have (on average 1.309278350515464) internal successors, (127), 123 states have internal predecessors, (127), 39 states have call successors, (39), 13 states have call predecessors, (39), 83 states have return successors, (339), 83 states have call predecessors, (339), 39 states have call successors, (339)
[2025-04-28 21:21:49,816 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 505 transitions.
[2025-04-28 21:21:49,816 INFO  L79                 Accepts]: Start accepts. Automaton has 220 states and 505 transitions. Word has length 33
[2025-04-28 21:21:49,816 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:49,816 INFO  L485      AbstractCegarLoop]: Abstraction has 220 states and 505 transitions.
[2025-04-28 21:21:49,817 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 2.5) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8)
[2025-04-28 21:21:49,817 INFO  L278                IsEmpty]: Start isEmpty. Operand 220 states and 505 transitions.
[2025-04-28 21:21:49,820 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:49,820 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:49,820 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:49,820 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-04-28 21:21:49,820 INFO  L403      AbstractCegarLoop]: === Iteration 24 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:49,821 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:49,821 INFO  L85        PathProgramCache]: Analyzing trace with hash 499056242, now seen corresponding path program 1 times
[2025-04-28 21:21:49,821 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:49,821 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142971088]
[2025-04-28 21:21:49,821 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:49,821 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:49,825 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-04-28 21:21:49,829 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:49,830 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:49,830 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:49,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:49,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:49,904 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142971088]
[2025-04-28 21:21:49,904 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142971088] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:49,905 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:49,905 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:49,905 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275771443]
[2025-04-28 21:21:49,905 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:49,905 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:49,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:49,906 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:49,906 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:49,906 INFO  L87              Difference]: Start difference. First operand 220 states and 505 transitions. Second operand  has 8 states, 6 states have (on average 2.5) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8)
[2025-04-28 21:21:50,133 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:50,134 INFO  L93              Difference]: Finished difference Result 256 states and 575 transitions.
[2025-04-28 21:21:50,134 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:50,134 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 6 states have (on average 2.5) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 33
[2025-04-28 21:21:50,135 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:50,137 INFO  L225             Difference]: With dead ends: 256
[2025-04-28 21:21:50,137 INFO  L226             Difference]: Without dead ends: 216
[2025-04-28 21:21:50,138 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:50,138 INFO  L437           NwaCegarLoop]: 60 mSDtfsCounter, 9 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:50,138 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 347 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:50,139 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 216 states.
[2025-04-28 21:21:50,155 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 204.
[2025-04-28 21:21:50,156 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 204 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 115 states have internal predecessors, (119), 39 states have call successors, (39), 13 states have call predecessors, (39), 75 states have return successors, (293), 75 states have call predecessors, (293), 39 states have call successors, (293)
[2025-04-28 21:21:50,158 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 451 transitions.
[2025-04-28 21:21:50,158 INFO  L79                 Accepts]: Start accepts. Automaton has 204 states and 451 transitions. Word has length 33
[2025-04-28 21:21:50,158 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:50,158 INFO  L485      AbstractCegarLoop]: Abstraction has 204 states and 451 transitions.
[2025-04-28 21:21:50,159 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 6 states have (on average 2.5) internal successors, (15), 8 states have internal predecessors, (15), 3 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8)
[2025-04-28 21:21:50,159 INFO  L278                IsEmpty]: Start isEmpty. Operand 204 states and 451 transitions.
[2025-04-28 21:21:50,162 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:50,162 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:50,162 INFO  L218           NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:50,162 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-04-28 21:21:50,162 INFO  L403      AbstractCegarLoop]: === Iteration 25 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:50,162 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:50,163 INFO  L85        PathProgramCache]: Analyzing trace with hash -1296696103, now seen corresponding path program 1 times
[2025-04-28 21:21:50,163 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:50,163 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53260631]
[2025-04-28 21:21:50,163 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:50,163 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:50,167 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-04-28 21:21:50,170 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:50,170 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:50,170 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:50,306 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-04-28 21:21:50,306 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:50,306 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53260631]
[2025-04-28 21:21:50,307 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53260631] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:50,307 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:50,307 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-04-28 21:21:50,307 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736109526]
[2025-04-28 21:21:50,307 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:50,307 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:50,307 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:50,308 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:50,308 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:50,308 INFO  L87              Difference]: Start difference. First operand 204 states and 451 transitions. Second operand  has 10 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 10 states have internal predecessors, (14), 5 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8)
[2025-04-28 21:21:50,497 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:50,498 INFO  L93              Difference]: Finished difference Result 216 states and 482 transitions.
[2025-04-28 21:21:50,498 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:21:50,498 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 10 states have internal predecessors, (14), 5 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 33
[2025-04-28 21:21:50,498 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:50,501 INFO  L225             Difference]: With dead ends: 216
[2025-04-28 21:21:50,501 INFO  L226             Difference]: Without dead ends: 211
[2025-04-28 21:21:50,502 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:21:50,502 INFO  L437           NwaCegarLoop]: 54 mSDtfsCounter, 4 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:50,503 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 364 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:50,504 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 211 states.
[2025-04-28 21:21:50,520 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 187.
[2025-04-28 21:21:50,525 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 187 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 106 states have internal predecessors, (110), 38 states have call successors, (38), 13 states have call predecessors, (38), 67 states have return successors, (259), 67 states have call predecessors, (259), 38 states have call successors, (259)
[2025-04-28 21:21:50,526 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 407 transitions.
[2025-04-28 21:21:50,527 INFO  L79                 Accepts]: Start accepts. Automaton has 187 states and 407 transitions. Word has length 33
[2025-04-28 21:21:50,527 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:50,527 INFO  L485      AbstractCegarLoop]: Abstraction has 187 states and 407 transitions.
[2025-04-28 21:21:50,527 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 10 states have internal predecessors, (14), 5 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8)
[2025-04-28 21:21:50,527 INFO  L278                IsEmpty]: Start isEmpty. Operand 187 states and 407 transitions.
[2025-04-28 21:21:50,529 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:50,529 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:50,529 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:50,530 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-04-28 21:21:50,530 INFO  L403      AbstractCegarLoop]: === Iteration 26 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:50,530 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:50,530 INFO  L85        PathProgramCache]: Analyzing trace with hash -200784922, now seen corresponding path program 2 times
[2025-04-28 21:21:50,530 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:50,530 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149478248]
[2025-04-28 21:21:50,530 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:50,531 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:50,535 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes.
[2025-04-28 21:21:50,540 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:50,540 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:50,540 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:50,646 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:50,646 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:50,646 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149478248]
[2025-04-28 21:21:50,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149478248] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:50,646 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889865875]
[2025-04-28 21:21:50,646 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:50,646 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:50,649 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:50,651 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:50,655 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-04-28 21:21:50,727 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes.
[2025-04-28 21:21:50,749 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:50,750 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:50,750 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:50,751 INFO  L256         TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:50,755 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:50,804 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:50,804 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:51,728 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:51,729 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [889865875] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:51,729 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:51,729 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15
[2025-04-28 21:21:51,729 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826411606]
[2025-04-28 21:21:51,729 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:51,729 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-04-28 21:21:51,730 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:51,730 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-04-28 21:21:51,730 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:51,731 INFO  L87              Difference]: Start difference. First operand 187 states and 407 transitions. Second operand  has 15 states, 7 states have (on average 3.0) internal successors, (21), 15 states have internal predecessors, (21), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (14), 6 states have call predecessors, (14), 10 states have call successors, (14)
[2025-04-28 21:21:52,066 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:52,066 INFO  L93              Difference]: Finished difference Result 257 states and 597 transitions.
[2025-04-28 21:21:52,066 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-04-28 21:21:52,067 INFO  L79                 Accepts]: Start accepts. Automaton has  has 15 states, 7 states have (on average 3.0) internal successors, (21), 15 states have internal predecessors, (21), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (14), 6 states have call predecessors, (14), 10 states have call successors, (14) Word has length 33
[2025-04-28 21:21:52,067 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:52,070 INFO  L225             Difference]: With dead ends: 257
[2025-04-28 21:21:52,070 INFO  L226             Difference]: Without dead ends: 253
[2025-04-28 21:21:52,070 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380
[2025-04-28 21:21:52,071 INFO  L437           NwaCegarLoop]: 48 mSDtfsCounter, 10 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:52,072 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 350 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:52,073 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 253 states.
[2025-04-28 21:21:52,097 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 207.
[2025-04-28 21:21:52,098 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 207 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 116 states have internal predecessors, (120), 38 states have call successors, (38), 13 states have call predecessors, (38), 77 states have return successors, (300), 77 states have call predecessors, (300), 38 states have call successors, (300)
[2025-04-28 21:21:52,100 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 458 transitions.
[2025-04-28 21:21:52,101 INFO  L79                 Accepts]: Start accepts. Automaton has 207 states and 458 transitions. Word has length 33
[2025-04-28 21:21:52,101 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:52,101 INFO  L485      AbstractCegarLoop]: Abstraction has 207 states and 458 transitions.
[2025-04-28 21:21:52,102 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 7 states have (on average 3.0) internal successors, (21), 15 states have internal predecessors, (21), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (14), 6 states have call predecessors, (14), 10 states have call successors, (14)
[2025-04-28 21:21:52,103 INFO  L278                IsEmpty]: Start isEmpty. Operand 207 states and 458 transitions.
[2025-04-28 21:21:52,105 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:52,106 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:52,106 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:52,111 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:52,309 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26
[2025-04-28 21:21:52,310 INFO  L403      AbstractCegarLoop]: === Iteration 27 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:52,310 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:52,310 INFO  L85        PathProgramCache]: Analyzing trace with hash -543485663, now seen corresponding path program 3 times
[2025-04-28 21:21:52,311 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:52,311 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908015009]
[2025-04-28 21:21:52,311 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:52,311 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:52,316 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes.
[2025-04-28 21:21:52,323 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:52,324 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:52,324 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:52,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:52,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:52,407 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908015009]
[2025-04-28 21:21:52,407 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908015009] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:52,407 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100736706]
[2025-04-28 21:21:52,407 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:52,408 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:52,410 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:52,412 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:52,420 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-04-28 21:21:52,495 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 33 statements into 3 equivalence classes.
[2025-04-28 21:21:52,517 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:52,518 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:52,518 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:52,519 INFO  L256         TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:52,520 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:52,545 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:52,546 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:52,953 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:52,953 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100736706] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:52,953 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:52,953 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 9
[2025-04-28 21:21:52,953 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624774323]
[2025-04-28 21:21:52,953 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:52,953 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:52,953 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:52,954 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:52,954 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:52,954 INFO  L87              Difference]: Start difference. First operand 207 states and 458 transitions. Second operand  has 9 states, 5 states have (on average 3.6) internal successors, (18), 9 states have internal predecessors, (18), 6 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10)
[2025-04-28 21:21:53,144 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:53,144 INFO  L93              Difference]: Finished difference Result 241 states and 510 transitions.
[2025-04-28 21:21:53,144 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:21:53,144 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), 6 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 33
[2025-04-28 21:21:53,144 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:53,147 INFO  L225             Difference]: With dead ends: 241
[2025-04-28 21:21:53,147 INFO  L226             Difference]: Without dead ends: 231
[2025-04-28 21:21:53,148 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:53,148 INFO  L437           NwaCegarLoop]: 51 mSDtfsCounter, 10 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:53,148 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 300 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:53,149 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 231 states.
[2025-04-28 21:21:53,168 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 203.
[2025-04-28 21:21:53,169 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 203 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 114 states have internal predecessors, (118), 38 states have call successors, (38), 13 states have call predecessors, (38), 75 states have return successors, (298), 75 states have call predecessors, (298), 38 states have call successors, (298)
[2025-04-28 21:21:53,171 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 454 transitions.
[2025-04-28 21:21:53,171 INFO  L79                 Accepts]: Start accepts. Automaton has 203 states and 454 transitions. Word has length 33
[2025-04-28 21:21:53,171 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:53,172 INFO  L485      AbstractCegarLoop]: Abstraction has 203 states and 454 transitions.
[2025-04-28 21:21:53,172 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), 6 states have call successors, (10), 1 states have call predecessors, (10), 5 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10)
[2025-04-28 21:21:53,172 INFO  L278                IsEmpty]: Start isEmpty. Operand 203 states and 454 transitions.
[2025-04-28 21:21:53,174 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:53,175 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:53,175 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:53,182 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:53,376 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27
[2025-04-28 21:21:53,377 INFO  L403      AbstractCegarLoop]: === Iteration 28 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:53,377 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:53,377 INFO  L85        PathProgramCache]: Analyzing trace with hash 1384543483, now seen corresponding path program 1 times
[2025-04-28 21:21:53,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:53,378 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659345791]
[2025-04-28 21:21:53,378 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:53,378 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:53,382 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-04-28 21:21:53,389 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:53,390 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:53,390 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:53,521 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:53,521 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:53,521 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659345791]
[2025-04-28 21:21:53,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659345791] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:53,521 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585897727]
[2025-04-28 21:21:53,521 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:53,521 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:53,524 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:53,526 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:53,530 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2025-04-28 21:21:53,610 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-04-28 21:21:53,633 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:53,634 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:53,634 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:53,635 INFO  L256         TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:53,636 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:53,678 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:53,679 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:54,983 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:54,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [585897727] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:54,984 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:54,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13
[2025-04-28 21:21:54,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970649692]
[2025-04-28 21:21:54,984 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:54,984 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-28 21:21:54,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:54,985 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-28 21:21:54,985 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:54,985 INFO  L87              Difference]: Start difference. First operand 203 states and 454 transitions. Second operand  has 13 states, 8 states have (on average 2.25) internal successors, (18), 13 states have internal predecessors, (18), 6 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10)
[2025-04-28 21:21:55,284 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:55,284 INFO  L93              Difference]: Finished difference Result 321 states and 730 transitions.
[2025-04-28 21:21:55,285 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:21:55,285 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 8 states have (on average 2.25) internal successors, (18), 13 states have internal predecessors, (18), 6 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 33
[2025-04-28 21:21:55,285 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:55,290 INFO  L225             Difference]: With dead ends: 321
[2025-04-28 21:21:55,290 INFO  L226             Difference]: Without dead ends: 315
[2025-04-28 21:21:55,290 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 57 SyntacticMatches, 9 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:55,291 INFO  L437           NwaCegarLoop]: 58 mSDtfsCounter, 5 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:55,291 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 496 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:55,292 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 315 states.
[2025-04-28 21:21:55,328 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 225.
[2025-04-28 21:21:55,329 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 225 states, 100 states have (on average 1.29) internal successors, (129), 125 states have internal predecessors, (129), 38 states have call successors, (38), 13 states have call predecessors, (38), 86 states have return successors, (332), 86 states have call predecessors, (332), 38 states have call successors, (332)
[2025-04-28 21:21:55,331 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 499 transitions.
[2025-04-28 21:21:55,331 INFO  L79                 Accepts]: Start accepts. Automaton has 225 states and 499 transitions. Word has length 33
[2025-04-28 21:21:55,331 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:55,332 INFO  L485      AbstractCegarLoop]: Abstraction has 225 states and 499 transitions.
[2025-04-28 21:21:55,332 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 8 states have (on average 2.25) internal successors, (18), 13 states have internal predecessors, (18), 6 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10)
[2025-04-28 21:21:55,332 INFO  L278                IsEmpty]: Start isEmpty. Operand 225 states and 499 transitions.
[2025-04-28 21:21:55,335 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:55,335 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:55,335 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:55,340 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:55,535 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28
[2025-04-28 21:21:55,536 INFO  L403      AbstractCegarLoop]: === Iteration 29 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:55,536 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:55,536 INFO  L85        PathProgramCache]: Analyzing trace with hash -1992091963, now seen corresponding path program 1 times
[2025-04-28 21:21:55,536 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:55,536 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289729382]
[2025-04-28 21:21:55,536 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:55,536 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:55,540 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-04-28 21:21:55,545 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:55,545 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:55,545 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:55,659 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:55,659 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:55,659 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289729382]
[2025-04-28 21:21:55,659 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289729382] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:55,659 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760933821]
[2025-04-28 21:21:55,659 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:55,659 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:55,662 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:55,664 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:55,667 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2025-04-28 21:21:55,767 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-04-28 21:21:55,789 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:55,789 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:55,789 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:55,791 INFO  L256         TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:55,792 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:55,913 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:55,913 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:57,111 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:57,111 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [760933821] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:57,111 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:57,111 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19
[2025-04-28 21:21:57,111 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358577439]
[2025-04-28 21:21:57,111 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:57,112 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2025-04-28 21:21:57,112 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:57,112 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2025-04-28 21:21:57,112 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:57,112 INFO  L87              Difference]: Start difference. First operand 225 states and 499 transitions. Second operand  has 19 states, 13 states have (on average 2.076923076923077) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (12), 1 states have call predecessors, (12), 12 states have return successors, (16), 10 states have call predecessors, (16), 7 states have call successors, (16)
[2025-04-28 21:21:57,777 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:57,777 INFO  L93              Difference]: Finished difference Result 529 states and 1246 transitions.
[2025-04-28 21:21:57,778 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2025-04-28 21:21:57,778 INFO  L79                 Accepts]: Start accepts. Automaton has  has 19 states, 13 states have (on average 2.076923076923077) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (12), 1 states have call predecessors, (12), 12 states have return successors, (16), 10 states have call predecessors, (16), 7 states have call successors, (16) Word has length 33
[2025-04-28 21:21:57,778 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:57,784 INFO  L225             Difference]: With dead ends: 529
[2025-04-28 21:21:57,785 INFO  L226             Difference]: Without dead ends: 503
[2025-04-28 21:21:57,785 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930
[2025-04-28 21:21:57,786 INFO  L437           NwaCegarLoop]: 54 mSDtfsCounter, 15 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:57,786 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 670 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-04-28 21:21:57,787 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 503 states.
[2025-04-28 21:21:57,825 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 203.
[2025-04-28 21:21:57,826 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 203 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 114 states have internal predecessors, (118), 38 states have call successors, (38), 13 states have call predecessors, (38), 75 states have return successors, (294), 75 states have call predecessors, (294), 38 states have call successors, (294)
[2025-04-28 21:21:57,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 450 transitions.
[2025-04-28 21:21:57,828 INFO  L79                 Accepts]: Start accepts. Automaton has 203 states and 450 transitions. Word has length 33
[2025-04-28 21:21:57,828 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:57,828 INFO  L485      AbstractCegarLoop]: Abstraction has 203 states and 450 transitions.
[2025-04-28 21:21:57,828 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 13 states have (on average 2.076923076923077) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (12), 1 states have call predecessors, (12), 12 states have return successors, (16), 10 states have call predecessors, (16), 7 states have call successors, (16)
[2025-04-28 21:21:57,828 INFO  L278                IsEmpty]: Start isEmpty. Operand 203 states and 450 transitions.
[2025-04-28 21:21:57,830 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:57,830 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:57,830 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:57,836 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:58,031 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:58,031 INFO  L403      AbstractCegarLoop]: === Iteration 30 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:58,036 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:58,036 INFO  L85        PathProgramCache]: Analyzing trace with hash 1843709408, now seen corresponding path program 1 times
[2025-04-28 21:21:58,036 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:58,037 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219011610]
[2025-04-28 21:21:58,037 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:58,037 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:58,044 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-04-28 21:21:58,048 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:58,051 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:58,051 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:58,136 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:58,136 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:58,136 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219011610]
[2025-04-28 21:21:58,137 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219011610] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:58,137 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2758320]
[2025-04-28 21:21:58,137 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:58,137 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:58,139 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:58,142 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:58,148 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2025-04-28 21:21:58,261 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-04-28 21:21:58,281 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:58,282 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:58,282 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:58,283 INFO  L256         TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:58,284 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:58,320 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:58,320 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
