./chc-comp-wrapper.sh ../../../chc-comp25-benchmarks/ultimate/Lia-NonLinArrays/46_monabsex2_vs_000.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-05-07 17:25:37,341 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-05-07 17:25:37,390 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f5e914d-317d-4dce-a623-fcfe0524cfbe/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-05-07 17:25:37,394 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-05-07 17:25:37,394 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-05-07 17:25:37,411 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-05-07 17:25:37,411 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-05-07 17:25:37,411 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-05-07 17:25:37,412 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-05-07 17:25:37,412 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-05-07 17:25:37,412 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-05-07 17:25:37,412 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-05-07 17:25:37,412 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-05-07 17:25:37,413 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-05-07 17:25:37,413 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-05-07 17:25:37,413 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-05-07 17:25:37,413 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-05-07 17:25:37,413 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-05-07 17:25:37,413 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:25:37,413 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-05-07 17:25:37,413 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-05-07 17:25:37,413 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-05-07 17:25:37,413 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-05-07 17:25:37,414 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-05-07 17:25:37,414 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-05-07 17:25:37,414 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-05-07 17:25:37,414 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-05-07 17:25:37,613 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-05-07 17:25:37,619 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-05-07 17:25:37,621 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-05-07 17:25:37,622 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-05-07 17:25:37,622 INFO  L274        PluginConnector]: SmtParser initialized
[2025-05-07 17:25:37,623 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f5e914d-317d-4dce-a623-fcfe0524cfbe/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/ultimate/Lia-NonLinArrays/46_monabsex2_vs_000.smt2
[2025-05-07 17:25:37,624 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-05-07 17:25:37,626 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-05-07 17:25:37,810 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0f5e914d-317d-4dce-a623-fcfe0524cfbe/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp25-benchmarks/ultimate/Lia-NonLinArrays/46_monabsex2_vs_000.smt2
[2025-05-07 17:25:37,813 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-05-07 17:25:37,814 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-05-07 17:25:37,814 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-05-07 17:25:37,814 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-05-07 17:25:37,814 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-05-07 17:25:37,816 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:25:37" (1/1) ...
[2025-05-07 17:25:37,839 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:37 Unit
[2025-05-07 17:25:37,840 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-05-07 17:25:37,840 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-05-07 17:25:37,840 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-05-07 17:25:37,840 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-05-07 17:25:37,851 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:37" (1/1) ...
[2025-05-07 17:25:37,852 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:37" (1/1) ...
[2025-05-07 17:25:37,868 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:37" (1/1) ...
[2025-05-07 17:25:37,868 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:37" (1/1) ...
[2025-05-07 17:25:37,872 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:37" (1/1) ...
[2025-05-07 17:25:37,873 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:37" (1/1) ...
[2025-05-07 17:25:37,875 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:37" (1/1) ...
[2025-05-07 17:25:37,876 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:37" (1/1) ...
[2025-05-07 17:25:37,877 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:37" (1/1) ...
[2025-05-07 17:25:37,885 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-05-07 17:25:37,885 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-05-07 17:25:37,885 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-05-07 17:25:37,885 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-05-07 17:25:37,886 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:37" (1/1) ...
[2025-05-07 17:25:37,888 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-05-07 17:25:37,896 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:37,905 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-05-07 17:25:37,907 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-05-07 17:25:37,915 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-05-07 17:25:37,915 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-05-07 17:25:37,915 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-05-07 17:25:37,915 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Inv given in one single declaration
[2025-05-07 17:25:37,915 INFO  L130     BoogieDeclarations]: Found specification of procedure Inv
[2025-05-07 17:25:37,915 INFO  L138     BoogieDeclarations]: Found implementation of procedure Inv
[2025-05-07 17:25:37,915 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-05-07 17:25:37,915 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-05-07 17:25:37,915 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-05-07 17:25:37,954 INFO  L234             CfgBuilder]: Building ICFG
[2025-05-07 17:25:37,956 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-05-07 17:25:38,138 INFO  L?                        ?]: Removed 7 outVars from TransFormulas that were not future-live.
[2025-05-07 17:25:38,139 INFO  L283             CfgBuilder]: Performing block encoding
[2025-05-07 17:25:38,147 INFO  L304             CfgBuilder]: Using library mode
[2025-05-07 17:25:38,147 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-05-07 17:25:38,148 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:25:38 BoogieIcfgContainer
[2025-05-07 17:25:38,148 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-05-07 17:25:38,149 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-05-07 17:25:38,150 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-05-07 17:25:38,152 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-05-07 17:25:38,152 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 07.05 05:25:37" (1/3) ...
[2025-05-07 17:25:38,153 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38bfa093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 07.05 05:25:38, skipping insertion in model container
[2025-05-07 17:25:38,153 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 07.05 05:25:37" (2/3) ...
[2025-05-07 17:25:38,153 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38bfa093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.05 05:25:38, skipping insertion in model container
[2025-05-07 17:25:38,153 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.05 05:25:38" (3/3) ...
[2025-05-07 17:25:38,154 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-05-07 17:25:38,164 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-05-07 17:25:38,166 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 3 procedures, 53 locations, 177 edges, 3 initial locations, 0 loop locations, and 1 error locations.
[2025-05-07 17:25:38,201 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-05-07 17:25:38,209 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;@78744eb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-05-07 17:25:38,209 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-05-07 17:25:38,213 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 53 states, 6 states have (on average 7.5) internal successors, (45), 45 states have internal predecessors, (45), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 7 states have call predecessors, (44), 44 states have call successors, (44)
[2025-05-07 17:25:38,235 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 6
[2025-05-07 17:25:38,235 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:38,235 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1]
[2025-05-07 17:25:38,236 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:38,240 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:38,240 INFO  L85        PathProgramCache]: Analyzing trace with hash 304523272, now seen corresponding path program 1 times
[2025-05-07 17:25:38,245 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:38,245 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128103848]
[2025-05-07 17:25:38,246 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:38,246 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:38,259 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes.
[2025-05-07 17:25:38,261 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements.
[2025-05-07 17:25:38,261 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:38,261 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:38,280 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:38,281 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:38,281 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128103848]
[2025-05-07 17:25:38,281 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128103848] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:38,281 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:38,283 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-05-07 17:25:38,284 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022949453]
[2025-05-07 17:25:38,285 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:38,287 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-05-07 17:25:38,287 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:38,305 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-05-07 17:25:38,305 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-05-07 17:25:38,306 INFO  L87              Difference]: Start difference. First operand  has 53 states, 6 states have (on average 7.5) internal successors, (45), 45 states have internal predecessors, (45), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 7 states have call predecessors, (44), 44 states have call successors, (44) Second operand  has 2 states, 2 states have (on average 1.5) internal successors, (3), 1 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2025-05-07 17:25:38,325 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:38,325 INFO  L93              Difference]: Finished difference Result 51 states and 130 transitions.
[2025-05-07 17:25:38,326 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-05-07 17:25:38,327 INFO  L79                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 1.5) internal successors, (3), 1 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 5
[2025-05-07 17:25:38,327 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:38,334 INFO  L225             Difference]: With dead ends: 51
[2025-05-07 17:25:38,334 INFO  L226             Difference]: Without dead ends: 51
[2025-05-07 17:25:38,335 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-05-07 17:25:38,337 INFO  L437           NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:38,337 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-05-07 17:25:38,347 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51 states.
[2025-05-07 17:25:38,364 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51.
[2025-05-07 17:25:38,365 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51 states, 5 states have (on average 8.4) internal successors, (42), 42 states have internal predecessors, (42), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 7 states have call predecessors, (44), 44 states have call successors, (44)
[2025-05-07 17:25:38,369 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 130 transitions.
[2025-05-07 17:25:38,370 INFO  L79                 Accepts]: Start accepts. Automaton has 51 states and 130 transitions. Word has length 5
[2025-05-07 17:25:38,370 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:38,370 INFO  L485      AbstractCegarLoop]: Abstraction has 51 states and 130 transitions.
[2025-05-07 17:25:38,371 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 1.5) internal successors, (3), 1 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2025-05-07 17:25:38,371 INFO  L278                IsEmpty]: Start isEmpty. Operand 51 states and 130 transitions.
[2025-05-07 17:25:38,376 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2025-05-07 17:25:38,376 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:38,376 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:38,376 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-05-07 17:25:38,376 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:38,377 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:38,377 INFO  L85        PathProgramCache]: Analyzing trace with hash -1032360649, now seen corresponding path program 1 times
[2025-05-07 17:25:38,377 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:38,377 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683109117]
[2025-05-07 17:25:38,377 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:38,377 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:38,380 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-05-07 17:25:38,400 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-05-07 17:25:38,400 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:38,400 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:38,459 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-05-07 17:25:38,459 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:38,459 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683109117]
[2025-05-07 17:25:38,459 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683109117] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:38,460 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:38,460 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:38,460 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501529323]
[2025-05-07 17:25:38,460 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:38,461 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:38,461 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:38,462 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:38,462 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:38,462 INFO  L87              Difference]: Start difference. First operand 51 states and 130 transitions. Second operand  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-05-07 17:25:38,963 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:38,964 INFO  L93              Difference]: Finished difference Result 87 states and 274 transitions.
[2025-05-07 17:25:38,964 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:25:38,964 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 9
[2025-05-07 17:25:38,964 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:38,969 INFO  L225             Difference]: With dead ends: 87
[2025-05-07 17:25:38,969 INFO  L226             Difference]: Without dead ends: 87
[2025-05-07 17:25:38,969 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:38,970 INFO  L437           NwaCegarLoop]: 151 mSDtfsCounter, 30 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:38,970 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 334 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-05-07 17:25:38,970 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 87 states.
[2025-05-07 17:25:38,987 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87.
[2025-05-07 17:25:38,987 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 87 states, 7 states have (on average 10.428571428571429) internal successors, (73), 72 states have internal predecessors, (73), 78 states have call successors, (78), 3 states have call predecessors, (78), 3 states have return successors, (123), 12 states have call predecessors, (123), 78 states have call successors, (123)
[2025-05-07 17:25:38,989 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 274 transitions.
[2025-05-07 17:25:38,989 INFO  L79                 Accepts]: Start accepts. Automaton has 87 states and 274 transitions. Word has length 9
[2025-05-07 17:25:38,990 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:38,990 INFO  L485      AbstractCegarLoop]: Abstraction has 87 states and 274 transitions.
[2025-05-07 17:25:38,990 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-05-07 17:25:38,990 INFO  L278                IsEmpty]: Start isEmpty. Operand 87 states and 274 transitions.
[2025-05-07 17:25:38,994 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2025-05-07 17:25:38,995 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:38,995 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:38,995 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-05-07 17:25:38,995 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:38,995 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:38,995 INFO  L85        PathProgramCache]: Analyzing trace with hash -1336175297, now seen corresponding path program 1 times
[2025-05-07 17:25:38,995 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:38,996 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039816835]
[2025-05-07 17:25:38,996 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:38,996 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:38,999 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-05-07 17:25:39,004 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-05-07 17:25:39,005 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:39,005 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:39,042 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:25:39,042 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:39,042 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039816835]
[2025-05-07 17:25:39,042 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039816835] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:25:39,042 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758822463]
[2025-05-07 17:25:39,042 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:39,042 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:39,044 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:39,046 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:25:39,047 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-05-07 17:25:39,077 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-05-07 17:25:39,090 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-05-07 17:25:39,091 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:39,091 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:39,092 INFO  L256         TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-05-07 17:25:39,096 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:25:39,126 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:25:39,126 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:25:39,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-05-07 17:25:39,214 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [758822463] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:25:39,214 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:25:39,214 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5
[2025-05-07 17:25:39,214 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573016425]
[2025-05-07 17:25:39,214 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:25:39,214 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-05-07 17:25:39,214 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:39,215 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-05-07 17:25:39,215 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:39,215 INFO  L87              Difference]: Start difference. First operand 87 states and 274 transitions. Second operand  has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2025-05-07 17:25:40,353 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:40,353 INFO  L93              Difference]: Finished difference Result 239 states and 1146 transitions.
[2025-05-07 17:25:40,353 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:25:40,354 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 12
[2025-05-07 17:25:40,354 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:40,380 INFO  L225             Difference]: With dead ends: 239
[2025-05-07 17:25:40,381 INFO  L226             Difference]: Without dead ends: 239
[2025-05-07 17:25:40,381 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:25:40,382 INFO  L437           NwaCegarLoop]: 285 mSDtfsCounter, 67 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:40,382 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 597 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-05-07 17:25:40,383 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 239 states.
[2025-05-07 17:25:40,458 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 167.
[2025-05-07 17:25:40,458 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 167 states, 11 states have (on average 13.0) internal successors, (143), 140 states have internal predecessors, (143), 154 states have call successors, (154), 5 states have call predecessors, (154), 5 states have return successors, (369), 22 states have call predecessors, (369), 154 states have call successors, (369)
[2025-05-07 17:25:40,462 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 666 transitions.
[2025-05-07 17:25:40,462 INFO  L79                 Accepts]: Start accepts. Automaton has 167 states and 666 transitions. Word has length 12
[2025-05-07 17:25:40,462 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:40,463 INFO  L485      AbstractCegarLoop]: Abstraction has 167 states and 666 transitions.
[2025-05-07 17:25:40,463 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)
[2025-05-07 17:25:40,463 INFO  L278                IsEmpty]: Start isEmpty. Operand 167 states and 666 transitions.
[2025-05-07 17:25:40,468 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2025-05-07 17:25:40,468 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:40,468 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:40,473 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-05-07 17:25:40,669 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:40,670 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:40,671 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:40,672 INFO  L85        PathProgramCache]: Analyzing trace with hash -1795794330, now seen corresponding path program 1 times
[2025-05-07 17:25:40,672 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:40,672 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134792397]
[2025-05-07 17:25:40,673 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:40,673 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:40,687 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-05-07 17:25:40,700 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-05-07 17:25:40,701 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:40,701 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:40,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:25:40,808 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:40,808 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134792397]
[2025-05-07 17:25:40,809 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134792397] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:40,809 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:40,809 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:40,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337877344]
[2025-05-07 17:25:40,809 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:40,810 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:40,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:40,811 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:40,811 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:40,812 INFO  L87              Difference]: Start difference. First operand 167 states and 666 transitions. Second operand  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2025-05-07 17:25:41,144 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:41,144 INFO  L93              Difference]: Finished difference Result 311 states and 1546 transitions.
[2025-05-07 17:25:41,145 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:25:41,145 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 13
[2025-05-07 17:25:41,145 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:41,162 INFO  L225             Difference]: With dead ends: 311
[2025-05-07 17:25:41,162 INFO  L226             Difference]: Without dead ends: 311
[2025-05-07 17:25:41,163 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:41,163 INFO  L437           NwaCegarLoop]: 197 mSDtfsCounter, 30 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:41,163 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 427 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:25:41,164 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 311 states.
[2025-05-07 17:25:41,227 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311.
[2025-05-07 17:25:41,228 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 311 states, 19 states have (on average 14.263157894736842) internal successors, (271), 260 states have internal predecessors, (271), 290 states have call successors, (290), 9 states have call predecessors, (290), 9 states have return successors, (985), 42 states have call predecessors, (985), 290 states have call successors, (985)
[2025-05-07 17:25:41,235 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 1546 transitions.
[2025-05-07 17:25:41,235 INFO  L79                 Accepts]: Start accepts. Automaton has 311 states and 1546 transitions. Word has length 13
[2025-05-07 17:25:41,236 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:41,236 INFO  L485      AbstractCegarLoop]: Abstraction has 311 states and 1546 transitions.
[2025-05-07 17:25:41,236 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2025-05-07 17:25:41,236 INFO  L278                IsEmpty]: Start isEmpty. Operand 311 states and 1546 transitions.
[2025-05-07 17:25:41,244 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2025-05-07 17:25:41,244 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:41,244 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:41,244 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-05-07 17:25:41,244 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:41,245 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:41,245 INFO  L85        PathProgramCache]: Analyzing trace with hash -670142987, now seen corresponding path program 1 times
[2025-05-07 17:25:41,245 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:41,245 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119840755]
[2025-05-07 17:25:41,246 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:41,246 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:41,248 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-05-07 17:25:41,251 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-05-07 17:25:41,252 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:41,252 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:41,282 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:25:41,282 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:41,282 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119840755]
[2025-05-07 17:25:41,282 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119840755] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:41,282 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:41,282 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:41,283 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972683997]
[2025-05-07 17:25:41,283 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:41,283 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:41,283 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:41,283 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:41,283 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:41,284 INFO  L87              Difference]: Start difference. First operand 311 states and 1546 transitions. Second operand  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2025-05-07 17:25:41,652 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:41,652 INFO  L93              Difference]: Finished difference Result 455 states and 2680 transitions.
[2025-05-07 17:25:41,653 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:25:41,653 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 13
[2025-05-07 17:25:41,653 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:41,688 INFO  L225             Difference]: With dead ends: 455
[2025-05-07 17:25:41,688 INFO  L226             Difference]: Without dead ends: 455
[2025-05-07 17:25:41,689 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:41,689 INFO  L437           NwaCegarLoop]: 197 mSDtfsCounter, 30 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:41,689 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 423 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:25:41,690 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 455 states.
[2025-05-07 17:25:41,810 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 455.
[2025-05-07 17:25:41,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 455 states, 27 states have (on average 14.925925925925926) internal successors, (403), 380 states have internal predecessors, (403), 426 states have call successors, (426), 13 states have call predecessors, (426), 13 states have return successors, (1851), 62 states have call predecessors, (1851), 426 states have call successors, (1851)
[2025-05-07 17:25:41,825 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 2680 transitions.
[2025-05-07 17:25:41,825 INFO  L79                 Accepts]: Start accepts. Automaton has 455 states and 2680 transitions. Word has length 13
[2025-05-07 17:25:41,825 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:41,825 INFO  L485      AbstractCegarLoop]: Abstraction has 455 states and 2680 transitions.
[2025-05-07 17:25:41,825 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2025-05-07 17:25:41,825 INFO  L278                IsEmpty]: Start isEmpty. Operand 455 states and 2680 transitions.
[2025-05-07 17:25:41,832 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2025-05-07 17:25:41,832 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:41,832 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:41,832 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-05-07 17:25:41,832 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:41,833 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:41,833 INFO  L85        PathProgramCache]: Analyzing trace with hash 1782365543, now seen corresponding path program 1 times
[2025-05-07 17:25:41,833 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:41,833 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903679210]
[2025-05-07 17:25:41,833 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:41,833 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:41,836 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-05-07 17:25:41,838 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-05-07 17:25:41,838 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:41,839 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:41,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:25:41,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:41,861 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903679210]
[2025-05-07 17:25:41,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903679210] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:41,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:41,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:41,862 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984986152]
[2025-05-07 17:25:41,862 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:41,862 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:41,862 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:41,862 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:41,862 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:41,862 INFO  L87              Difference]: Start difference. First operand 455 states and 2680 transitions. Second operand  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-05-07 17:25:42,379 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:42,379 INFO  L93              Difference]: Finished difference Result 555 states and 5430 transitions.
[2025-05-07 17:25:42,379 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:25:42,379 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 13
[2025-05-07 17:25:42,380 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:42,466 INFO  L225             Difference]: With dead ends: 555
[2025-05-07 17:25:42,466 INFO  L226             Difference]: Without dead ends: 555
[2025-05-07 17:25:42,466 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:42,467 INFO  L437           NwaCegarLoop]: 167 mSDtfsCounter, 31 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:42,467 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 333 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-05-07 17:25:42,468 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 555 states.
[2025-05-07 17:25:42,741 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 527.
[2025-05-07 17:25:42,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 527 states, 31 states have (on average 15.0) internal successors, (465), 440 states have internal predecessors, (465), 494 states have call successors, (494), 15 states have call predecessors, (494), 15 states have return successors, (2229), 72 states have call predecessors, (2229), 494 states have call successors, (2229)
[2025-05-07 17:25:42,758 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 3188 transitions.
[2025-05-07 17:25:42,758 INFO  L79                 Accepts]: Start accepts. Automaton has 527 states and 3188 transitions. Word has length 13
[2025-05-07 17:25:42,759 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:42,759 INFO  L485      AbstractCegarLoop]: Abstraction has 527 states and 3188 transitions.
[2025-05-07 17:25:42,759 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-05-07 17:25:42,759 INFO  L278                IsEmpty]: Start isEmpty. Operand 527 states and 3188 transitions.
[2025-05-07 17:25:42,768 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2025-05-07 17:25:42,768 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:42,768 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:42,768 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-05-07 17:25:42,768 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:42,769 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:42,769 INFO  L85        PathProgramCache]: Analyzing trace with hash 2109274182, now seen corresponding path program 1 times
[2025-05-07 17:25:42,769 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:42,769 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439584066]
[2025-05-07 17:25:42,769 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:42,769 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:42,772 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-05-07 17:25:42,775 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-05-07 17:25:42,775 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:42,775 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:42,800 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-05-07 17:25:42,800 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:42,800 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439584066]
[2025-05-07 17:25:42,800 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439584066] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:42,800 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:42,800 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:42,801 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876905841]
[2025-05-07 17:25:42,801 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:42,801 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:42,801 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:42,801 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:42,801 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:42,801 INFO  L87              Difference]: Start difference. First operand 527 states and 3188 transitions. Second operand  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2025-05-07 17:25:43,107 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:43,107 INFO  L93              Difference]: Finished difference Result 671 states and 4600 transitions.
[2025-05-07 17:25:43,108 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:25:43,108 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 13
[2025-05-07 17:25:43,108 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:43,156 INFO  L225             Difference]: With dead ends: 671
[2025-05-07 17:25:43,157 INFO  L226             Difference]: Without dead ends: 671
[2025-05-07 17:25:43,157 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:43,157 INFO  L437           NwaCegarLoop]: 197 mSDtfsCounter, 30 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:43,157 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 421 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:25:43,158 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 671 states.
[2025-05-07 17:25:43,396 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671.
[2025-05-07 17:25:43,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 671 states, 39 states have (on average 15.35897435897436) internal successors, (599), 560 states have internal predecessors, (599), 630 states have call successors, (630), 19 states have call predecessors, (630), 19 states have return successors, (3371), 92 states have call predecessors, (3371), 630 states have call successors, (3371)
[2025-05-07 17:25:43,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 4600 transitions.
[2025-05-07 17:25:43,429 INFO  L79                 Accepts]: Start accepts. Automaton has 671 states and 4600 transitions. Word has length 13
[2025-05-07 17:25:43,429 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:43,429 INFO  L485      AbstractCegarLoop]: Abstraction has 671 states and 4600 transitions.
[2025-05-07 17:25:43,430 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2025-05-07 17:25:43,430 INFO  L278                IsEmpty]: Start isEmpty. Operand 671 states and 4600 transitions.
[2025-05-07 17:25:43,451 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-05-07 17:25:43,451 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:43,451 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:43,451 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-05-07 17:25:43,451 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:43,452 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:43,452 INFO  L85        PathProgramCache]: Analyzing trace with hash -1394885105, now seen corresponding path program 1 times
[2025-05-07 17:25:43,452 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:43,452 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858845223]
[2025-05-07 17:25:43,452 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:43,452 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:43,456 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:25:43,460 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:25:43,460 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:43,461 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:43,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:25:43,504 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:43,504 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858845223]
[2025-05-07 17:25:43,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858845223] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:25:43,504 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329250877]
[2025-05-07 17:25:43,504 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:43,504 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:43,507 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:43,509 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:25:43,510 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-05-07 17:25:43,544 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-05-07 17:25:43,560 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-05-07 17:25:43,560 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:43,560 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:43,561 INFO  L256         TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-05-07 17:25:43,562 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:25:43,575 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:25:43,575 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:25:43,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:25:43,685 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [329250877] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:25:43,685 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:25:43,685 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6
[2025-05-07 17:25:43,685 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593139391]
[2025-05-07 17:25:43,685 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:25:43,685 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:25:43,686 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:43,686 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:25:43,686 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:25:43,686 INFO  L87              Difference]: Start difference. First operand 671 states and 4600 transitions. Second operand  has 6 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:25:45,687 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:45,687 INFO  L93              Difference]: Finished difference Result 743 states and 10665 transitions.
[2025-05-07 17:25:45,688 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-05-07 17:25:45,688 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 16
[2025-05-07 17:25:45,688 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:45,800 INFO  L225             Difference]: With dead ends: 743
[2025-05-07 17:25:45,800 INFO  L226             Difference]: Without dead ends: 743
[2025-05-07 17:25:45,800 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:25:45,801 INFO  L437           NwaCegarLoop]: 230 mSDtfsCounter, 107 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 534 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:45,801 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 441 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [534 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time]
[2025-05-07 17:25:45,802 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 743 states.
[2025-05-07 17:25:46,253 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 599.
[2025-05-07 17:25:46,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 599 states, 35 states have (on average 15.342857142857143) internal successors, (537), 500 states have internal predecessors, (537), 562 states have call successors, (562), 17 states have call predecessors, (562), 17 states have return successors, (2751), 82 states have call predecessors, (2751), 562 states have call successors, (2751)
[2025-05-07 17:25:46,282 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 3850 transitions.
[2025-05-07 17:25:46,282 INFO  L79                 Accepts]: Start accepts. Automaton has 599 states and 3850 transitions. Word has length 16
[2025-05-07 17:25:46,282 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:46,282 INFO  L485      AbstractCegarLoop]: Abstraction has 599 states and 3850 transitions.
[2025-05-07 17:25:46,283 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:25:46,283 INFO  L278                IsEmpty]: Start isEmpty. Operand 599 states and 3850 transitions.
[2025-05-07 17:25:46,292 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-05-07 17:25:46,292 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:46,292 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:46,296 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-05-07 17:25:46,493 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:46,493 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:46,496 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:46,497 INFO  L85        PathProgramCache]: Analyzing trace with hash 2099408539, now seen corresponding path program 1 times
[2025-05-07 17:25:46,497 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:46,497 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694376597]
[2025-05-07 17:25:46,497 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:46,497 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:46,505 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-05-07 17:25:46,512 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-05-07 17:25:46,513 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:46,513 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:46,599 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:25:46,600 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:46,600 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694376597]
[2025-05-07 17:25:46,600 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694376597] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:46,601 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:46,601 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:46,601 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030999546]
[2025-05-07 17:25:46,601 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:46,602 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:46,602 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:46,603 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:46,604 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:46,604 INFO  L87              Difference]: Start difference. First operand 599 states and 3850 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:25:47,198 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:47,198 INFO  L93              Difference]: Finished difference Result 783 states and 9406 transitions.
[2025-05-07 17:25:47,198 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:25:47,199 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 17
[2025-05-07 17:25:47,199 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:47,325 INFO  L225             Difference]: With dead ends: 783
[2025-05-07 17:25:47,325 INFO  L226             Difference]: Without dead ends: 783
[2025-05-07 17:25:47,325 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:47,325 INFO  L437           NwaCegarLoop]: 243 mSDtfsCounter, 30 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:47,326 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 493 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-05-07 17:25:47,326 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 783 states.
[2025-05-07 17:25:47,734 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 743.
[2025-05-07 17:25:47,737 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 743 states, 43 states have (on average 15.372093023255815) internal successors, (661), 620 states have internal predecessors, (661), 698 states have call successors, (698), 21 states have call predecessors, (698), 21 states have return successors, (4014), 102 states have call predecessors, (4014), 698 states have call successors, (4014)
[2025-05-07 17:25:47,784 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 5373 transitions.
[2025-05-07 17:25:47,784 INFO  L79                 Accepts]: Start accepts. Automaton has 743 states and 5373 transitions. Word has length 17
[2025-05-07 17:25:47,784 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:47,784 INFO  L485      AbstractCegarLoop]: Abstraction has 743 states and 5373 transitions.
[2025-05-07 17:25:47,784 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:25:47,784 INFO  L278                IsEmpty]: Start isEmpty. Operand 743 states and 5373 transitions.
[2025-05-07 17:25:47,800 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-05-07 17:25:47,800 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:47,800 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:47,800 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-05-07 17:25:47,800 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:47,801 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:47,801 INFO  L85        PathProgramCache]: Analyzing trace with hash -1658427210, now seen corresponding path program 1 times
[2025-05-07 17:25:47,801 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:47,801 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237906793]
[2025-05-07 17:25:47,801 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:47,801 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:47,805 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-05-07 17:25:47,807 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-05-07 17:25:47,807 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:47,808 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:47,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-05-07 17:25:47,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:47,829 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237906793]
[2025-05-07 17:25:47,829 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237906793] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:47,829 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:47,829 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:47,829 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261596965]
[2025-05-07 17:25:47,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:47,829 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:47,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:47,830 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:47,830 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:47,830 INFO  L87              Difference]: Start difference. First operand 743 states and 5373 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:25:48,372 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:48,373 INFO  L93              Difference]: Finished difference Result 935 states and 10464 transitions.
[2025-05-07 17:25:48,373 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:25:48,373 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 17
[2025-05-07 17:25:48,373 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:48,494 INFO  L225             Difference]: With dead ends: 935
[2025-05-07 17:25:48,494 INFO  L226             Difference]: Without dead ends: 935
[2025-05-07 17:25:48,494 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:48,494 INFO  L437           NwaCegarLoop]: 168 mSDtfsCounter, 31 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:48,494 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 331 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-05-07 17:25:48,495 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 935 states.
[2025-05-07 17:25:48,885 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 887.
[2025-05-07 17:25:48,888 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 887 states, 51 states have (on average 15.235294117647058) internal successors, (777), 740 states have internal predecessors, (777), 834 states have call successors, (834), 25 states have call predecessors, (834), 25 states have return successors, (4415), 122 states have call predecessors, (4415), 834 states have call successors, (4415)
[2025-05-07 17:25:48,915 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 6026 transitions.
[2025-05-07 17:25:48,915 INFO  L79                 Accepts]: Start accepts. Automaton has 887 states and 6026 transitions. Word has length 17
[2025-05-07 17:25:48,915 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:48,915 INFO  L485      AbstractCegarLoop]: Abstraction has 887 states and 6026 transitions.
[2025-05-07 17:25:48,916 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-05-07 17:25:48,916 INFO  L278                IsEmpty]: Start isEmpty. Operand 887 states and 6026 transitions.
[2025-05-07 17:25:48,932 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-05-07 17:25:48,932 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:48,932 INFO  L218           NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:48,933 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-05-07 17:25:48,933 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:48,933 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:48,933 INFO  L85        PathProgramCache]: Analyzing trace with hash -340311233, now seen corresponding path program 1 times
[2025-05-07 17:25:48,933 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:48,933 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102130756]
[2025-05-07 17:25:48,933 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:48,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:48,936 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-05-07 17:25:48,938 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-05-07 17:25:48,938 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:48,938 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:48,952 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-05-07 17:25:48,953 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:48,953 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102130756]
[2025-05-07 17:25:48,953 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102130756] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:48,953 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:48,953 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:48,953 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475541824]
[2025-05-07 17:25:48,953 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:48,953 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:48,953 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:48,954 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:48,954 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:48,954 INFO  L87              Difference]: Start difference. First operand 887 states and 6026 transitions. Second operand  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2025-05-07 17:25:49,415 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:49,415 INFO  L93              Difference]: Finished difference Result 1011 states and 11586 transitions.
[2025-05-07 17:25:49,416 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:25:49,416 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 19
[2025-05-07 17:25:49,416 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:49,554 INFO  L225             Difference]: With dead ends: 1011
[2025-05-07 17:25:49,554 INFO  L226             Difference]: Without dead ends: 1011
[2025-05-07 17:25:49,555 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:49,555 INFO  L437           NwaCegarLoop]: 176 mSDtfsCounter, 31 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:49,555 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 411 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-05-07 17:25:49,556 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1011 states.
[2025-05-07 17:25:50,060 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 959.
[2025-05-07 17:25:50,064 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 959 states, 55 states have (on average 15.254545454545454) internal successors, (839), 800 states have internal predecessors, (839), 902 states have call successors, (902), 27 states have call predecessors, (902), 27 states have return successors, (4910), 132 states have call predecessors, (4910), 902 states have call successors, (4910)
[2025-05-07 17:25:50,104 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 6651 transitions.
[2025-05-07 17:25:50,104 INFO  L79                 Accepts]: Start accepts. Automaton has 959 states and 6651 transitions. Word has length 19
[2025-05-07 17:25:50,104 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:50,104 INFO  L485      AbstractCegarLoop]: Abstraction has 959 states and 6651 transitions.
[2025-05-07 17:25:50,104 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2025-05-07 17:25:50,104 INFO  L278                IsEmpty]: Start isEmpty. Operand 959 states and 6651 transitions.
[2025-05-07 17:25:50,127 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2025-05-07 17:25:50,127 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:50,127 INFO  L218           NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:50,127 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-05-07 17:25:50,127 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:50,128 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:50,128 INFO  L85        PathProgramCache]: Analyzing trace with hash 712853812, now seen corresponding path program 1 times
[2025-05-07 17:25:50,128 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:50,128 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660422752]
[2025-05-07 17:25:50,128 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:50,128 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:50,132 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-05-07 17:25:50,134 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-05-07 17:25:50,134 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:50,134 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:50,155 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-05-07 17:25:50,155 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:50,155 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660422752]
[2025-05-07 17:25:50,155 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660422752] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:50,155 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:50,155 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:50,156 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396678497]
[2025-05-07 17:25:50,156 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:50,156 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:50,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:50,156 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:50,156 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:50,156 INFO  L87              Difference]: Start difference. First operand 959 states and 6651 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5)
[2025-05-07 17:25:50,537 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:50,537 INFO  L93              Difference]: Finished difference Result 1259 states and 17660 transitions.
[2025-05-07 17:25:50,537 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:25:50,537 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 21
[2025-05-07 17:25:50,537 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:50,768 INFO  L225             Difference]: With dead ends: 1259
[2025-05-07 17:25:50,769 INFO  L226             Difference]: Without dead ends: 1259
[2025-05-07 17:25:50,769 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:50,769 INFO  L437           NwaCegarLoop]: 164 mSDtfsCounter, 10 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:50,769 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 337 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:25:50,770 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1259 states.
[2025-05-07 17:25:51,477 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1207.
[2025-05-07 17:25:51,482 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1207 states, 107 states have (on average 9.037383177570094) internal successors, (967), 892 states have internal predecessors, (967), 1098 states have call successors, (1098), 53 states have call predecessors, (1098), 53 states have return successors, (10660), 262 states have call predecessors, (10660), 1098 states have call successors, (10660)
[2025-05-07 17:25:51,547 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 12725 transitions.
[2025-05-07 17:25:51,547 INFO  L79                 Accepts]: Start accepts. Automaton has 1207 states and 12725 transitions. Word has length 21
[2025-05-07 17:25:51,548 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:51,548 INFO  L485      AbstractCegarLoop]: Abstraction has 1207 states and 12725 transitions.
[2025-05-07 17:25:51,548 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5)
[2025-05-07 17:25:51,548 INFO  L278                IsEmpty]: Start isEmpty. Operand 1207 states and 12725 transitions.
[2025-05-07 17:25:51,568 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 23
[2025-05-07 17:25:51,568 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:51,569 INFO  L218           NwaCegarLoop]: trace histogram [5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:51,569 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-05-07 17:25:51,569 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:51,569 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:51,569 INFO  L85        PathProgramCache]: Analyzing trace with hash -1140210577, now seen corresponding path program 2 times
[2025-05-07 17:25:51,569 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:51,569 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85173811]
[2025-05-07 17:25:51,569 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:25:51,570 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:51,573 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes.
[2025-05-07 17:25:51,576 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements.
[2025-05-07 17:25:51,576 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:25:51,576 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:51,603 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-05-07 17:25:51,603 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:51,603 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85173811]
[2025-05-07 17:25:51,603 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85173811] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:25:51,603 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322151881]
[2025-05-07 17:25:51,603 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-05-07 17:25:51,604 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:51,606 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:25:51,607 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:25:51,608 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-05-07 17:25:51,640 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes.
[2025-05-07 17:25:51,662 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements.
[2025-05-07 17:25:51,662 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-05-07 17:25:51,662 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:51,663 INFO  L256         TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-05-07 17:25:51,664 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:25:51,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-05-07 17:25:51,681 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:25:51,846 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked.
[2025-05-07 17:25:51,846 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322151881] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:25:51,846 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:25:51,846 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6
[2025-05-07 17:25:51,846 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909147685]
[2025-05-07 17:25:51,846 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:25:51,846 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:25:51,847 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:51,847 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:25:51,847 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:25:51,847 INFO  L87              Difference]: Start difference. First operand 1207 states and 12725 transitions. Second operand  has 6 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7)
[2025-05-07 17:25:53,268 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:53,268 INFO  L93              Difference]: Finished difference Result 2347 states and 30177 transitions.
[2025-05-07 17:25:53,269 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-05-07 17:25:53,269 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 22
[2025-05-07 17:25:53,269 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:53,781 INFO  L225             Difference]: With dead ends: 2347
[2025-05-07 17:25:53,781 INFO  L226             Difference]: Without dead ends: 2347
[2025-05-07 17:25:53,781 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-05-07 17:25:53,782 INFO  L437           NwaCegarLoop]: 335 mSDtfsCounter, 68 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 1275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:53,782 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 773 Invalid, 1275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-05-07 17:25:53,783 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2347 states.
[2025-05-07 17:25:55,112 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 2347.
[2025-05-07 17:25:55,123 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2347 states, 207 states have (on average 9.03864734299517) internal successors, (1871), 1732 states have internal predecessors, (1871), 2138 states have call successors, (2138), 103 states have call predecessors, (2138), 103 states have return successors, (26168), 512 states have call predecessors, (26168), 2138 states have call successors, (26168)
[2025-05-07 17:25:55,313 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 30177 transitions.
[2025-05-07 17:25:55,313 INFO  L79                 Accepts]: Start accepts. Automaton has 2347 states and 30177 transitions. Word has length 22
[2025-05-07 17:25:55,313 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:55,313 INFO  L485      AbstractCegarLoop]: Abstraction has 2347 states and 30177 transitions.
[2025-05-07 17:25:55,313 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7)
[2025-05-07 17:25:55,313 INFO  L278                IsEmpty]: Start isEmpty. Operand 2347 states and 30177 transitions.
[2025-05-07 17:25:55,343 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-05-07 17:25:55,343 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:55,343 INFO  L218           NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:55,347 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-05-07 17:25:55,544 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:25:55,544 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:55,545 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:55,545 INFO  L85        PathProgramCache]: Analyzing trace with hash 585337736, now seen corresponding path program 1 times
[2025-05-07 17:25:55,545 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:55,545 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653900657]
[2025-05-07 17:25:55,546 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:55,546 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:55,549 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-05-07 17:25:55,551 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-05-07 17:25:55,551 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:55,552 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:55,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-05-07 17:25:55,570 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:55,570 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653900657]
[2025-05-07 17:25:55,570 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653900657] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:55,570 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:55,570 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:55,570 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82655925]
[2025-05-07 17:25:55,571 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:55,571 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:55,571 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:55,571 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:55,571 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:55,571 INFO  L87              Difference]: Start difference. First operand 2347 states and 30177 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-05-07 17:25:56,403 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:25:56,403 INFO  L93              Difference]: Finished difference Result 2461 states and 43278 transitions.
[2025-05-07 17:25:56,403 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:25:56,403 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 24
[2025-05-07 17:25:56,404 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:25:57,065 INFO  L225             Difference]: With dead ends: 2461
[2025-05-07 17:25:57,065 INFO  L226             Difference]: Without dead ends: 2461
[2025-05-07 17:25:57,065 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:25:57,066 INFO  L437           NwaCegarLoop]: 239 mSDtfsCounter, 30 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:25:57,066 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 479 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-05-07 17:25:57,067 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2461 states.
[2025-05-07 17:25:59,106 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2347.
[2025-05-07 17:25:59,123 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2347 states, 207 states have (on average 9.03864734299517) internal successors, (1871), 1732 states have internal predecessors, (1871), 2138 states have call successors, (2138), 103 states have call predecessors, (2138), 103 states have return successors, (26078), 512 states have call predecessors, (26078), 2138 states have call successors, (26078)
[2025-05-07 17:25:59,315 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 30087 transitions.
[2025-05-07 17:25:59,315 INFO  L79                 Accepts]: Start accepts. Automaton has 2347 states and 30087 transitions. Word has length 24
[2025-05-07 17:25:59,316 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:25:59,316 INFO  L485      AbstractCegarLoop]: Abstraction has 2347 states and 30087 transitions.
[2025-05-07 17:25:59,316 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-05-07 17:25:59,316 INFO  L278                IsEmpty]: Start isEmpty. Operand 2347 states and 30087 transitions.
[2025-05-07 17:25:59,348 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-05-07 17:25:59,348 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:25:59,348 INFO  L218           NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:25:59,348 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-05-07 17:25:59,348 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:25:59,349 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:25:59,349 INFO  L85        PathProgramCache]: Analyzing trace with hash 142061974, now seen corresponding path program 1 times
[2025-05-07 17:25:59,349 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:25:59,349 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483090786]
[2025-05-07 17:25:59,349 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:25:59,349 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:25:59,355 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-05-07 17:25:59,359 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-05-07 17:25:59,359 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:25:59,360 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:25:59,384 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-05-07 17:25:59,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:25:59,384 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483090786]
[2025-05-07 17:25:59,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483090786] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:25:59,384 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:25:59,384 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:25:59,384 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217388121]
[2025-05-07 17:25:59,384 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:25:59,384 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:25:59,384 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:25:59,385 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:25:59,385 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:25:59,385 INFO  L87              Difference]: Start difference. First operand 2347 states and 30087 transitions. Second operand  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2025-05-07 17:26:00,332 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:00,332 INFO  L93              Difference]: Finished difference Result 3031 states and 77284 transitions.
[2025-05-07 17:26:00,333 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:26:00,333 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 25
[2025-05-07 17:26:00,333 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:01,809 INFO  L225             Difference]: With dead ends: 3031
[2025-05-07 17:26:01,809 INFO  L226             Difference]: Without dead ends: 3031
[2025-05-07 17:26:01,810 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:26:01,810 INFO  L437           NwaCegarLoop]: 159 mSDtfsCounter, 10 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:01,810 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 294 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:26:01,811 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3031 states.
[2025-05-07 17:26:05,383 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3031 to 2827.
[2025-05-07 17:26:05,397 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2827 states, 309 states have (on average 9.475728155339805) internal successors, (2928), 1906 states have internal predecessors, (2928), 2516 states have call successors, (2516), 154 states have call predecessors, (2516), 154 states have return successors, (45150), 767 states have call predecessors, (45150), 2516 states have call successors, (45150)
[2025-05-07 17:26:05,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 50594 transitions.
[2025-05-07 17:26:05,753 INFO  L79                 Accepts]: Start accepts. Automaton has 2827 states and 50594 transitions. Word has length 25
[2025-05-07 17:26:05,754 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:05,754 INFO  L485      AbstractCegarLoop]: Abstraction has 2827 states and 50594 transitions.
[2025-05-07 17:26:05,754 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2025-05-07 17:26:05,754 INFO  L278                IsEmpty]: Start isEmpty. Operand 2827 states and 50594 transitions.
[2025-05-07 17:26:05,799 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-05-07 17:26:05,799 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:05,799 INFO  L218           NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:05,800 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-05-07 17:26:05,800 INFO  L403      AbstractCegarLoop]: === Iteration 16 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:05,800 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:05,801 INFO  L85        PathProgramCache]: Analyzing trace with hash 2128214994, now seen corresponding path program 1 times
[2025-05-07 17:26:05,801 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:05,801 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691772649]
[2025-05-07 17:26:05,801 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:05,801 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:05,804 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-05-07 17:26:05,808 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-05-07 17:26:05,808 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:05,808 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:05,829 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-05-07 17:26:05,829 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:05,829 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691772649]
[2025-05-07 17:26:05,829 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691772649] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:05,829 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:05,829 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:05,829 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274373147]
[2025-05-07 17:26:05,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:05,830 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:05,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:05,830 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:05,830 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:05,830 INFO  L87              Difference]: Start difference. First operand 2827 states and 50594 transitions. Second operand  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2025-05-07 17:26:07,182 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:07,182 INFO  L93              Difference]: Finished difference Result 3511 states and 106489 transitions.
[2025-05-07 17:26:07,183 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:26:07,183 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 25
[2025-05-07 17:26:07,183 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:09,791 INFO  L225             Difference]: With dead ends: 3511
[2025-05-07 17:26:09,791 INFO  L226             Difference]: Without dead ends: 3511
[2025-05-07 17:26:09,791 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:26:09,792 INFO  L437           NwaCegarLoop]: 156 mSDtfsCounter, 10 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:09,792 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 280 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-05-07 17:26:09,793 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3511 states.
[2025-05-07 17:26:14,577 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 3307.
[2025-05-07 17:26:14,598 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3307 states, 411 states have (on average 10.19221411192214) internal successors, (4189), 2080 states have internal predecessors, (4189), 2894 states have call successors, (2894), 205 states have call predecessors, (2894), 205 states have return successors, (68469), 1022 states have call predecessors, (68469), 2894 states have call successors, (68469)
[2025-05-07 17:26:15,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 75552 transitions.
[2025-05-07 17:26:15,225 INFO  L79                 Accepts]: Start accepts. Automaton has 3307 states and 75552 transitions. Word has length 25
[2025-05-07 17:26:15,225 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:15,225 INFO  L485      AbstractCegarLoop]: Abstraction has 3307 states and 75552 transitions.
[2025-05-07 17:26:15,225 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2025-05-07 17:26:15,225 INFO  L278                IsEmpty]: Start isEmpty. Operand 3307 states and 75552 transitions.
[2025-05-07 17:26:15,287 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2025-05-07 17:26:15,287 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:15,287 INFO  L218           NwaCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:15,287 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-05-07 17:26:15,288 INFO  L403      AbstractCegarLoop]: === Iteration 17 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:15,288 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:15,288 INFO  L85        PathProgramCache]: Analyzing trace with hash -2060603538, now seen corresponding path program 1 times
[2025-05-07 17:26:15,288 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:15,288 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004080363]
[2025-05-07 17:26:15,288 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:15,289 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:15,292 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes.
[2025-05-07 17:26:15,294 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements.
[2025-05-07 17:26:15,294 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:15,294 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:15,312 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-05-07 17:26:15,312 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:15,312 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004080363]
[2025-05-07 17:26:15,312 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004080363] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:15,313 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:15,313 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:15,313 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735779753]
[2025-05-07 17:26:15,313 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:15,313 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:15,313 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:15,314 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:15,314 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:15,314 INFO  L87              Difference]: Start difference. First operand 3307 states and 75552 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:26:17,217 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:17,218 INFO  L93              Difference]: Finished difference Result 3991 states and 140043 transitions.
[2025-05-07 17:26:17,218 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:26:17,218 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 23
[2025-05-07 17:26:17,218 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:21,402 INFO  L225             Difference]: With dead ends: 3991
[2025-05-07 17:26:21,402 INFO  L226             Difference]: Without dead ends: 3991
[2025-05-07 17:26:21,403 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:26:21,403 INFO  L437           NwaCegarLoop]: 157 mSDtfsCounter, 10 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:21,403 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 278 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-05-07 17:26:21,404 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3991 states.
[2025-05-07 17:26:28,003 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3991 to 3787.
[2025-05-07 17:26:28,028 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3787 states, 513 states have (on average 10.82261208576998) internal successors, (5552), 2254 states have internal predecessors, (5552), 3272 states have call successors, (3272), 256 states have call predecessors, (3272), 256 states have return successors, (96035), 1277 states have call predecessors, (96035), 3272 states have call successors, (96035)
[2025-05-07 17:26:28,992 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3787 states to 3787 states and 104859 transitions.
[2025-05-07 17:26:28,992 INFO  L79                 Accepts]: Start accepts. Automaton has 3787 states and 104859 transitions. Word has length 23
[2025-05-07 17:26:28,992 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:28,992 INFO  L485      AbstractCegarLoop]: Abstraction has 3787 states and 104859 transitions.
[2025-05-07 17:26:28,993 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:26:28,993 INFO  L278                IsEmpty]: Start isEmpty. Operand 3787 states and 104859 transitions.
[2025-05-07 17:26:29,071 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2025-05-07 17:26:29,071 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:29,071 INFO  L218           NwaCegarLoop]: trace histogram [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:29,071 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-05-07 17:26:29,071 INFO  L403      AbstractCegarLoop]: === Iteration 18 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:29,072 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:29,072 INFO  L85        PathProgramCache]: Analyzing trace with hash -1243798407, now seen corresponding path program 1 times
[2025-05-07 17:26:29,072 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:29,072 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521829342]
[2025-05-07 17:26:29,072 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:29,072 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:29,075 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes.
[2025-05-07 17:26:29,077 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements.
[2025-05-07 17:26:29,077 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:29,077 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:29,092 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2025-05-07 17:26:29,092 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:29,092 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521829342]
[2025-05-07 17:26:29,092 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521829342] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:29,092 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:29,093 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:29,093 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154625186]
[2025-05-07 17:26:29,093 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:29,093 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:29,093 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:29,093 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:29,093 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:29,093 INFO  L87              Difference]: Start difference. First operand 3787 states and 104859 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:26:31,710 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:31,710 INFO  L93              Difference]: Finished difference Result 4879 states and 208738 transitions.
[2025-05-07 17:26:31,711 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:26:31,711 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 23
[2025-05-07 17:26:31,711 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:37,894 INFO  L225             Difference]: With dead ends: 4879
[2025-05-07 17:26:37,894 INFO  L226             Difference]: Without dead ends: 4879
[2025-05-07 17:26:37,894 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:26:37,895 INFO  L437           NwaCegarLoop]: 184 mSDtfsCounter, 10 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:37,895 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 333 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-05-07 17:26:37,896 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4879 states.
[2025-05-07 17:26:47,032 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 4343.
[2025-05-07 17:26:47,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4343 states, 653 states have (on average 9.240428790199081) internal successors, (6034), 2466 states have internal predecessors, (6034), 3650 states have call successors, (3650), 307 states have call predecessors, (3650), 345 states have return successors, (111419), 1570 states have call predecessors, (111419), 3650 states have call successors, (111419)
[2025-05-07 17:26:48,237 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 121103 transitions.
[2025-05-07 17:26:48,237 INFO  L79                 Accepts]: Start accepts. Automaton has 4343 states and 121103 transitions. Word has length 23
[2025-05-07 17:26:48,237 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:26:48,237 INFO  L485      AbstractCegarLoop]: Abstraction has 4343 states and 121103 transitions.
[2025-05-07 17:26:48,238 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-05-07 17:26:48,238 INFO  L278                IsEmpty]: Start isEmpty. Operand 4343 states and 121103 transitions.
[2025-05-07 17:26:48,313 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-05-07 17:26:48,313 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:26:48,313 INFO  L218           NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:26:48,313 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-05-07 17:26:48,313 INFO  L403      AbstractCegarLoop]: === Iteration 19 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:26:48,314 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:26:48,314 INFO  L85        PathProgramCache]: Analyzing trace with hash 1589688973, now seen corresponding path program 1 times
[2025-05-07 17:26:48,314 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:26:48,314 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135196017]
[2025-05-07 17:26:48,314 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:26:48,314 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:26:48,318 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes.
[2025-05-07 17:26:48,321 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements.
[2025-05-07 17:26:48,321 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:26:48,321 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:26:48,339 INFO  L134       CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked.
[2025-05-07 17:26:48,339 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:26:48,339 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135196017]
[2025-05-07 17:26:48,339 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135196017] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:26:48,339 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:26:48,339 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:26:48,339 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704298986]
[2025-05-07 17:26:48,339 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:26:48,339 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:26:48,340 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:26:48,340 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:26:48,340 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:48,340 INFO  L87              Difference]: Start difference. First operand 4343 states and 121103 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6)
[2025-05-07 17:26:49,992 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:26:49,992 INFO  L93              Difference]: Finished difference Result 4445 states and 132539 transitions.
[2025-05-07 17:26:49,992 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:26:49,992 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 25
[2025-05-07 17:26:49,992 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:26:54,319 INFO  L225             Difference]: With dead ends: 4445
[2025-05-07 17:26:54,319 INFO  L226             Difference]: Without dead ends: 4445
[2025-05-07 17:26:54,319 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:26:54,320 INFO  L437           NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:26:54,320 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 370 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:26:54,322 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4445 states.
[2025-05-07 17:27:00,021 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4445 to 4343.
[2025-05-07 17:27:00,054 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4343 states, 653 states have (on average 9.240428790199081) internal successors, (6034), 2466 states have internal predecessors, (6034), 3650 states have call successors, (3650), 307 states have call predecessors, (3650), 345 states have return successors, (111041), 1570 states have call predecessors, (111041), 3650 states have call successors, (111041)
[2025-05-07 17:27:01,220 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 120725 transitions.
[2025-05-07 17:27:01,221 INFO  L79                 Accepts]: Start accepts. Automaton has 4343 states and 120725 transitions. Word has length 25
[2025-05-07 17:27:01,221 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:01,221 INFO  L485      AbstractCegarLoop]: Abstraction has 4343 states and 120725 transitions.
[2025-05-07 17:27:01,221 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6)
[2025-05-07 17:27:01,221 INFO  L278                IsEmpty]: Start isEmpty. Operand 4343 states and 120725 transitions.
[2025-05-07 17:27:01,329 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2025-05-07 17:27:01,329 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:01,329 INFO  L218           NwaCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:01,329 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-05-07 17:27:01,329 INFO  L403      AbstractCegarLoop]: === Iteration 20 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:01,329 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:01,330 INFO  L85        PathProgramCache]: Analyzing trace with hash 600436678, now seen corresponding path program 1 times
[2025-05-07 17:27:01,330 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:01,330 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486557308]
[2025-05-07 17:27:01,330 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:01,330 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:01,333 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-05-07 17:27:01,335 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-05-07 17:27:01,335 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:01,335 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:01,351 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2025-05-07 17:27:01,351 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:01,351 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486557308]
[2025-05-07 17:27:01,351 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486557308] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:01,351 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:01,351 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:27:01,352 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447731145]
[2025-05-07 17:27:01,352 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:01,352 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:27:01,352 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:01,352 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:27:01,352 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:01,352 INFO  L87              Difference]: Start difference. First operand 4343 states and 120725 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-05-07 17:27:03,842 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:03,842 INFO  L93              Difference]: Finished difference Result 4879 states and 205060 transitions.
[2025-05-07 17:27:03,843 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:27:03,843 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 26
[2025-05-07 17:27:03,843 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:09,869 INFO  L225             Difference]: With dead ends: 4879
[2025-05-07 17:27:09,869 INFO  L226             Difference]: Without dead ends: 4879
[2025-05-07 17:27:09,870 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:27:09,870 INFO  L437           NwaCegarLoop]: 239 mSDtfsCounter, 30 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:09,870 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 462 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-05-07 17:27:09,872 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4879 states.
[2025-05-07 17:27:18,966 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 4343.
[2025-05-07 17:27:18,992 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4343 states, 653 states have (on average 9.240428790199081) internal successors, (6034), 2466 states have internal predecessors, (6034), 3650 states have call successors, (3650), 307 states have call predecessors, (3650), 345 states have return successors, (109426), 1570 states have call predecessors, (109426), 3650 states have call successors, (109426)
[2025-05-07 17:27:20,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 119110 transitions.
[2025-05-07 17:27:20,087 INFO  L79                 Accepts]: Start accepts. Automaton has 4343 states and 119110 transitions. Word has length 26
[2025-05-07 17:27:20,088 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:20,088 INFO  L485      AbstractCegarLoop]: Abstraction has 4343 states and 119110 transitions.
[2025-05-07 17:27:20,088 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6)
[2025-05-07 17:27:20,088 INFO  L278                IsEmpty]: Start isEmpty. Operand 4343 states and 119110 transitions.
[2025-05-07 17:27:20,153 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2025-05-07 17:27:20,153 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:20,153 INFO  L218           NwaCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:20,153 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-05-07 17:27:20,153 INFO  L403      AbstractCegarLoop]: === Iteration 21 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:20,154 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:20,154 INFO  L85        PathProgramCache]: Analyzing trace with hash 773930303, now seen corresponding path program 1 times
[2025-05-07 17:27:20,154 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:20,154 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926529881]
[2025-05-07 17:27:20,154 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:20,154 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:20,157 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-05-07 17:27:20,160 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-05-07 17:27:20,160 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:20,160 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:20,185 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-05-07 17:27:20,185 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:20,185 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926529881]
[2025-05-07 17:27:20,186 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926529881] provided 0 perfect and 1 imperfect interpolant sequences
[2025-05-07 17:27:20,186 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379054552]
[2025-05-07 17:27:20,186 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:20,186 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-05-07 17:27:20,190 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-05-07 17:27:20,192 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-05-07 17:27:20,193 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-05-07 17:27:20,230 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-05-07 17:27:20,257 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-05-07 17:27:20,257 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:20,257 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:20,258 INFO  L256         TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-05-07 17:27:20,261 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-05-07 17:27:20,278 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-05-07 17:27:20,278 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-05-07 17:27:20,492 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked.
[2025-05-07 17:27:20,492 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379054552] provided 0 perfect and 2 imperfect interpolant sequences
[2025-05-07 17:27:20,493 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-05-07 17:27:20,493 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6
[2025-05-07 17:27:20,493 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202096740]
[2025-05-07 17:27:20,493 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-05-07 17:27:20,493 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-05-07 17:27:20,493 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:20,493 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-05-07 17:27:20,494 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-05-07 17:27:20,494 INFO  L87              Difference]: Start difference. First operand 4343 states and 119110 transitions. Second operand  has 6 states, 4 states have (on average 2.75) internal successors, (11), 6 states have internal predecessors, (11), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8)
[2025-05-07 17:27:25,063 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:25,063 INFO  L93              Difference]: Finished difference Result 4787 states and 198375 transitions.
[2025-05-07 17:27:25,064 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2025-05-07 17:27:25,064 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.75) internal successors, (11), 6 states have internal predecessors, (11), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 26
[2025-05-07 17:27:25,064 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:30,664 INFO  L225             Difference]: With dead ends: 4787
[2025-05-07 17:27:30,664 INFO  L226             Difference]: Without dead ends: 4620
[2025-05-07 17:27:30,664 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156
[2025-05-07 17:27:30,665 INFO  L437           NwaCegarLoop]: 385 mSDtfsCounter, 70 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 2574 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 2746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 2574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:30,665 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 922 Invalid, 2746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 2574 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time]
[2025-05-07 17:27:30,666 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4620 states.
[2025-05-07 17:27:40,738 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4620 to 3960.
[2025-05-07 17:27:40,766 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3960 states, 582 states have (on average 10.037800687285223) internal successors, (5842), 2308 states have internal predecessors, (5842), 3349 states have call successors, (3349), 293 states have call predecessors, (3349), 304 states have return successors, (87996), 1359 states have call predecessors, (87996), 3349 states have call successors, (87996)
[2025-05-07 17:27:41,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 97187 transitions.
[2025-05-07 17:27:41,670 INFO  L79                 Accepts]: Start accepts. Automaton has 3960 states and 97187 transitions. Word has length 26
[2025-05-07 17:27:41,670 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:41,670 INFO  L485      AbstractCegarLoop]: Abstraction has 3960 states and 97187 transitions.
[2025-05-07 17:27:41,670 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.75) internal successors, (11), 6 states have internal predecessors, (11), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8)
[2025-05-07 17:27:41,670 INFO  L278                IsEmpty]: Start isEmpty. Operand 3960 states and 97187 transitions.
[2025-05-07 17:27:41,716 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-05-07 17:27:41,716 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:41,716 INFO  L218           NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:41,721 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-05-07 17:27:41,917 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2025-05-07 17:27:41,918 INFO  L403      AbstractCegarLoop]: === Iteration 22 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:41,928 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:41,929 INFO  L85        PathProgramCache]: Analyzing trace with hash 1727888981, now seen corresponding path program 1 times
[2025-05-07 17:27:41,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:41,929 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158316528]
[2025-05-07 17:27:41,929 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:41,930 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:41,945 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-05-07 17:27:41,954 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-05-07 17:27:41,954 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:41,955 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:41,980 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-05-07 17:27:41,980 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:41,981 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158316528]
[2025-05-07 17:27:41,981 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158316528] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:41,981 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:41,981 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:27:41,981 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652089087]
[2025-05-07 17:27:41,981 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:41,981 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:27:41,981 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:41,982 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:27:41,982 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:41,982 INFO  L87              Difference]: Start difference. First operand 3960 states and 97187 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2025-05-07 17:27:43,310 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:43,310 INFO  L93              Difference]: Finished difference Result 4062 states and 108141 transitions.
[2025-05-07 17:27:43,311 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:27:43,311 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 27
[2025-05-07 17:27:43,311 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:46,400 INFO  L225             Difference]: With dead ends: 4062
[2025-05-07 17:27:46,400 INFO  L226             Difference]: Without dead ends: 4062
[2025-05-07 17:27:46,400 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:46,403 INFO  L437           NwaCegarLoop]: 166 mSDtfsCounter, 10 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:46,403 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 345 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:27:46,404 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4062 states.
[2025-05-07 17:27:51,514 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 3960.
[2025-05-07 17:27:51,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3960 states, 582 states have (on average 10.037800687285223) internal successors, (5842), 2308 states have internal predecessors, (5842), 3349 states have call successors, (3349), 293 states have call predecessors, (3349), 304 states have return successors, (87721), 1359 states have call predecessors, (87721), 3349 states have call successors, (87721)
[2025-05-07 17:27:52,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 96912 transitions.
[2025-05-07 17:27:52,411 INFO  L79                 Accepts]: Start accepts. Automaton has 3960 states and 96912 transitions. Word has length 27
[2025-05-07 17:27:52,411 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:27:52,411 INFO  L485      AbstractCegarLoop]: Abstraction has 3960 states and 96912 transitions.
[2025-05-07 17:27:52,411 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2025-05-07 17:27:52,412 INFO  L278                IsEmpty]: Start isEmpty. Operand 3960 states and 96912 transitions.
[2025-05-07 17:27:52,465 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-05-07 17:27:52,466 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:27:52,466 INFO  L218           NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:27:52,466 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-05-07 17:27:52,466 INFO  L403      AbstractCegarLoop]: === Iteration 23 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:27:52,466 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:27:52,466 INFO  L85        PathProgramCache]: Analyzing trace with hash -618336725, now seen corresponding path program 1 times
[2025-05-07 17:27:52,466 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:27:52,466 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190594490]
[2025-05-07 17:27:52,466 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:27:52,467 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:27:52,470 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes.
[2025-05-07 17:27:52,472 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements.
[2025-05-07 17:27:52,472 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:27:52,472 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:27:52,490 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-05-07 17:27:52,490 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:27:52,490 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190594490]
[2025-05-07 17:27:52,490 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190594490] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:27:52,490 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:27:52,490 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:27:52,490 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800550688]
[2025-05-07 17:27:52,490 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:27:52,490 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:27:52,490 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:27:52,491 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:27:52,491 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:52,491 INFO  L87              Difference]: Start difference. First operand 3960 states and 96912 transitions. Second operand  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7)
[2025-05-07 17:27:53,814 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:27:53,815 INFO  L93              Difference]: Finished difference Result 4062 states and 107866 transitions.
[2025-05-07 17:27:53,815 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:27:53,815 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 29
[2025-05-07 17:27:53,815 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:27:57,209 INFO  L225             Difference]: With dead ends: 4062
[2025-05-07 17:27:57,209 INFO  L226             Difference]: Without dead ends: 4062
[2025-05-07 17:27:57,209 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:27:57,210 INFO  L437           NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:27:57,210 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 329 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:27:57,212 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4062 states.
[2025-05-07 17:28:02,741 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 3960.
[2025-05-07 17:28:02,768 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3960 states, 582 states have (on average 10.037800687285223) internal successors, (5842), 2308 states have internal predecessors, (5842), 3349 states have call successors, (3349), 293 states have call predecessors, (3349), 304 states have return successors, (87446), 1359 states have call predecessors, (87446), 3349 states have call successors, (87446)
[2025-05-07 17:28:03,627 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 96637 transitions.
[2025-05-07 17:28:03,627 INFO  L79                 Accepts]: Start accepts. Automaton has 3960 states and 96637 transitions. Word has length 29
[2025-05-07 17:28:03,627 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:03,627 INFO  L485      AbstractCegarLoop]: Abstraction has 3960 states and 96637 transitions.
[2025-05-07 17:28:03,627 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7)
[2025-05-07 17:28:03,627 INFO  L278                IsEmpty]: Start isEmpty. Operand 3960 states and 96637 transitions.
[2025-05-07 17:28:03,667 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-05-07 17:28:03,667 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:03,667 INFO  L218           NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:03,668 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-05-07 17:28:03,668 INFO  L403      AbstractCegarLoop]: === Iteration 24 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:03,668 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:03,668 INFO  L85        PathProgramCache]: Analyzing trace with hash 1170709831, now seen corresponding path program 1 times
[2025-05-07 17:28:03,668 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:03,668 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740883050]
[2025-05-07 17:28:03,668 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:03,668 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:03,671 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-05-07 17:28:03,673 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-05-07 17:28:03,673 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:03,673 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:03,687 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-05-07 17:28:03,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:03,687 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740883050]
[2025-05-07 17:28:03,687 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740883050] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:03,687 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:03,687 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:03,687 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495622623]
[2025-05-07 17:28:03,688 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:03,688 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:03,688 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:03,688 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:03,688 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:03,688 INFO  L87              Difference]: Start difference. First operand 3960 states and 96637 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2025-05-07 17:28:05,710 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:05,710 INFO  L93              Difference]: Finished difference Result 5230 states and 181324 transitions.
[2025-05-07 17:28:05,711 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:28:05,711 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 27
[2025-05-07 17:28:05,711 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:12,671 INFO  L225             Difference]: With dead ends: 5230
[2025-05-07 17:28:12,671 INFO  L226             Difference]: Without dead ends: 5230
[2025-05-07 17:28:12,671 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:28:12,671 INFO  L437           NwaCegarLoop]: 178 mSDtfsCounter, 10 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:12,672 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 382 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:28:12,674 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5230 states.
[2025-05-07 17:28:20,905 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5230 to 4734.
[2025-05-07 17:28:20,936 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4734 states, 795 states have (on average 8.40125786163522) internal successors, (6679), 2665 states have internal predecessors, (6679), 3901 states have call successors, (3901), 395 states have call predecessors, (3901), 415 states have return successors, (103099), 1674 states have call predecessors, (103099), 3901 states have call successors, (103099)
[2025-05-07 17:28:21,864 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4734 states to 4734 states and 113679 transitions.
[2025-05-07 17:28:21,864 INFO  L79                 Accepts]: Start accepts. Automaton has 4734 states and 113679 transitions. Word has length 27
[2025-05-07 17:28:21,864 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:21,864 INFO  L485      AbstractCegarLoop]: Abstraction has 4734 states and 113679 transitions.
[2025-05-07 17:28:21,864 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2025-05-07 17:28:21,864 INFO  L278                IsEmpty]: Start isEmpty. Operand 4734 states and 113679 transitions.
[2025-05-07 17:28:21,899 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-05-07 17:28:21,899 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:21,900 INFO  L218           NwaCegarLoop]: trace histogram [6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:21,900 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-05-07 17:28:21,900 INFO  L403      AbstractCegarLoop]: === Iteration 25 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:21,900 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:21,900 INFO  L85        PathProgramCache]: Analyzing trace with hash -1687291909, now seen corresponding path program 1 times
[2025-05-07 17:28:21,900 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:21,900 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644738313]
[2025-05-07 17:28:21,900 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:21,901 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:21,904 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-05-07 17:28:21,906 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-05-07 17:28:21,906 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:21,906 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:21,921 INFO  L134       CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked.
[2025-05-07 17:28:21,921 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:21,921 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644738313]
[2025-05-07 17:28:21,921 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644738313] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:21,921 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:21,921 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:21,921 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68629360]
[2025-05-07 17:28:21,921 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:21,921 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:21,921 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:21,922 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:21,922 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:21,922 INFO  L87              Difference]: Start difference. First operand 4734 states and 113679 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6)
[2025-05-07 17:28:23,584 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:23,584 INFO  L93              Difference]: Finished difference Result 5040 states and 152666 transitions.
[2025-05-07 17:28:23,585 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:28:23,585 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 27
[2025-05-07 17:28:23,585 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:29,452 INFO  L225             Difference]: With dead ends: 5040
[2025-05-07 17:28:29,452 INFO  L226             Difference]: Without dead ends: 5040
[2025-05-07 17:28:29,452 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:29,452 INFO  L437           NwaCegarLoop]: 145 mSDtfsCounter, 3 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:29,452 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 314 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:28:29,455 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5040 states.
[2025-05-07 17:28:36,393 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5040 to 4734.
[2025-05-07 17:28:36,423 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4734 states, 795 states have (on average 8.40125786163522) internal successors, (6679), 2665 states have internal predecessors, (6679), 3901 states have call successors, (3901), 395 states have call predecessors, (3901), 415 states have return successors, (102507), 1674 states have call predecessors, (102507), 3901 states have call successors, (102507)
[2025-05-07 17:28:37,338 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4734 states to 4734 states and 113087 transitions.
[2025-05-07 17:28:37,338 INFO  L79                 Accepts]: Start accepts. Automaton has 4734 states and 113087 transitions. Word has length 27
[2025-05-07 17:28:37,338 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:37,339 INFO  L485      AbstractCegarLoop]: Abstraction has 4734 states and 113087 transitions.
[2025-05-07 17:28:37,339 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6)
[2025-05-07 17:28:37,339 INFO  L278                IsEmpty]: Start isEmpty. Operand 4734 states and 113087 transitions.
[2025-05-07 17:28:37,377 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-05-07 17:28:37,377 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:37,377 INFO  L218           NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:37,377 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-05-07 17:28:37,377 INFO  L403      AbstractCegarLoop]: === Iteration 26 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:37,377 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:37,378 INFO  L85        PathProgramCache]: Analyzing trace with hash 1937827959, now seen corresponding path program 1 times
[2025-05-07 17:28:37,378 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:37,378 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814649072]
[2025-05-07 17:28:37,378 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:37,378 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:37,382 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-05-07 17:28:37,384 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-05-07 17:28:37,384 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:37,384 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:37,402 INFO  L134       CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked.
[2025-05-07 17:28:37,402 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:37,402 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814649072]
[2025-05-07 17:28:37,402 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814649072] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:37,402 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:37,402 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:37,402 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406050760]
[2025-05-07 17:28:37,402 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:37,403 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:37,403 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:37,403 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:37,403 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:37,403 INFO  L87              Difference]: Start difference. First operand 4734 states and 113087 transitions. Second operand  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8)
[2025-05-07 17:28:39,247 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:39,247 INFO  L93              Difference]: Finished difference Result 5040 states and 151566 transitions.
[2025-05-07 17:28:39,248 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:28:39,248 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 33
[2025-05-07 17:28:39,249 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:28:45,106 INFO  L225             Difference]: With dead ends: 5040
[2025-05-07 17:28:45,106 INFO  L226             Difference]: Without dead ends: 5040
[2025-05-07 17:28:45,106 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:28:45,107 INFO  L437           NwaCegarLoop]: 163 mSDtfsCounter, 10 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:28:45,107 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 300 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:28:45,110 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5040 states.
[2025-05-07 17:28:51,812 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5040 to 4734.
[2025-05-07 17:28:51,843 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4734 states, 795 states have (on average 8.40125786163522) internal successors, (6679), 2665 states have internal predecessors, (6679), 3901 states have call successors, (3901), 395 states have call predecessors, (3901), 415 states have return successors, (101957), 1674 states have call predecessors, (101957), 3901 states have call successors, (101957)
[2025-05-07 17:28:52,855 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4734 states to 4734 states and 112537 transitions.
[2025-05-07 17:28:52,855 INFO  L79                 Accepts]: Start accepts. Automaton has 4734 states and 112537 transitions. Word has length 33
[2025-05-07 17:28:52,855 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:28:52,855 INFO  L485      AbstractCegarLoop]: Abstraction has 4734 states and 112537 transitions.
[2025-05-07 17:28:52,856 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8)
[2025-05-07 17:28:52,856 INFO  L278                IsEmpty]: Start isEmpty. Operand 4734 states and 112537 transitions.
[2025-05-07 17:28:52,890 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2025-05-07 17:28:52,890 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:28:52,890 INFO  L218           NwaCegarLoop]: trace histogram [7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:28:52,890 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-05-07 17:28:52,890 INFO  L403      AbstractCegarLoop]: === Iteration 27 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:28:52,890 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:28:52,891 INFO  L85        PathProgramCache]: Analyzing trace with hash -1701781223, now seen corresponding path program 1 times
[2025-05-07 17:28:52,891 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:28:52,891 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926804001]
[2025-05-07 17:28:52,891 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:28:52,891 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:28:52,894 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-05-07 17:28:52,896 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-05-07 17:28:52,896 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:28:52,896 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:28:52,911 INFO  L134       CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked.
[2025-05-07 17:28:52,911 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:28:52,911 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926804001]
[2025-05-07 17:28:52,911 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926804001] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:28:52,911 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:28:52,912 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:28:52,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973899678]
[2025-05-07 17:28:52,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:28:52,912 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:28:52,912 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:28:52,912 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:28:52,912 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:28:52,913 INFO  L87              Difference]: Start difference. First operand 4734 states and 112537 transitions. Second operand  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7)
[2025-05-07 17:28:54,931 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:28:54,931 INFO  L93              Difference]: Finished difference Result 5932 states and 161986 transitions.
[2025-05-07 17:28:54,932 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:28:54,932 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 31
[2025-05-07 17:28:54,932 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:00,825 INFO  L225             Difference]: With dead ends: 5932
[2025-05-07 17:29:00,825 INFO  L226             Difference]: Without dead ends: 5932
[2025-05-07 17:29:00,825 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:29:00,826 INFO  L437           NwaCegarLoop]: 167 mSDtfsCounter, 10 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:00,826 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 300 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:29:00,828 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5932 states.
[2025-05-07 17:29:07,092 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5932 to 5370.
[2025-05-07 17:29:07,120 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5370 states, 975 states have (on average 6.2153846153846155) internal successors, (6060), 2917 states have internal predecessors, (6060), 4279 states have call successors, (4279), 446 states have call predecessors, (4279), 544 states have return successors, (91112), 2007 states have call predecessors, (91112), 4279 states have call successors, (91112)
[2025-05-07 17:29:07,974 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5370 states to 5370 states and 101451 transitions.
[2025-05-07 17:29:07,974 INFO  L79                 Accepts]: Start accepts. Automaton has 5370 states and 101451 transitions. Word has length 31
[2025-05-07 17:29:07,974 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:07,974 INFO  L485      AbstractCegarLoop]: Abstraction has 5370 states and 101451 transitions.
[2025-05-07 17:29:07,975 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7)
[2025-05-07 17:29:07,975 INFO  L278                IsEmpty]: Start isEmpty. Operand 5370 states and 101451 transitions.
[2025-05-07 17:29:08,084 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2025-05-07 17:29:08,084 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:08,084 INFO  L218           NwaCegarLoop]: trace histogram [7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:08,084 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-05-07 17:29:08,084 INFO  L403      AbstractCegarLoop]: === Iteration 28 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:08,085 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:08,085 INFO  L85        PathProgramCache]: Analyzing trace with hash -856688815, now seen corresponding path program 1 times
[2025-05-07 17:29:08,085 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:08,085 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363538619]
[2025-05-07 17:29:08,085 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:08,085 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:08,088 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-05-07 17:29:08,090 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-05-07 17:29:08,090 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:08,090 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:08,106 INFO  L134       CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked.
[2025-05-07 17:29:08,106 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:08,106 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363538619]
[2025-05-07 17:29:08,106 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363538619] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:08,106 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:08,106 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:08,106 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875939285]
[2025-05-07 17:29:08,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:08,106 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:08,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:08,106 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:08,106 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:08,106 INFO  L87              Difference]: Start difference. First operand 5370 states and 101451 transitions. Second operand  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7)
[2025-05-07 17:29:10,136 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:10,137 INFO  L93              Difference]: Finished difference Result 6156 states and 157203 transitions.
[2025-05-07 17:29:10,137 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:29:10,137 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 31
[2025-05-07 17:29:10,138 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:16,632 INFO  L225             Difference]: With dead ends: 6156
[2025-05-07 17:29:16,632 INFO  L226             Difference]: Without dead ends: 6156
[2025-05-07 17:29:16,632 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:29:16,633 INFO  L437           NwaCegarLoop]: 134 mSDtfsCounter, 10 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:16,633 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 235 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:29:16,635 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6156 states.
[2025-05-07 17:29:22,971 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6156 to 5850.
[2025-05-07 17:29:23,006 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5850 states, 1077 states have (on average 6.702878365831012) internal successors, (7219), 3091 states have internal predecessors, (7219), 4657 states have call successors, (4657), 497 states have call predecessors, (4657), 595 states have return successors, (111248), 2262 states have call predecessors, (111248), 4657 states have call successors, (111248)
[2025-05-07 17:29:24,115 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 123124 transitions.
[2025-05-07 17:29:24,115 INFO  L79                 Accepts]: Start accepts. Automaton has 5850 states and 123124 transitions. Word has length 31
[2025-05-07 17:29:24,115 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:24,116 INFO  L485      AbstractCegarLoop]: Abstraction has 5850 states and 123124 transitions.
[2025-05-07 17:29:24,116 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7)
[2025-05-07 17:29:24,116 INFO  L278                IsEmpty]: Start isEmpty. Operand 5850 states and 123124 transitions.
[2025-05-07 17:29:24,150 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-05-07 17:29:24,150 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:24,150 INFO  L218           NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:24,150 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-05-07 17:29:24,150 INFO  L403      AbstractCegarLoop]: === Iteration 29 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:24,151 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:24,151 INFO  L85        PathProgramCache]: Analyzing trace with hash -991822812, now seen corresponding path program 1 times
[2025-05-07 17:29:24,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:24,151 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036567403]
[2025-05-07 17:29:24,151 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:24,151 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:24,155 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes.
[2025-05-07 17:29:24,157 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-05-07 17:29:24,157 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:24,157 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:24,174 INFO  L134       CoverageAnalysis]: Checked inductivity of 63 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked.
[2025-05-07 17:29:24,174 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:24,174 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036567403]
[2025-05-07 17:29:24,174 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036567403] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:24,174 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:24,174 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:24,174 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409800253]
[2025-05-07 17:29:24,174 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:24,175 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:24,175 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:24,175 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:24,175 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:24,175 INFO  L87              Difference]: Start difference. First operand 5850 states and 123124 transitions. Second operand  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8)
[2025-05-07 17:29:26,313 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:26,313 INFO  L93              Difference]: Finished difference Result 6360 states and 181347 transitions.
[2025-05-07 17:29:26,314 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:29:26,314 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 33
[2025-05-07 17:29:26,314 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:32,663 INFO  L225             Difference]: With dead ends: 6360
[2025-05-07 17:29:32,663 INFO  L226             Difference]: Without dead ends: 6360
[2025-05-07 17:29:32,663 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:32,663 INFO  L437           NwaCegarLoop]: 146 mSDtfsCounter, 3 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:32,663 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 314 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:29:32,666 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6360 states.
[2025-05-07 17:29:40,175 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6360 to 5850.
[2025-05-07 17:29:40,209 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5850 states, 1077 states have (on average 6.702878365831012) internal successors, (7219), 3091 states have internal predecessors, (7219), 4657 states have call successors, (4657), 497 states have call predecessors, (4657), 595 states have return successors, (110656), 2262 states have call predecessors, (110656), 4657 states have call successors, (110656)
[2025-05-07 17:29:41,299 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 122532 transitions.
[2025-05-07 17:29:41,299 INFO  L79                 Accepts]: Start accepts. Automaton has 5850 states and 122532 transitions. Word has length 33
[2025-05-07 17:29:41,299 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:41,299 INFO  L485      AbstractCegarLoop]: Abstraction has 5850 states and 122532 transitions.
[2025-05-07 17:29:41,299 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8)
[2025-05-07 17:29:41,299 INFO  L278                IsEmpty]: Start isEmpty. Operand 5850 states and 122532 transitions.
[2025-05-07 17:29:41,338 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-05-07 17:29:41,338 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:41,338 INFO  L218           NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:29:41,338 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-05-07 17:29:41,338 INFO  L403      AbstractCegarLoop]: === Iteration 30 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:41,339 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:41,339 INFO  L85        PathProgramCache]: Analyzing trace with hash -1131734266, now seen corresponding path program 1 times
[2025-05-07 17:29:41,339 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:41,339 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800140096]
[2025-05-07 17:29:41,339 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:41,339 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:41,343 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes.
[2025-05-07 17:29:41,346 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements.
[2025-05-07 17:29:41,346 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:41,346 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:41,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked.
[2025-05-07 17:29:41,364 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:41,364 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800140096]
[2025-05-07 17:29:41,364 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800140096] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:41,364 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:41,364 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:41,364 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849988154]
[2025-05-07 17:29:41,364 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:41,364 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:41,365 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:41,365 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:41,365 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:41,365 INFO  L87              Difference]: Start difference. First operand 5850 states and 122532 transitions. Second operand  has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:29:43,579 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:29:43,579 INFO  L93              Difference]: Finished difference Result 6360 states and 180247 transitions.
[2025-05-07 17:29:43,580 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:29:43,580 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 37
[2025-05-07 17:29:43,580 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:29:50,759 INFO  L225             Difference]: With dead ends: 6360
[2025-05-07 17:29:50,759 INFO  L226             Difference]: Without dead ends: 6360
[2025-05-07 17:29:50,759 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:29:50,759 INFO  L437           NwaCegarLoop]: 154 mSDtfsCounter, 10 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:29:50,759 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 279 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:29:50,762 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6360 states.
[2025-05-07 17:29:57,675 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6360 to 5850.
[2025-05-07 17:29:57,710 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5850 states, 1077 states have (on average 6.702878365831012) internal successors, (7219), 3091 states have internal predecessors, (7219), 4657 states have call successors, (4657), 497 states have call predecessors, (4657), 595 states have return successors, (110106), 2262 states have call predecessors, (110106), 4657 states have call successors, (110106)
[2025-05-07 17:29:58,799 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 121982 transitions.
[2025-05-07 17:29:58,799 INFO  L79                 Accepts]: Start accepts. Automaton has 5850 states and 121982 transitions. Word has length 37
[2025-05-07 17:29:58,800 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:29:58,800 INFO  L485      AbstractCegarLoop]: Abstraction has 5850 states and 121982 transitions.
[2025-05-07 17:29:58,800 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:29:58,800 INFO  L278                IsEmpty]: Start isEmpty. Operand 5850 states and 121982 transitions.
[2025-05-07 17:29:58,844 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2025-05-07 17:29:58,844 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:29:58,844 INFO  L218           NwaCegarLoop]: trace histogram [8, 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]
[2025-05-07 17:29:58,844 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2025-05-07 17:29:58,844 INFO  L403      AbstractCegarLoop]: === Iteration 31 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:29:58,845 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:29:58,845 INFO  L85        PathProgramCache]: Analyzing trace with hash -630272544, now seen corresponding path program 1 times
[2025-05-07 17:29:58,845 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:29:58,845 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853106288]
[2025-05-07 17:29:58,845 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:29:58,845 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:29:58,849 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-05-07 17:29:58,851 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-05-07 17:29:58,851 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:29:58,851 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:29:58,865 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked.
[2025-05-07 17:29:58,865 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:29:58,866 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853106288]
[2025-05-07 17:29:58,866 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853106288] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:29:58,866 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:29:58,866 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:29:58,866 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131519203]
[2025-05-07 17:29:58,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:29:58,866 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:29:58,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:29:58,866 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:29:58,867 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:29:58,867 INFO  L87              Difference]: Start difference. First operand 5850 states and 121982 transitions. Second operand  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8)
[2025-05-07 17:30:01,341 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:01,341 INFO  L93              Difference]: Finished difference Result 7252 states and 207057 transitions.
[2025-05-07 17:30:01,342 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-05-07 17:30:01,342 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 35
[2025-05-07 17:30:01,342 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:09,341 INFO  L225             Difference]: With dead ends: 7252
[2025-05-07 17:30:09,341 INFO  L226             Difference]: Without dead ends: 7252
[2025-05-07 17:30:09,341 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-05-07 17:30:09,341 INFO  L437           NwaCegarLoop]: 163 mSDtfsCounter, 10 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:09,341 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 286 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:30:09,344 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7252 states.
[2025-05-07 17:30:16,864 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7252 to 6486.
[2025-05-07 17:30:16,900 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6486 states, 1257 states have (on average 5.3317422434367545) internal successors, (6702), 3343 states have internal predecessors, (6702), 5035 states have call successors, (5035), 548 states have call predecessors, (5035), 724 states have return successors, (113812), 2595 states have call predecessors, (113812), 5035 states have call successors, (113812)
[2025-05-07 17:30:17,998 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6486 states to 6486 states and 125549 transitions.
[2025-05-07 17:30:17,998 INFO  L79                 Accepts]: Start accepts. Automaton has 6486 states and 125549 transitions. Word has length 35
[2025-05-07 17:30:17,998 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:17,999 INFO  L485      AbstractCegarLoop]: Abstraction has 6486 states and 125549 transitions.
[2025-05-07 17:30:17,999 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 3 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8)
[2025-05-07 17:30:17,999 INFO  L278                IsEmpty]: Start isEmpty. Operand 6486 states and 125549 transitions.
[2025-05-07 17:30:18,035 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2025-05-07 17:30:18,035 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:18,035 INFO  L218           NwaCegarLoop]: trace histogram [8, 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]
[2025-05-07 17:30:18,035 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2025-05-07 17:30:18,035 INFO  L403      AbstractCegarLoop]: === Iteration 32 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:18,036 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:18,036 INFO  L85        PathProgramCache]: Analyzing trace with hash -1297447692, now seen corresponding path program 1 times
[2025-05-07 17:30:18,036 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:18,036 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351657289]
[2025-05-07 17:30:18,036 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:18,036 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:18,040 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-05-07 17:30:18,043 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-05-07 17:30:18,043 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:18,043 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:18,058 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked.
[2025-05-07 17:30:18,058 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:18,058 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351657289]
[2025-05-07 17:30:18,058 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351657289] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:30:18,058 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:30:18,058 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:30:18,058 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595246388]
[2025-05-07 17:30:18,058 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:30:18,058 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:30:18,058 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:18,059 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:30:18,059 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:18,059 INFO  L87              Difference]: Start difference. First operand 6486 states and 125549 transitions. Second operand  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8)
[2025-05-07 17:30:20,175 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:20,175 INFO  L93              Difference]: Finished difference Result 7098 states and 186087 transitions.
[2025-05-07 17:30:20,176 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:30:20,176 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 35
[2025-05-07 17:30:20,176 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:26,230 INFO  L225             Difference]: With dead ends: 7098
[2025-05-07 17:30:26,230 INFO  L226             Difference]: Without dead ends: 7098
[2025-05-07 17:30:26,230 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:26,231 INFO  L437           NwaCegarLoop]: 146 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:26,231 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 313 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:30:26,237 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7098 states.
[2025-05-07 17:30:32,776 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7098 to 6486.
[2025-05-07 17:30:32,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6486 states, 1257 states have (on average 5.3317422434367545) internal successors, (6702), 3343 states have internal predecessors, (6702), 5035 states have call successors, (5035), 548 states have call predecessors, (5035), 724 states have return successors, (113516), 2595 states have call predecessors, (113516), 5035 states have call successors, (113516)
[2025-05-07 17:30:33,910 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6486 states to 6486 states and 125253 transitions.
[2025-05-07 17:30:33,910 INFO  L79                 Accepts]: Start accepts. Automaton has 6486 states and 125253 transitions. Word has length 35
[2025-05-07 17:30:33,910 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:33,910 INFO  L485      AbstractCegarLoop]: Abstraction has 6486 states and 125253 transitions.
[2025-05-07 17:30:33,910 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8)
[2025-05-07 17:30:33,911 INFO  L278                IsEmpty]: Start isEmpty. Operand 6486 states and 125253 transitions.
[2025-05-07 17:30:33,947 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:30:33,947 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:33,947 INFO  L218           NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:30:33,947 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2025-05-07 17:30:33,947 INFO  L403      AbstractCegarLoop]: === Iteration 33 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:33,947 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:33,947 INFO  L85        PathProgramCache]: Analyzing trace with hash 1416835824, now seen corresponding path program 1 times
[2025-05-07 17:30:33,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:33,947 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223209208]
[2025-05-07 17:30:33,947 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:33,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:33,952 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:30:33,955 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:30:33,955 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:33,955 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:33,971 INFO  L134       CoverageAnalysis]: Checked inductivity of 108 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked.
[2025-05-07 17:30:33,971 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:33,972 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223209208]
[2025-05-07 17:30:33,972 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223209208] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:30:33,972 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:30:33,972 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:30:33,972 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487557695]
[2025-05-07 17:30:33,972 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:30:33,972 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:30:33,972 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:33,973 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:30:33,973 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:33,973 INFO  L87              Difference]: Start difference. First operand 6486 states and 125253 transitions. Second operand  has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10)
[2025-05-07 17:30:35,876 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:35,876 INFO  L93              Difference]: Finished difference Result 6894 states and 170984 transitions.
[2025-05-07 17:30:35,876 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:30:35,877 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 41
[2025-05-07 17:30:35,877 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:42,448 INFO  L225             Difference]: With dead ends: 6894
[2025-05-07 17:30:42,448 INFO  L226             Difference]: Without dead ends: 6894
[2025-05-07 17:30:42,448 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:42,448 INFO  L437           NwaCegarLoop]: 153 mSDtfsCounter, 3 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:42,448 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 364 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:30:42,451 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6894 states.
[2025-05-07 17:30:48,226 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6894 to 6486.
[2025-05-07 17:30:48,262 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6486 states, 1257 states have (on average 5.3317422434367545) internal successors, (6702), 3343 states have internal predecessors, (6702), 5035 states have call successors, (5035), 548 states have call predecessors, (5035), 724 states have return successors, (112628), 2595 states have call predecessors, (112628), 5035 states have call successors, (112628)
[2025-05-07 17:30:49,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6486 states to 6486 states and 124365 transitions.
[2025-05-07 17:30:49,349 INFO  L79                 Accepts]: Start accepts. Automaton has 6486 states and 124365 transitions. Word has length 41
[2025-05-07 17:30:49,349 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:30:49,349 INFO  L485      AbstractCegarLoop]: Abstraction has 6486 states and 124365 transitions.
[2025-05-07 17:30:49,349 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (10), 1 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10)
[2025-05-07 17:30:49,349 INFO  L278                IsEmpty]: Start isEmpty. Operand 6486 states and 124365 transitions.
[2025-05-07 17:30:49,386 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2025-05-07 17:30:49,386 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:30:49,386 INFO  L218           NwaCegarLoop]: trace histogram [9, 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]
[2025-05-07 17:30:49,386 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2025-05-07 17:30:49,386 INFO  L403      AbstractCegarLoop]: === Iteration 34 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:30:49,387 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:30:49,387 INFO  L85        PathProgramCache]: Analyzing trace with hash 385980021, now seen corresponding path program 1 times
[2025-05-07 17:30:49,387 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:30:49,387 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100568148]
[2025-05-07 17:30:49,387 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:30:49,387 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:30:49,391 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-05-07 17:30:49,394 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-05-07 17:30:49,394 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:30:49,394 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:30:49,410 INFO  L134       CoverageAnalysis]: Checked inductivity of 108 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-05-07 17:30:49,411 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:30:49,411 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100568148]
[2025-05-07 17:30:49,411 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100568148] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:30:49,411 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:30:49,411 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:30:49,411 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027827969]
[2025-05-07 17:30:49,411 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:30:49,411 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:30:49,411 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:30:49,412 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:30:49,412 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:49,412 INFO  L87              Difference]: Start difference. First operand 6486 states and 124365 transitions. Second operand  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:30:51,769 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:30:51,769 INFO  L93              Difference]: Finished difference Result 7578 states and 205486 transitions.
[2025-05-07 17:30:51,770 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:30:51,770 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 39
[2025-05-07 17:30:51,770 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:30:59,197 INFO  L225             Difference]: With dead ends: 7578
[2025-05-07 17:30:59,197 INFO  L226             Difference]: Without dead ends: 7578
[2025-05-07 17:30:59,198 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:30:59,198 INFO  L437           NwaCegarLoop]: 166 mSDtfsCounter, 10 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:30:59,198 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 325 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:30:59,200 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7578 states.
[2025-05-07 17:31:06,735 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7578 to 6966.
[2025-05-07 17:31:06,777 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6966 states, 1359 states have (on average 5.371596762325239) internal successors, (7300), 3517 states have internal predecessors, (7300), 5413 states have call successors, (5413), 599 states have call predecessors, (5413), 775 states have return successors, (131939), 2850 states have call predecessors, (131939), 5413 states have call successors, (131939)
[2025-05-07 17:31:08,096 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 144652 transitions.
[2025-05-07 17:31:08,097 INFO  L79                 Accepts]: Start accepts. Automaton has 6966 states and 144652 transitions. Word has length 39
[2025-05-07 17:31:08,097 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:31:08,097 INFO  L485      AbstractCegarLoop]: Abstraction has 6966 states and 144652 transitions.
[2025-05-07 17:31:08,097 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:31:08,097 INFO  L278                IsEmpty]: Start isEmpty. Operand 6966 states and 144652 transitions.
[2025-05-07 17:31:08,136 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:31:08,136 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:31:08,136 INFO  L218           NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:31:08,136 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2025-05-07 17:31:08,136 INFO  L403      AbstractCegarLoop]: === Iteration 35 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:31:08,137 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:31:08,137 INFO  L85        PathProgramCache]: Analyzing trace with hash -187562784, now seen corresponding path program 1 times
[2025-05-07 17:31:08,137 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:31:08,137 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120519301]
[2025-05-07 17:31:08,137 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:31:08,137 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:31:08,141 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:31:08,144 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:31:08,144 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:31:08,144 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:31:08,161 INFO  L134       CoverageAnalysis]: Checked inductivity of 108 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-05-07 17:31:08,161 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:31:08,161 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120519301]
[2025-05-07 17:31:08,161 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120519301] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:31:08,161 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:31:08,161 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:31:08,161 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547760653]
[2025-05-07 17:31:08,161 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:31:08,162 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:31:08,162 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:31:08,162 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:31:08,162 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:31:08,162 INFO  L87              Difference]: Start difference. First operand 6966 states and 144652 transitions. Second operand  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10)
[2025-05-07 17:31:10,773 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:31:10,773 INFO  L93              Difference]: Finished difference Result 8058 states and 229537 transitions.
[2025-05-07 17:31:10,774 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:31:10,774 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 41
[2025-05-07 17:31:10,774 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:31:19,518 INFO  L225             Difference]: With dead ends: 8058
[2025-05-07 17:31:19,519 INFO  L226             Difference]: Without dead ends: 8058
[2025-05-07 17:31:19,519 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:31:19,519 INFO  L437           NwaCegarLoop]: 161 mSDtfsCounter, 10 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:31:19,519 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 308 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:31:19,521 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8058 states.
[2025-05-07 17:31:27,896 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8058 to 7446.
[2025-05-07 17:31:27,938 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7446 states, 1461 states have (on average 5.475701574264202) internal successors, (8000), 3691 states have internal predecessors, (8000), 5791 states have call successors, (5791), 650 states have call predecessors, (5791), 826 states have return successors, (154912), 3105 states have call predecessors, (154912), 5791 states have call successors, (154912)
[2025-05-07 17:31:29,545 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7446 states to 7446 states and 168703 transitions.
[2025-05-07 17:31:29,545 INFO  L79                 Accepts]: Start accepts. Automaton has 7446 states and 168703 transitions. Word has length 41
[2025-05-07 17:31:29,545 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:31:29,545 INFO  L485      AbstractCegarLoop]: Abstraction has 7446 states and 168703 transitions.
[2025-05-07 17:31:29,545 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10)
[2025-05-07 17:31:29,545 INFO  L278                IsEmpty]: Start isEmpty. Operand 7446 states and 168703 transitions.
[2025-05-07 17:31:29,605 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2025-05-07 17:31:29,605 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:31:29,605 INFO  L218           NwaCegarLoop]: trace histogram [9, 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]
[2025-05-07 17:31:29,605 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2025-05-07 17:31:29,605 INFO  L403      AbstractCegarLoop]: === Iteration 36 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:31:29,606 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:31:29,606 INFO  L85        PathProgramCache]: Analyzing trace with hash 1172254433, now seen corresponding path program 1 times
[2025-05-07 17:31:29,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:31:29,606 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543095787]
[2025-05-07 17:31:29,606 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:31:29,606 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:31:29,610 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-05-07 17:31:29,614 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-05-07 17:31:29,614 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:31:29,614 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:31:29,631 INFO  L134       CoverageAnalysis]: Checked inductivity of 108 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-05-07 17:31:29,631 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:31:29,631 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543095787]
[2025-05-07 17:31:29,632 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543095787] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:31:29,632 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:31:29,632 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:31:29,632 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580624002]
[2025-05-07 17:31:29,632 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:31:29,632 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:31:29,632 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:31:29,632 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:31:29,632 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:31:29,633 INFO  L87              Difference]: Start difference. First operand 7446 states and 168703 transitions. Second operand  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:31:32,780 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:31:32,781 INFO  L93              Difference]: Finished difference Result 8538 states and 257403 transitions.
[2025-05-07 17:31:32,781 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:31:32,781 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 39
[2025-05-07 17:31:32,781 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:31:45,042 INFO  L225             Difference]: With dead ends: 8538
[2025-05-07 17:31:45,042 INFO  L226             Difference]: Without dead ends: 8538
[2025-05-07 17:31:45,042 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:31:45,043 INFO  L437           NwaCegarLoop]: 161 mSDtfsCounter, 10 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:31:45,043 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 302 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:31:45,046 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8538 states.
[2025-05-07 17:31:55,236 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8538 to 7926.
[2025-05-07 17:31:55,292 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7926 states, 1563 states have (on average 5.664107485604607) internal successors, (8853), 3865 states have internal predecessors, (8853), 6169 states have call successors, (6169), 701 states have call predecessors, (6169), 877 states have return successors, (181547), 3360 states have call predecessors, (181547), 6169 states have call successors, (181547)
[2025-05-07 17:31:57,392 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7926 states to 7926 states and 196569 transitions.
[2025-05-07 17:31:57,392 INFO  L79                 Accepts]: Start accepts. Automaton has 7926 states and 196569 transitions. Word has length 39
[2025-05-07 17:31:57,392 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:31:57,392 INFO  L485      AbstractCegarLoop]: Abstraction has 7926 states and 196569 transitions.
[2025-05-07 17:31:57,392 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:31:57,392 INFO  L278                IsEmpty]: Start isEmpty. Operand 7926 states and 196569 transitions.
[2025-05-07 17:31:57,448 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2025-05-07 17:31:57,448 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:31:57,448 INFO  L218           NwaCegarLoop]: trace histogram [9, 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]
[2025-05-07 17:31:57,448 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2025-05-07 17:31:57,448 INFO  L403      AbstractCegarLoop]: === Iteration 37 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:31:57,448 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:31:57,449 INFO  L85        PathProgramCache]: Analyzing trace with hash -950866726, now seen corresponding path program 1 times
[2025-05-07 17:31:57,449 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:31:57,449 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645569065]
[2025-05-07 17:31:57,449 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:31:57,449 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:31:57,453 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-05-07 17:31:57,455 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-05-07 17:31:57,455 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:31:57,455 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:31:57,468 INFO  L134       CoverageAnalysis]: Checked inductivity of 108 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-05-07 17:31:57,468 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:31:57,469 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645569065]
[2025-05-07 17:31:57,469 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645569065] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:31:57,469 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:31:57,469 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:31:57,469 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355298616]
[2025-05-07 17:31:57,469 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:31:57,469 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:31:57,469 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:31:57,469 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:31:57,469 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:31:57,469 INFO  L87              Difference]: Start difference. First operand 7926 states and 196569 transitions. Second operand  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:32:01,187 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:32:01,187 INFO  L93              Difference]: Finished difference Result 9018 states and 288982 transitions.
[2025-05-07 17:32:01,188 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:32:01,188 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 39
[2025-05-07 17:32:01,188 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:32:14,333 INFO  L225             Difference]: With dead ends: 9018
[2025-05-07 17:32:14,333 INFO  L226             Difference]: Without dead ends: 9018
[2025-05-07 17:32:14,333 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:32:14,334 INFO  L437           NwaCegarLoop]: 161 mSDtfsCounter, 10 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:32:14,334 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 300 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:32:14,336 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9018 states.
[2025-05-07 17:32:26,308 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9018 to 8406.
[2025-05-07 17:32:26,375 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8406 states, 1665 states have (on average 5.86006006006006) internal successors, (9757), 4039 states have internal predecessors, (9757), 6547 states have call successors, (6547), 752 states have call predecessors, (6547), 928 states have return successors, (211844), 3615 states have call predecessors, (211844), 6547 states have call successors, (211844)
[2025-05-07 17:32:28,981 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8406 states to 8406 states and 228148 transitions.
[2025-05-07 17:32:28,982 INFO  L79                 Accepts]: Start accepts. Automaton has 8406 states and 228148 transitions. Word has length 39
[2025-05-07 17:32:28,982 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:32:28,982 INFO  L485      AbstractCegarLoop]: Abstraction has 8406 states and 228148 transitions.
[2025-05-07 17:32:28,982 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9)
[2025-05-07 17:32:28,982 INFO  L278                IsEmpty]: Start isEmpty. Operand 8406 states and 228148 transitions.
[2025-05-07 17:32:29,065 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-05-07 17:32:29,066 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:32:29,066 INFO  L218           NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:32:29,066 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2025-05-07 17:32:29,066 INFO  L403      AbstractCegarLoop]: === Iteration 38 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:32:29,066 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:32:29,066 INFO  L85        PathProgramCache]: Analyzing trace with hash -54024429, now seen corresponding path program 1 times
[2025-05-07 17:32:29,066 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:32:29,066 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135759030]
[2025-05-07 17:32:29,066 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:32:29,066 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:32:29,071 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes.
[2025-05-07 17:32:29,073 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements.
[2025-05-07 17:32:29,073 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:32:29,073 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:32:29,090 INFO  L134       CoverageAnalysis]: Checked inductivity of 108 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked.
[2025-05-07 17:32:29,091 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:32:29,091 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135759030]
[2025-05-07 17:32:29,091 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135759030] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:32:29,091 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:32:29,091 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:32:29,091 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995531766]
[2025-05-07 17:32:29,091 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:32:29,091 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:32:29,091 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:32:29,092 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:32:29,092 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:32:29,092 INFO  L87              Difference]: Start difference. First operand 8406 states and 228148 transitions. Second operand  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10)
[2025-05-07 17:32:33,421 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:32:33,421 INFO  L93              Difference]: Finished difference Result 9498 states and 324274 transitions.
[2025-05-07 17:32:33,422 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:32:33,422 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 41
[2025-05-07 17:32:33,422 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:32:50,167 INFO  L225             Difference]: With dead ends: 9498
[2025-05-07 17:32:50,167 INFO  L226             Difference]: Without dead ends: 9498
[2025-05-07 17:32:50,167 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:32:50,167 INFO  L437           NwaCegarLoop]: 161 mSDtfsCounter, 10 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:32:50,167 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 298 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:32:50,169 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9498 states.
[2025-05-07 17:33:03,209 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9498 to 8886.
[2025-05-07 17:33:03,286 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8886 states, 1767 states have (on average 6.062252405206565) internal successors, (10712), 4213 states have internal predecessors, (10712), 6925 states have call successors, (6925), 803 states have call predecessors, (6925), 979 states have return successors, (245803), 3870 states have call predecessors, (245803), 6925 states have call successors, (245803)
[2025-05-07 17:33:06,475 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 263440 transitions.
[2025-05-07 17:33:06,475 INFO  L79                 Accepts]: Start accepts. Automaton has 8886 states and 263440 transitions. Word has length 41
[2025-05-07 17:33:06,475 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:33:06,475 INFO  L485      AbstractCegarLoop]: Abstraction has 8886 states and 263440 transitions.
[2025-05-07 17:33:06,475 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10)
[2025-05-07 17:33:06,476 INFO  L278                IsEmpty]: Start isEmpty. Operand 8886 states and 263440 transitions.
[2025-05-07 17:33:06,550 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2025-05-07 17:33:06,550 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:33:06,550 INFO  L218           NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:33:06,550 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2025-05-07 17:33:06,550 INFO  L403      AbstractCegarLoop]: === Iteration 39 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:33:06,551 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:33:06,551 INFO  L85        PathProgramCache]: Analyzing trace with hash -1335314895, now seen corresponding path program 1 times
[2025-05-07 17:33:06,551 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:33:06,551 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12694042]
[2025-05-07 17:33:06,551 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:33:06,551 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:33:06,556 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes.
[2025-05-07 17:33:06,559 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-05-07 17:33:06,559 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:33:06,559 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:33:06,575 INFO  L134       CoverageAnalysis]: Checked inductivity of 135 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked.
[2025-05-07 17:33:06,575 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:33:06,575 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12694042]
[2025-05-07 17:33:06,575 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12694042] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:33:06,575 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:33:06,575 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:33:06,575 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630822706]
[2025-05-07 17:33:06,575 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:33:06,576 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:33:06,576 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:33:06,576 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:33:06,576 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:33:06,576 INFO  L87              Difference]: Start difference. First operand 8886 states and 263440 transitions. Second operand  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:33:10,935 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:33:10,935 INFO  L93              Difference]: Finished difference Result 9294 states and 309234 transitions.
[2025-05-07 17:33:10,936 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:33:10,936 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 45
[2025-05-07 17:33:10,936 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:33:28,123 INFO  L225             Difference]: With dead ends: 9294
[2025-05-07 17:33:28,123 INFO  L226             Difference]: Without dead ends: 9294
[2025-05-07 17:33:28,123 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:33:28,123 INFO  L437           NwaCegarLoop]: 168 mSDtfsCounter, 10 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:33:28,124 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 365 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:33:28,126 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9294 states.
[2025-05-07 17:33:40,311 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9294 to 8886.
[2025-05-07 17:33:40,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8886 states, 1767 states have (on average 6.062252405206565) internal successors, (10712), 4213 states have internal predecessors, (10712), 6925 states have call successors, (6925), 803 states have call predecessors, (6925), 979 states have return successors, (244978), 3870 states have call predecessors, (244978), 6925 states have call successors, (244978)
[2025-05-07 17:33:43,543 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 262615 transitions.
[2025-05-07 17:33:43,543 INFO  L79                 Accepts]: Start accepts. Automaton has 8886 states and 262615 transitions. Word has length 45
[2025-05-07 17:33:43,543 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:33:43,543 INFO  L485      AbstractCegarLoop]: Abstraction has 8886 states and 262615 transitions.
[2025-05-07 17:33:43,543 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:33:43,544 INFO  L278                IsEmpty]: Start isEmpty. Operand 8886 states and 262615 transitions.
[2025-05-07 17:33:43,610 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2025-05-07 17:33:43,610 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:33:43,610 INFO  L218           NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:33:43,610 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2025-05-07 17:33:43,610 INFO  L403      AbstractCegarLoop]: === Iteration 40 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:33:43,610 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:33:43,610 INFO  L85        PathProgramCache]: Analyzing trace with hash 208192194, now seen corresponding path program 1 times
[2025-05-07 17:33:43,611 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:33:43,611 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143220005]
[2025-05-07 17:33:43,611 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:33:43,611 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:33:43,616 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes.
[2025-05-07 17:33:43,619 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-05-07 17:33:43,619 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:33:43,619 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:33:43,635 INFO  L134       CoverageAnalysis]: Checked inductivity of 135 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked.
[2025-05-07 17:33:43,636 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:33:43,636 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143220005]
[2025-05-07 17:33:43,636 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143220005] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:33:43,636 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:33:43,636 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:33:43,636 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617071086]
[2025-05-07 17:33:43,636 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:33:43,636 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:33:43,636 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:33:43,637 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:33:43,637 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:33:43,637 INFO  L87              Difference]: Start difference. First operand 8886 states and 262615 transitions. Second operand  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:33:47,933 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:33:47,934 INFO  L93              Difference]: Finished difference Result 9294 states and 308409 transitions.
[2025-05-07 17:33:47,934 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:33:47,934 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 45
[2025-05-07 17:33:47,935 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:34:05,086 INFO  L225             Difference]: With dead ends: 9294
[2025-05-07 17:34:05,086 INFO  L226             Difference]: Without dead ends: 9294
[2025-05-07 17:34:05,087 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:34:05,087 INFO  L437           NwaCegarLoop]: 166 mSDtfsCounter, 10 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:34:05,087 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 357 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:34:05,089 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9294 states.
[2025-05-07 17:34:16,946 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9294 to 8886.
[2025-05-07 17:34:17,023 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8886 states, 1767 states have (on average 6.062252405206565) internal successors, (10712), 4213 states have internal predecessors, (10712), 6925 states have call successors, (6925), 803 states have call predecessors, (6925), 979 states have return successors, (244153), 3870 states have call predecessors, (244153), 6925 states have call successors, (244153)
[2025-05-07 17:34:20,188 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 261790 transitions.
[2025-05-07 17:34:20,189 INFO  L79                 Accepts]: Start accepts. Automaton has 8886 states and 261790 transitions. Word has length 45
[2025-05-07 17:34:20,189 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:34:20,189 INFO  L485      AbstractCegarLoop]: Abstraction has 8886 states and 261790 transitions.
[2025-05-07 17:34:20,189 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:34:20,189 INFO  L278                IsEmpty]: Start isEmpty. Operand 8886 states and 261790 transitions.
[2025-05-07 17:34:20,248 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2025-05-07 17:34:20,248 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:34:20,249 INFO  L218           NwaCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:34:20,249 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2025-05-07 17:34:20,249 INFO  L403      AbstractCegarLoop]: === Iteration 41 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:34:20,249 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:34:20,249 INFO  L85        PathProgramCache]: Analyzing trace with hash -1528831229, now seen corresponding path program 1 times
[2025-05-07 17:34:20,249 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:34:20,249 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269766471]
[2025-05-07 17:34:20,249 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:34:20,249 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:34:20,254 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes.
[2025-05-07 17:34:20,257 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements.
[2025-05-07 17:34:20,257 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:34:20,257 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:34:20,490 INFO  L134       CoverageAnalysis]: Checked inductivity of 135 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked.
[2025-05-07 17:34:20,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:34:20,491 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269766471]
[2025-05-07 17:34:20,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269766471] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:34:20,491 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:34:20,491 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:34:20,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910145576]
[2025-05-07 17:34:20,491 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:34:20,491 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:34:20,491 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:34:20,492 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:34:20,492 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:34:20,492 INFO  L87              Difference]: Start difference. First operand 8886 states and 261790 transitions. Second operand  has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10)
[2025-05-07 17:34:25,084 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:34:25,084 INFO  L93              Difference]: Finished difference Result 9294 states and 307584 transitions.
[2025-05-07 17:34:25,085 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:34:25,085 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 43
[2025-05-07 17:34:25,085 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:34:42,250 INFO  L225             Difference]: With dead ends: 9294
[2025-05-07 17:34:42,250 INFO  L226             Difference]: Without dead ends: 9294
[2025-05-07 17:34:42,250 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:34:42,250 INFO  L437           NwaCegarLoop]: 166 mSDtfsCounter, 10 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:34:42,251 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 351 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:34:42,253 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9294 states.
[2025-05-07 17:34:54,296 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9294 to 8886.
[2025-05-07 17:34:54,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8886 states, 1767 states have (on average 6.062252405206565) internal successors, (10712), 4213 states have internal predecessors, (10712), 6925 states have call successors, (6925), 803 states have call predecessors, (6925), 979 states have return successors, (243328), 3870 states have call predecessors, (243328), 6925 states have call successors, (243328)
[2025-05-07 17:34:57,520 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 260965 transitions.
[2025-05-07 17:34:57,521 INFO  L79                 Accepts]: Start accepts. Automaton has 8886 states and 260965 transitions. Word has length 43
[2025-05-07 17:34:57,521 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:34:57,521 INFO  L485      AbstractCegarLoop]: Abstraction has 8886 states and 260965 transitions.
[2025-05-07 17:34:57,521 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10)
[2025-05-07 17:34:57,521 INFO  L278                IsEmpty]: Start isEmpty. Operand 8886 states and 260965 transitions.
[2025-05-07 17:34:57,587 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 44
[2025-05-07 17:34:57,587 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:34:57,587 INFO  L218           NwaCegarLoop]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:34:57,587 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2025-05-07 17:34:57,588 INFO  L403      AbstractCegarLoop]: === Iteration 42 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:34:57,588 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:34:57,588 INFO  L85        PathProgramCache]: Analyzing trace with hash -1738799428, now seen corresponding path program 1 times
[2025-05-07 17:34:57,588 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:34:57,588 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298052223]
[2025-05-07 17:34:57,588 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:34:57,588 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:34:57,595 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes.
[2025-05-07 17:34:57,599 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements.
[2025-05-07 17:34:57,599 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:34:57,599 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:34:57,621 INFO  L134       CoverageAnalysis]: Checked inductivity of 135 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked.
[2025-05-07 17:34:57,621 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:34:57,621 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298052223]
[2025-05-07 17:34:57,622 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298052223] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:34:57,622 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:34:57,622 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:34:57,622 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454286706]
[2025-05-07 17:34:57,622 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:34:57,622 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:34:57,622 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:34:57,622 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:34:57,622 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:34:57,622 INFO  L87              Difference]: Start difference. First operand 8886 states and 260965 transitions. Second operand  has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10)
[2025-05-07 17:35:01,996 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:35:01,996 INFO  L93              Difference]: Finished difference Result 9294 states and 306759 transitions.
[2025-05-07 17:35:01,997 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:35:01,997 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 43
[2025-05-07 17:35:01,997 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:35:18,243 INFO  L225             Difference]: With dead ends: 9294
[2025-05-07 17:35:18,243 INFO  L226             Difference]: Without dead ends: 9294
[2025-05-07 17:35:18,243 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:35:18,243 INFO  L437           NwaCegarLoop]: 166 mSDtfsCounter, 10 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:35:18,243 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 349 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:35:18,245 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9294 states.
[2025-05-07 17:35:30,629 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9294 to 8886.
[2025-05-07 17:35:30,706 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8886 states, 1767 states have (on average 6.062252405206565) internal successors, (10712), 4213 states have internal predecessors, (10712), 6925 states have call successors, (6925), 803 states have call predecessors, (6925), 979 states have return successors, (242503), 3870 states have call predecessors, (242503), 6925 states have call successors, (242503)
[2025-05-07 17:35:34,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 260140 transitions.
[2025-05-07 17:35:34,070 INFO  L79                 Accepts]: Start accepts. Automaton has 8886 states and 260140 transitions. Word has length 43
[2025-05-07 17:35:34,070 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:35:34,070 INFO  L485      AbstractCegarLoop]: Abstraction has 8886 states and 260140 transitions.
[2025-05-07 17:35:34,070 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10)
[2025-05-07 17:35:34,070 INFO  L278                IsEmpty]: Start isEmpty. Operand 8886 states and 260140 transitions.
[2025-05-07 17:35:34,144 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2025-05-07 17:35:34,144 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:35:34,144 INFO  L218           NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:35:34,145 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2025-05-07 17:35:34,145 INFO  L403      AbstractCegarLoop]: === Iteration 43 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:35:34,145 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:35:34,145 INFO  L85        PathProgramCache]: Analyzing trace with hash -310467531, now seen corresponding path program 1 times
[2025-05-07 17:35:34,145 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:35:34,145 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044061555]
[2025-05-07 17:35:34,145 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:35:34,145 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:35:34,150 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes.
[2025-05-07 17:35:34,153 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements.
[2025-05-07 17:35:34,153 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:35:34,153 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:35:34,169 INFO  L134       CoverageAnalysis]: Checked inductivity of 135 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked.
[2025-05-07 17:35:34,169 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:35:34,169 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044061555]
[2025-05-07 17:35:34,169 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044061555] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:35:34,169 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:35:34,169 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:35:34,169 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318873967]
[2025-05-07 17:35:34,169 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:35:34,170 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:35:34,170 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:35:34,170 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:35:34,170 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:35:34,170 INFO  L87              Difference]: Start difference. First operand 8886 states and 260140 transitions. Second operand  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11)
[2025-05-07 17:35:38,451 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:35:38,451 INFO  L93              Difference]: Finished difference Result 9600 states and 337808 transitions.
[2025-05-07 17:35:38,452 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:35:38,452 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 45
[2025-05-07 17:35:38,452 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:35:55,813 INFO  L225             Difference]: With dead ends: 9600
[2025-05-07 17:35:55,813 INFO  L226             Difference]: Without dead ends: 9600
[2025-05-07 17:35:55,814 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:35:55,814 INFO  L437           NwaCegarLoop]: 147 mSDtfsCounter, 3 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:35:55,814 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 314 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:35:55,816 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9600 states.
[2025-05-07 17:36:09,167 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9600 to 8886.
[2025-05-07 17:36:09,244 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8886 states, 1767 states have (on average 6.062252405206565) internal successors, (10712), 4213 states have internal predecessors, (10712), 6925 states have call successors, (6925), 803 states have call predecessors, (6925), 979 states have return successors, (242207), 3870 states have call predecessors, (242207), 6925 states have call successors, (242207)
[2025-05-07 17:36:12,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 259844 transitions.
[2025-05-07 17:36:12,420 INFO  L79                 Accepts]: Start accepts. Automaton has 8886 states and 259844 transitions. Word has length 45
[2025-05-07 17:36:12,420 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:36:12,420 INFO  L485      AbstractCegarLoop]: Abstraction has 8886 states and 259844 transitions.
[2025-05-07 17:36:12,420 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11)
[2025-05-07 17:36:12,420 INFO  L278                IsEmpty]: Start isEmpty. Operand 8886 states and 259844 transitions.
[2025-05-07 17:36:12,504 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2025-05-07 17:36:12,504 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:36:12,504 INFO  L218           NwaCegarLoop]: trace histogram [11, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:36:12,504 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2025-05-07 17:36:12,505 INFO  L403      AbstractCegarLoop]: === Iteration 44 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:36:12,505 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:36:12,505 INFO  L85        PathProgramCache]: Analyzing trace with hash -816377316, now seen corresponding path program 1 times
[2025-05-07 17:36:12,505 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:36:12,505 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449993474]
[2025-05-07 17:36:12,505 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:36:12,505 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:36:12,510 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes.
[2025-05-07 17:36:12,512 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements.
[2025-05-07 17:36:12,512 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:36:12,512 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:36:12,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 165 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked.
[2025-05-07 17:36:12,528 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:36:12,528 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449993474]
[2025-05-07 17:36:12,528 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449993474] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:36:12,529 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:36:12,529 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:36:12,529 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063238651]
[2025-05-07 17:36:12,529 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:36:12,529 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:36:12,529 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:36:12,529 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:36:12,529 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:36:12,530 INFO  L87              Difference]: Start difference. First operand 8886 states and 259844 transitions. Second operand  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:36:17,228 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:36:17,228 INFO  L93              Difference]: Finished difference Result 9600 states and 337533 transitions.
[2025-05-07 17:36:17,229 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:36:17,229 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 47
[2025-05-07 17:36:17,230 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:36:35,426 INFO  L225             Difference]: With dead ends: 9600
[2025-05-07 17:36:35,426 INFO  L226             Difference]: Without dead ends: 9600
[2025-05-07 17:36:35,426 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:36:35,426 INFO  L437           NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:36:35,426 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 313 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:36:35,430 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9600 states.
[2025-05-07 17:36:48,542 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9600 to 8886.
[2025-05-07 17:36:48,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8886 states, 1767 states have (on average 6.062252405206565) internal successors, (10712), 4213 states have internal predecessors, (10712), 6925 states have call successors, (6925), 803 states have call predecessors, (6925), 979 states have return successors, (241932), 3870 states have call predecessors, (241932), 6925 states have call successors, (241932)
[2025-05-07 17:36:51,680 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 259569 transitions.
[2025-05-07 17:36:51,680 INFO  L79                 Accepts]: Start accepts. Automaton has 8886 states and 259569 transitions. Word has length 47
[2025-05-07 17:36:51,680 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:36:51,680 INFO  L485      AbstractCegarLoop]: Abstraction has 8886 states and 259569 transitions.
[2025-05-07 17:36:51,681 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:36:51,681 INFO  L278                IsEmpty]: Start isEmpty. Operand 8886 states and 259569 transitions.
[2025-05-07 17:36:51,752 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 48
[2025-05-07 17:36:51,752 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:36:51,752 INFO  L218           NwaCegarLoop]: trace histogram [11, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:36:51,752 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2025-05-07 17:36:51,752 INFO  L403      AbstractCegarLoop]: === Iteration 45 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:36:51,753 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:36:51,753 INFO  L85        PathProgramCache]: Analyzing trace with hash 730218093, now seen corresponding path program 1 times
[2025-05-07 17:36:51,753 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:36:51,753 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339468416]
[2025-05-07 17:36:51,753 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:36:51,753 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:36:51,757 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes.
[2025-05-07 17:36:51,760 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements.
[2025-05-07 17:36:51,760 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:36:51,760 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:36:51,775 INFO  L134       CoverageAnalysis]: Checked inductivity of 165 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked.
[2025-05-07 17:36:51,775 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:36:51,775 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339468416]
[2025-05-07 17:36:51,775 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339468416] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:36:51,775 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:36:51,776 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:36:51,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058264767]
[2025-05-07 17:36:51,776 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:36:51,776 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:36:51,776 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:36:51,776 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:36:51,776 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:36:51,776 INFO  L87              Difference]: Start difference. First operand 8886 states and 259569 transitions. Second operand  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:36:56,385 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:36:56,385 INFO  L93              Difference]: Finished difference Result 9600 states and 337258 transitions.
[2025-05-07 17:36:56,386 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:36:56,387 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 47
[2025-05-07 17:36:56,387 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:37:14,429 INFO  L225             Difference]: With dead ends: 9600
[2025-05-07 17:37:14,429 INFO  L226             Difference]: Without dead ends: 9600
[2025-05-07 17:37:14,429 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:37:14,430 INFO  L437           NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:37:14,430 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 309 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:37:14,432 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9600 states.
[2025-05-07 17:37:27,976 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9600 to 8886.
[2025-05-07 17:37:28,052 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8886 states, 1767 states have (on average 6.062252405206565) internal successors, (10712), 4213 states have internal predecessors, (10712), 6925 states have call successors, (6925), 803 states have call predecessors, (6925), 979 states have return successors, (241657), 3870 states have call predecessors, (241657), 6925 states have call successors, (241657)
[2025-05-07 17:37:31,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 259294 transitions.
[2025-05-07 17:37:31,219 INFO  L79                 Accepts]: Start accepts. Automaton has 8886 states and 259294 transitions. Word has length 47
[2025-05-07 17:37:31,219 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:37:31,219 INFO  L485      AbstractCegarLoop]: Abstraction has 8886 states and 259294 transitions.
[2025-05-07 17:37:31,219 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (11), 1 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11)
[2025-05-07 17:37:31,219 INFO  L278                IsEmpty]: Start isEmpty. Operand 8886 states and 259294 transitions.
[2025-05-07 17:37:31,301 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2025-05-07 17:37:31,301 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:37:31,301 INFO  L218           NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:37:31,301 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2025-05-07 17:37:31,301 INFO  L403      AbstractCegarLoop]: === Iteration 46 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:37:31,302 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:37:31,302 INFO  L85        PathProgramCache]: Analyzing trace with hash -130374622, now seen corresponding path program 1 times
[2025-05-07 17:37:31,302 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:37:31,302 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064356650]
[2025-05-07 17:37:31,302 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:37:31,302 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:37:31,310 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes.
[2025-05-07 17:37:31,315 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements.
[2025-05-07 17:37:31,315 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:37:31,315 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:37:31,336 INFO  L134       CoverageAnalysis]: Checked inductivity of 165 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked.
[2025-05-07 17:37:31,336 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:37:31,336 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064356650]
[2025-05-07 17:37:31,336 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064356650] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:37:31,336 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:37:31,336 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:37:31,336 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451697596]
[2025-05-07 17:37:31,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:37:31,337 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:37:31,337 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:37:31,337 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:37:31,337 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:37:31,337 INFO  L87              Difference]: Start difference. First operand 8886 states and 259294 transitions. Second operand  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12)
[2025-05-07 17:37:36,648 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:37:36,648 INFO  L93              Difference]: Finished difference Result 9600 states and 336983 transitions.
[2025-05-07 17:37:36,649 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:37:36,649 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 49
[2025-05-07 17:37:36,649 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:37:53,879 INFO  L225             Difference]: With dead ends: 9600
[2025-05-07 17:37:53,879 INFO  L226             Difference]: Without dead ends: 9600
[2025-05-07 17:37:53,879 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:37:53,880 INFO  L437           NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:37:53,880 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 303 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:37:53,883 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9600 states.
[2025-05-07 17:38:07,636 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9600 to 8886.
[2025-05-07 17:38:07,678 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8886 states, 1767 states have (on average 6.062252405206565) internal successors, (10712), 4213 states have internal predecessors, (10712), 6925 states have call successors, (6925), 803 states have call predecessors, (6925), 979 states have return successors, (241382), 3870 states have call predecessors, (241382), 6925 states have call successors, (241382)
[2025-05-07 17:38:10,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 259019 transitions.
[2025-05-07 17:38:10,795 INFO  L79                 Accepts]: Start accepts. Automaton has 8886 states and 259019 transitions. Word has length 49
[2025-05-07 17:38:10,795 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:38:10,795 INFO  L485      AbstractCegarLoop]: Abstraction has 8886 states and 259019 transitions.
[2025-05-07 17:38:10,795 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12)
[2025-05-07 17:38:10,795 INFO  L278                IsEmpty]: Start isEmpty. Operand 8886 states and 259019 transitions.
[2025-05-07 17:38:10,856 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2025-05-07 17:38:10,856 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:38:10,856 INFO  L218           NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:38:10,857 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2025-05-07 17:38:10,857 INFO  L403      AbstractCegarLoop]: === Iteration 47 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:38:10,857 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:38:10,857 INFO  L85        PathProgramCache]: Analyzing trace with hash -46350949, now seen corresponding path program 1 times
[2025-05-07 17:38:10,857 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:38:10,857 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927580596]
[2025-05-07 17:38:10,857 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:38:10,857 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:38:10,863 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes.
[2025-05-07 17:38:10,866 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements.
[2025-05-07 17:38:10,866 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:38:10,866 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:38:10,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 165 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked.
[2025-05-07 17:38:10,881 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:38:10,881 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927580596]
[2025-05-07 17:38:10,881 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927580596] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:38:10,881 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:38:10,881 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:38:10,881 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060066329]
[2025-05-07 17:38:10,882 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:38:10,882 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:38:10,882 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:38:10,882 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:38:10,882 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:38:10,882 INFO  L87              Difference]: Start difference. First operand 8886 states and 259019 transitions. Second operand  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12)
[2025-05-07 17:38:15,743 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:38:15,743 INFO  L93              Difference]: Finished difference Result 9702 states and 356654 transitions.
[2025-05-07 17:38:15,744 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:38:15,744 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 49
[2025-05-07 17:38:15,744 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:38:37,794 INFO  L225             Difference]: With dead ends: 9702
[2025-05-07 17:38:37,794 INFO  L226             Difference]: Without dead ends: 9702
[2025-05-07 17:38:37,794 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:38:37,795 INFO  L437           NwaCegarLoop]: 147 mSDtfsCounter, 3 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:38:37,795 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 313 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:38:37,799 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9702 states.
[2025-05-07 17:38:52,316 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9702 to 8886.
[2025-05-07 17:38:52,359 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8886 states, 1767 states have (on average 6.062252405206565) internal successors, (10712), 4213 states have internal predecessors, (10712), 6925 states have call successors, (6925), 803 states have call predecessors, (6925), 979 states have return successors, (241086), 3870 states have call predecessors, (241086), 6925 states have call successors, (241086)
[2025-05-07 17:38:55,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 258723 transitions.
[2025-05-07 17:38:55,601 INFO  L79                 Accepts]: Start accepts. Automaton has 8886 states and 258723 transitions. Word has length 49
[2025-05-07 17:38:55,601 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:38:55,601 INFO  L485      AbstractCegarLoop]: Abstraction has 8886 states and 258723 transitions.
[2025-05-07 17:38:55,601 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12)
[2025-05-07 17:38:55,601 INFO  L278                IsEmpty]: Start isEmpty. Operand 8886 states and 258723 transitions.
[2025-05-07 17:38:55,673 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 54
[2025-05-07 17:38:55,673 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:38:55,673 INFO  L218           NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:38:55,673 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2025-05-07 17:38:55,674 INFO  L403      AbstractCegarLoop]: === Iteration 48 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:38:55,674 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:38:55,674 INFO  L85        PathProgramCache]: Analyzing trace with hash 1950374364, now seen corresponding path program 1 times
[2025-05-07 17:38:55,674 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:38:55,674 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650969124]
[2025-05-07 17:38:55,674 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:38:55,674 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:38:55,679 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes.
[2025-05-07 17:38:55,682 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements.
[2025-05-07 17:38:55,682 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:38:55,682 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:38:55,699 INFO  L134       CoverageAnalysis]: Checked inductivity of 198 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked.
[2025-05-07 17:38:55,700 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:38:55,700 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650969124]
[2025-05-07 17:38:55,700 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650969124] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:38:55,700 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:38:55,700 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:38:55,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722188724]
[2025-05-07 17:38:55,700 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:38:55,700 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:38:55,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:38:55,700 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:38:55,700 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:38:55,700 INFO  L87              Difference]: Start difference. First operand 8886 states and 258723 transitions. Second operand  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13)
[2025-05-07 17:39:00,392 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:39:00,393 INFO  L93              Difference]: Finished difference Result 9702 states and 356379 transitions.
[2025-05-07 17:39:00,393 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:39:00,394 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 53
[2025-05-07 17:39:00,394 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:39:18,431 INFO  L225             Difference]: With dead ends: 9702
[2025-05-07 17:39:18,431 INFO  L226             Difference]: Without dead ends: 9702
[2025-05-07 17:39:18,432 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:39:18,432 INFO  L437           NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:39:18,432 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 312 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:39:18,434 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9702 states.
[2025-05-07 17:39:32,613 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9702 to 8886.
[2025-05-07 17:39:32,688 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8886 states, 1767 states have (on average 6.062252405206565) internal successors, (10712), 4213 states have internal predecessors, (10712), 6925 states have call successors, (6925), 803 states have call predecessors, (6925), 979 states have return successors, (240811), 3870 states have call predecessors, (240811), 6925 states have call successors, (240811)
[2025-05-07 17:39:35,844 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 258448 transitions.
[2025-05-07 17:39:35,844 INFO  L79                 Accepts]: Start accepts. Automaton has 8886 states and 258448 transitions. Word has length 53
[2025-05-07 17:39:35,844 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:39:35,844 INFO  L485      AbstractCegarLoop]: Abstraction has 8886 states and 258448 transitions.
[2025-05-07 17:39:35,844 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13)
[2025-05-07 17:39:35,844 INFO  L278                IsEmpty]: Start isEmpty. Operand 8886 states and 258448 transitions.
[2025-05-07 17:39:35,914 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:39:35,914 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:39:35,914 INFO  L218           NwaCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:39:35,914 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2025-05-07 17:39:35,914 INFO  L403      AbstractCegarLoop]: === Iteration 49 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:39:35,915 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:39:35,915 INFO  L85        PathProgramCache]: Analyzing trace with hash -585689261, now seen corresponding path program 1 times
[2025-05-07 17:39:35,915 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:39:35,915 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294355196]
[2025-05-07 17:39:35,915 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:39:35,915 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:39:35,923 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:39:35,927 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:39:35,927 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:39:35,927 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:39:35,951 INFO  L134       CoverageAnalysis]: Checked inductivity of 198 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked.
[2025-05-07 17:39:35,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:39:35,951 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294355196]
[2025-05-07 17:39:35,951 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294355196] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:39:35,951 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:39:35,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:39:35,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848455553]
[2025-05-07 17:39:35,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:39:35,951 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:39:35,951 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:39:35,952 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:39:35,952 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:39:35,952 INFO  L87              Difference]: Start difference. First operand 8886 states and 258448 transitions. Second operand  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12)
[2025-05-07 17:39:40,926 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:39:40,926 INFO  L93              Difference]: Finished difference Result 9702 states and 356104 transitions.
[2025-05-07 17:39:40,927 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:39:40,927 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 51
[2025-05-07 17:39:40,927 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:39:59,691 INFO  L225             Difference]: With dead ends: 9702
[2025-05-07 17:39:59,692 INFO  L226             Difference]: Without dead ends: 9702
[2025-05-07 17:39:59,692 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:39:59,692 INFO  L437           NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:39:59,693 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 308 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:39:59,695 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9702 states.
[2025-05-07 17:40:13,980 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9702 to 8886.
[2025-05-07 17:40:14,057 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8886 states, 1767 states have (on average 6.062252405206565) internal successors, (10712), 4213 states have internal predecessors, (10712), 6925 states have call successors, (6925), 803 states have call predecessors, (6925), 979 states have return successors, (240536), 3870 states have call predecessors, (240536), 6925 states have call successors, (240536)
[2025-05-07 17:40:17,208 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 258173 transitions.
[2025-05-07 17:40:17,208 INFO  L79                 Accepts]: Start accepts. Automaton has 8886 states and 258173 transitions. Word has length 51
[2025-05-07 17:40:17,208 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:40:17,208 INFO  L485      AbstractCegarLoop]: Abstraction has 8886 states and 258173 transitions.
[2025-05-07 17:40:17,208 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12)
[2025-05-07 17:40:17,208 INFO  L278                IsEmpty]: Start isEmpty. Operand 8886 states and 258173 transitions.
[2025-05-07 17:40:17,275 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:40:17,275 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:40:17,275 INFO  L218           NwaCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:40:17,276 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2025-05-07 17:40:17,276 INFO  L403      AbstractCegarLoop]: === Iteration 50 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:40:17,276 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:40:17,276 INFO  L85        PathProgramCache]: Analyzing trace with hash -1452387666, now seen corresponding path program 1 times
[2025-05-07 17:40:17,276 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:40:17,276 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678380615]
[2025-05-07 17:40:17,276 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:40:17,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:40:17,282 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:40:17,284 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:40:17,284 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:40:17,284 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:40:17,300 INFO  L134       CoverageAnalysis]: Checked inductivity of 198 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked.
[2025-05-07 17:40:17,300 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:40:17,300 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678380615]
[2025-05-07 17:40:17,300 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678380615] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:40:17,300 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:40:17,300 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:40:17,300 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570749862]
[2025-05-07 17:40:17,300 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:40:17,300 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:40:17,300 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:40:17,301 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:40:17,301 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:40:17,301 INFO  L87              Difference]: Start difference. First operand 8886 states and 258173 transitions. Second operand  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12)
[2025-05-07 17:40:22,701 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:40:22,701 INFO  L93              Difference]: Finished difference Result 9804 states and 379162 transitions.
[2025-05-07 17:40:22,702 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:40:22,702 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 51
[2025-05-07 17:40:22,702 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:40:43,153 INFO  L225             Difference]: With dead ends: 9804
[2025-05-07 17:40:43,153 INFO  L226             Difference]: Without dead ends: 9804
[2025-05-07 17:40:43,153 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:40:43,154 INFO  L437           NwaCegarLoop]: 148 mSDtfsCounter, 3 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:40:43,154 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 314 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:40:43,156 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9804 states.
[2025-05-07 17:40:57,967 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9804 to 8886.
[2025-05-07 17:40:58,042 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8886 states, 1767 states have (on average 6.062252405206565) internal successors, (10712), 4213 states have internal predecessors, (10712), 6925 states have call successors, (6925), 803 states have call predecessors, (6925), 979 states have return successors, (240240), 3870 states have call predecessors, (240240), 6925 states have call successors, (240240)
[2025-05-07 17:41:01,028 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8886 states to 8886 states and 257877 transitions.
[2025-05-07 17:41:01,029 INFO  L79                 Accepts]: Start accepts. Automaton has 8886 states and 257877 transitions. Word has length 51
[2025-05-07 17:41:01,029 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:41:01,029 INFO  L485      AbstractCegarLoop]: Abstraction has 8886 states and 257877 transitions.
[2025-05-07 17:41:01,029 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12)
[2025-05-07 17:41:01,029 INFO  L278                IsEmpty]: Start isEmpty. Operand 8886 states and 257877 transitions.
[2025-05-07 17:41:01,113 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:41:01,113 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:41:01,113 INFO  L218           NwaCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:41:01,113 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2025-05-07 17:41:01,113 INFO  L403      AbstractCegarLoop]: === Iteration 51 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:41:01,113 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:41:01,113 INFO  L85        PathProgramCache]: Analyzing trace with hash -864020122, now seen corresponding path program 1 times
[2025-05-07 17:41:01,113 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:41:01,113 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758661084]
[2025-05-07 17:41:01,114 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:41:01,114 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:41:01,118 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:41:01,121 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:41:01,121 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:41:01,121 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:41:01,137 INFO  L134       CoverageAnalysis]: Checked inductivity of 198 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked.
[2025-05-07 17:41:01,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:41:01,137 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758661084]
[2025-05-07 17:41:01,137 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758661084] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:41:01,137 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:41:01,137 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:41:01,137 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917039841]
[2025-05-07 17:41:01,137 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:41:01,138 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:41:01,138 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:41:01,138 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:41:01,138 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:41:01,138 INFO  L87              Difference]: Start difference. First operand 8886 states and 257877 transitions. Second operand  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12)
[2025-05-07 17:41:07,021 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:41:07,021 INFO  L93              Difference]: Finished difference Result 10182 states and 393183 transitions.
[2025-05-07 17:41:07,022 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:41:07,022 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 51
[2025-05-07 17:41:07,022 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:41:30,473 INFO  L225             Difference]: With dead ends: 10182
[2025-05-07 17:41:30,473 INFO  L226             Difference]: Without dead ends: 10182
[2025-05-07 17:41:30,473 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:41:30,474 INFO  L437           NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-05-07 17:41:30,474 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 306 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-05-07 17:41:30,476 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10182 states.
[2025-05-07 17:41:46,086 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10182 to 9366.
[2025-05-07 17:41:46,174 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9366 states, 1869 states have (on average 6.13322632423756) internal successors, (11463), 4387 states have internal predecessors, (11463), 7303 states have call successors, (7303), 854 states have call predecessors, (7303), 1030 states have return successors, (276486), 4125 states have call predecessors, (276486), 7303 states have call successors, (276486)
[2025-05-07 17:41:50,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9366 states to 9366 states and 295252 transitions.
[2025-05-07 17:41:50,006 INFO  L79                 Accepts]: Start accepts. Automaton has 9366 states and 295252 transitions. Word has length 51
[2025-05-07 17:41:50,006 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:41:50,006 INFO  L485      AbstractCegarLoop]: Abstraction has 9366 states and 295252 transitions.
[2025-05-07 17:41:50,006 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12)
[2025-05-07 17:41:50,006 INFO  L278                IsEmpty]: Start isEmpty. Operand 9366 states and 295252 transitions.
[2025-05-07 17:41:50,110 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 52
[2025-05-07 17:41:50,110 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:41:50,110 INFO  L218           NwaCegarLoop]: trace histogram [12, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:41:50,110 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2025-05-07 17:41:50,110 INFO  L403      AbstractCegarLoop]: === Iteration 52 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:41:50,111 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:41:50,111 INFO  L85        PathProgramCache]: Analyzing trace with hash -1432002005, now seen corresponding path program 1 times
[2025-05-07 17:41:50,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:41:50,111 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666015127]
[2025-05-07 17:41:50,111 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:41:50,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:41:50,116 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes.
[2025-05-07 17:41:50,119 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements.
[2025-05-07 17:41:50,119 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:41:50,119 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:41:50,135 INFO  L134       CoverageAnalysis]: Checked inductivity of 198 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked.
[2025-05-07 17:41:50,136 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:41:50,136 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666015127]
[2025-05-07 17:41:50,136 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666015127] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:41:50,136 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:41:50,136 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:41:50,136 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724999338]
[2025-05-07 17:41:50,136 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:41:50,136 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:41:50,136 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:41:50,137 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:41:50,137 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:41:50,137 INFO  L87              Difference]: Start difference. First operand 9366 states and 295252 transitions. Second operand  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12)
[2025-05-07 17:41:57,034 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:41:57,034 INFO  L93              Difference]: Finished difference Result 10662 states and 434271 transitions.
[2025-05-07 17:41:57,035 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:41:57,035 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 51
[2025-05-07 17:41:57,035 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:42:25,154 INFO  L225             Difference]: With dead ends: 10662
[2025-05-07 17:42:25,155 INFO  L226             Difference]: Without dead ends: 10662
[2025-05-07 17:42:25,155 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:42:25,155 INFO  L437           NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:42:25,155 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 304 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:42:25,158 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10662 states.
[2025-05-07 17:42:42,564 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10662 to 9846.
[2025-05-07 17:42:42,649 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9846 states, 1971 states have (on average 6.222729578893962) internal successors, (12265), 4561 states have internal predecessors, (12265), 7681 states have call successors, (7681), 905 states have call predecessors, (7681), 1081 states have return successors, (316394), 4380 states have call predecessors, (316394), 7681 states have call successors, (316394)
[2025-05-07 17:42:47,332 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 336340 transitions.
[2025-05-07 17:42:47,332 INFO  L79                 Accepts]: Start accepts. Automaton has 9846 states and 336340 transitions. Word has length 51
[2025-05-07 17:42:47,332 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:42:47,332 INFO  L485      AbstractCegarLoop]: Abstraction has 9846 states and 336340 transitions.
[2025-05-07 17:42:47,332 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (12), 1 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12)
[2025-05-07 17:42:47,332 INFO  L278                IsEmpty]: Start isEmpty. Operand 9846 states and 336340 transitions.
[2025-05-07 17:42:47,412 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2025-05-07 17:42:47,412 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:42:47,412 INFO  L218           NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:42:47,412 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2025-05-07 17:42:47,412 INFO  L403      AbstractCegarLoop]: === Iteration 53 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:42:47,413 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:42:47,413 INFO  L85        PathProgramCache]: Analyzing trace with hash -466401079, now seen corresponding path program 1 times
[2025-05-07 17:42:47,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:42:47,413 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862261691]
[2025-05-07 17:42:47,413 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:42:47,413 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:42:47,419 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes.
[2025-05-07 17:42:47,422 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements.
[2025-05-07 17:42:47,422 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:42:47,422 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:42:47,441 INFO  L134       CoverageAnalysis]: Checked inductivity of 234 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked.
[2025-05-07 17:42:47,441 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:42:47,441 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862261691]
[2025-05-07 17:42:47,441 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862261691] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:42:47,441 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:42:47,441 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:42:47,441 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214542911]
[2025-05-07 17:42:47,441 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:42:47,441 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:42:47,441 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:42:47,442 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:42:47,442 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:42:47,442 INFO  L87              Difference]: Start difference. First operand 9846 states and 336340 transitions. Second operand  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:42:55,188 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:42:55,188 INFO  L93              Difference]: Finished difference Result 10764 states and 457350 transitions.
[2025-05-07 17:42:55,189 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:42:55,189 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 57
[2025-05-07 17:42:55,189 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:43:23,265 INFO  L225             Difference]: With dead ends: 10764
[2025-05-07 17:43:23,265 INFO  L226             Difference]: Without dead ends: 10764
[2025-05-07 17:43:23,265 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:43:23,265 INFO  L437           NwaCegarLoop]: 164 mSDtfsCounter, 10 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:43:23,265 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 315 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:43:23,269 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10764 states.
[2025-05-07 17:43:41,734 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10764 to 9846.
[2025-05-07 17:43:41,836 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9846 states, 1971 states have (on average 6.222729578893962) internal successors, (12265), 4561 states have internal predecessors, (12265), 7681 states have call successors, (7681), 905 states have call predecessors, (7681), 1081 states have return successors, (316119), 4380 states have call predecessors, (316119), 7681 states have call successors, (316119)
[2025-05-07 17:43:46,988 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 336065 transitions.
[2025-05-07 17:43:46,988 INFO  L79                 Accepts]: Start accepts. Automaton has 9846 states and 336065 transitions. Word has length 57
[2025-05-07 17:43:46,989 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:43:46,989 INFO  L485      AbstractCegarLoop]: Abstraction has 9846 states and 336065 transitions.
[2025-05-07 17:43:46,989 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:43:46,989 INFO  L278                IsEmpty]: Start isEmpty. Operand 9846 states and 336065 transitions.
[2025-05-07 17:43:47,078 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2025-05-07 17:43:47,078 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:43:47,078 INFO  L218           NwaCegarLoop]: trace histogram [13, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:43:47,078 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2025-05-07 17:43:47,078 INFO  L403      AbstractCegarLoop]: === Iteration 54 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:43:47,079 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:43:47,079 INFO  L85        PathProgramCache]: Analyzing trace with hash 627324672, now seen corresponding path program 1 times
[2025-05-07 17:43:47,079 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:43:47,079 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639071353]
[2025-05-07 17:43:47,079 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:43:47,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:43:47,085 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes.
[2025-05-07 17:43:47,088 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements.
[2025-05-07 17:43:47,088 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:43:47,088 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:43:47,108 INFO  L134       CoverageAnalysis]: Checked inductivity of 234 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked.
[2025-05-07 17:43:47,109 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:43:47,109 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639071353]
[2025-05-07 17:43:47,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639071353] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:43:47,109 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:43:47,109 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:43:47,109 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627357219]
[2025-05-07 17:43:47,109 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:43:47,109 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:43:47,109 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:43:47,110 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:43:47,110 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:43:47,110 INFO  L87              Difference]: Start difference. First operand 9846 states and 336065 transitions. Second operand  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13)
[2025-05-07 17:43:53,794 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:43:53,794 INFO  L93              Difference]: Finished difference Result 10764 states and 457075 transitions.
[2025-05-07 17:43:53,795 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:43:53,795 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 55
[2025-05-07 17:43:53,795 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:44:21,852 INFO  L225             Difference]: With dead ends: 10764
[2025-05-07 17:44:21,853 INFO  L226             Difference]: Without dead ends: 10764
[2025-05-07 17:44:21,853 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:44:21,853 INFO  L437           NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:44:21,853 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 307 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:44:21,856 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10764 states.
[2025-05-07 17:44:40,675 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10764 to 9846.
[2025-05-07 17:44:40,748 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9846 states, 1971 states have (on average 6.222729578893962) internal successors, (12265), 4561 states have internal predecessors, (12265), 7681 states have call successors, (7681), 905 states have call predecessors, (7681), 1081 states have return successors, (315844), 4380 states have call predecessors, (315844), 7681 states have call successors, (315844)
[2025-05-07 17:44:45,511 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 335790 transitions.
[2025-05-07 17:44:45,512 INFO  L79                 Accepts]: Start accepts. Automaton has 9846 states and 335790 transitions. Word has length 55
[2025-05-07 17:44:45,512 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:44:45,512 INFO  L485      AbstractCegarLoop]: Abstraction has 9846 states and 335790 transitions.
[2025-05-07 17:44:45,512 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (13), 1 states have call predecessors, (13), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13)
[2025-05-07 17:44:45,512 INFO  L278                IsEmpty]: Start isEmpty. Operand 9846 states and 335790 transitions.
[2025-05-07 17:44:45,894 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2025-05-07 17:44:45,894 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:44:45,894 INFO  L218           NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:44:45,894 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2025-05-07 17:44:45,894 INFO  L403      AbstractCegarLoop]: === Iteration 55 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:44:45,894 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:44:45,894 INFO  L85        PathProgramCache]: Analyzing trace with hash -1164792339, now seen corresponding path program 1 times
[2025-05-07 17:44:45,894 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:44:45,895 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073033600]
[2025-05-07 17:44:45,895 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:44:45,895 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:44:45,900 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes.
[2025-05-07 17:44:45,903 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements.
[2025-05-07 17:44:45,903 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:44:45,903 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:44:45,921 INFO  L134       CoverageAnalysis]: Checked inductivity of 234 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked.
[2025-05-07 17:44:45,921 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:44:45,921 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073033600]
[2025-05-07 17:44:45,921 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073033600] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:44:45,921 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:44:45,921 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:44:45,921 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302641288]
[2025-05-07 17:44:45,921 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:44:45,921 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:44:45,921 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:44:45,922 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:44:45,922 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:44:45,922 INFO  L87              Difference]: Start difference. First operand 9846 states and 335790 transitions. Second operand  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:44:52,800 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:44:52,801 INFO  L93              Difference]: Finished difference Result 10764 states and 456800 transitions.
[2025-05-07 17:44:52,801 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:44:52,801 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 57
[2025-05-07 17:44:52,802 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:45:21,065 INFO  L225             Difference]: With dead ends: 10764
[2025-05-07 17:45:21,065 INFO  L226             Difference]: Without dead ends: 10764
[2025-05-07 17:45:21,065 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:45:21,065 INFO  L437           NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:45:21,066 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 305 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:45:21,068 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10764 states.
[2025-05-07 17:45:39,369 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10764 to 9846.
[2025-05-07 17:45:39,470 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9846 states, 1971 states have (on average 6.222729578893962) internal successors, (12265), 4561 states have internal predecessors, (12265), 7681 states have call successors, (7681), 905 states have call predecessors, (7681), 1081 states have return successors, (315569), 4380 states have call predecessors, (315569), 7681 states have call successors, (315569)
[2025-05-07 17:45:44,253 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 335515 transitions.
[2025-05-07 17:45:44,253 INFO  L79                 Accepts]: Start accepts. Automaton has 9846 states and 335515 transitions. Word has length 57
[2025-05-07 17:45:44,253 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:45:44,253 INFO  L485      AbstractCegarLoop]: Abstraction has 9846 states and 335515 transitions.
[2025-05-07 17:45:44,253 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 3 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:45:44,253 INFO  L278                IsEmpty]: Start isEmpty. Operand 9846 states and 335515 transitions.
[2025-05-07 17:45:44,361 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2025-05-07 17:45:44,361 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:45:44,361 INFO  L218           NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:45:44,362 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2025-05-07 17:45:44,362 INFO  L403      AbstractCegarLoop]: === Iteration 56 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:45:44,362 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:45:44,362 INFO  L85        PathProgramCache]: Analyzing trace with hash -1534535310, now seen corresponding path program 1 times
[2025-05-07 17:45:44,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:45:44,362 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668143468]
[2025-05-07 17:45:44,362 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:45:44,362 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:45:44,368 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes.
[2025-05-07 17:45:44,371 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements.
[2025-05-07 17:45:44,371 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:45:44,371 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:45:44,388 INFO  L134       CoverageAnalysis]: Checked inductivity of 234 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked.
[2025-05-07 17:45:44,388 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:45:44,388 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668143468]
[2025-05-07 17:45:44,388 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668143468] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:45:44,388 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:45:44,388 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:45:44,389 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540188805]
[2025-05-07 17:45:44,389 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:45:44,389 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:45:44,389 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:45:44,389 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:45:44,389 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:45:44,389 INFO  L87              Difference]: Start difference. First operand 9846 states and 335515 transitions. Second operand  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14)
[2025-05-07 17:45:52,094 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:45:52,094 INFO  L93              Difference]: Finished difference Result 10866 states and 483245 transitions.
[2025-05-07 17:45:52,095 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:45:52,095 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 57
[2025-05-07 17:45:52,095 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:46:23,500 INFO  L225             Difference]: With dead ends: 10866
[2025-05-07 17:46:23,500 INFO  L226             Difference]: Without dead ends: 10866
[2025-05-07 17:46:23,500 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:46:23,500 INFO  L437           NwaCegarLoop]: 147 mSDtfsCounter, 3 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-05-07 17:46:23,501 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 311 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-05-07 17:46:23,503 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10866 states.
[2025-05-07 17:46:42,197 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10866 to 9846.
[2025-05-07 17:46:42,298 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9846 states, 1971 states have (on average 6.222729578893962) internal successors, (12265), 4561 states have internal predecessors, (12265), 7681 states have call successors, (7681), 905 states have call predecessors, (7681), 1081 states have return successors, (315273), 4380 states have call predecessors, (315273), 7681 states have call successors, (315273)
[2025-05-07 17:46:47,122 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 335219 transitions.
[2025-05-07 17:46:47,122 INFO  L79                 Accepts]: Start accepts. Automaton has 9846 states and 335219 transitions. Word has length 57
[2025-05-07 17:46:47,122 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:46:47,122 INFO  L485      AbstractCegarLoop]: Abstraction has 9846 states and 335219 transitions.
[2025-05-07 17:46:47,122 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14)
[2025-05-07 17:46:47,122 INFO  L278                IsEmpty]: Start isEmpty. Operand 9846 states and 335219 transitions.
[2025-05-07 17:46:47,204 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 62
[2025-05-07 17:46:47,204 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:46:47,204 INFO  L218           NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:46:47,204 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2025-05-07 17:46:47,204 INFO  L403      AbstractCegarLoop]: === Iteration 57 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:46:47,204 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:46:47,204 INFO  L85        PathProgramCache]: Analyzing trace with hash -613867085, now seen corresponding path program 1 times
[2025-05-07 17:46:47,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:46:47,205 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382500635]
[2025-05-07 17:46:47,205 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:46:47,205 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:46:47,210 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes.
[2025-05-07 17:46:47,213 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements.
[2025-05-07 17:46:47,214 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:46:47,214 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:46:47,233 INFO  L134       CoverageAnalysis]: Checked inductivity of 273 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked.
[2025-05-07 17:46:47,233 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:46:47,233 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382500635]
[2025-05-07 17:46:47,233 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382500635] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:46:47,233 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:46:47,233 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:46:47,233 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39599185]
[2025-05-07 17:46:47,233 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:46:47,233 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:46:47,234 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:46:47,234 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:46:47,234 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:46:47,234 INFO  L87              Difference]: Start difference. First operand 9846 states and 335219 transitions. Second operand  has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (15), 1 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15)
[2025-05-07 17:46:55,020 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:46:55,020 INFO  L93              Difference]: Finished difference Result 10866 states and 482970 transitions.
[2025-05-07 17:46:55,021 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:46:55,021 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (15), 1 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 61
[2025-05-07 17:46:55,021 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:47:30,167 INFO  L225             Difference]: With dead ends: 10866
[2025-05-07 17:47:30,167 INFO  L226             Difference]: Without dead ends: 10866
[2025-05-07 17:47:30,167 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:47:30,168 INFO  L437           NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-05-07 17:47:30,168 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 310 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-05-07 17:47:30,172 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10866 states.
[2025-05-07 17:47:50,029 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10866 to 9846.
[2025-05-07 17:47:50,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9846 states, 1971 states have (on average 6.222729578893962) internal successors, (12265), 4561 states have internal predecessors, (12265), 7681 states have call successors, (7681), 905 states have call predecessors, (7681), 1081 states have return successors, (314998), 4380 states have call predecessors, (314998), 7681 states have call successors, (314998)
[2025-05-07 17:47:54,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 334944 transitions.
[2025-05-07 17:47:54,858 INFO  L79                 Accepts]: Start accepts. Automaton has 9846 states and 334944 transitions. Word has length 61
[2025-05-07 17:47:54,858 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:47:54,858 INFO  L485      AbstractCegarLoop]: Abstraction has 9846 states and 334944 transitions.
[2025-05-07 17:47:54,858 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (15), 1 states have call predecessors, (15), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15)
[2025-05-07 17:47:54,858 INFO  L278                IsEmpty]: Start isEmpty. Operand 9846 states and 334944 transitions.
[2025-05-07 17:47:54,957 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2025-05-07 17:47:54,957 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:47:54,957 INFO  L218           NwaCegarLoop]: trace histogram [14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:47:54,957 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2025-05-07 17:47:54,957 INFO  L403      AbstractCegarLoop]: === Iteration 58 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:47:54,958 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:47:54,958 INFO  L85        PathProgramCache]: Analyzing trace with hash 2009256106, now seen corresponding path program 1 times
[2025-05-07 17:47:54,958 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:47:54,958 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098088113]
[2025-05-07 17:47:54,958 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:47:54,958 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:47:54,963 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes.
[2025-05-07 17:47:54,966 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements.
[2025-05-07 17:47:54,966 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:47:54,966 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:47:54,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 273 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked.
[2025-05-07 17:47:54,984 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:47:54,984 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098088113]
[2025-05-07 17:47:54,984 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098088113] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:47:54,984 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:47:54,984 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:47:54,984 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381837354]
[2025-05-07 17:47:54,984 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:47:54,984 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:47:54,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:47:54,984 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:47:54,984 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:47:54,984 INFO  L87              Difference]: Start difference. First operand 9846 states and 334944 transitions. Second operand  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:48:02,723 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:48:02,723 INFO  L93              Difference]: Finished difference Result 10866 states and 482695 transitions.
[2025-05-07 17:48:02,724 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:48:02,724 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 59
[2025-05-07 17:48:02,724 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-05-07 17:48:34,072 INFO  L225             Difference]: With dead ends: 10866
[2025-05-07 17:48:34,072 INFO  L226             Difference]: Without dead ends: 10866
[2025-05-07 17:48:34,072 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:48:34,072 INFO  L437           NwaCegarLoop]: 162 mSDtfsCounter, 10 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-05-07 17:48:34,073 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 306 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-05-07 17:48:34,075 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10866 states.
[2025-05-07 17:48:52,964 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10866 to 9846.
[2025-05-07 17:48:53,052 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9846 states, 1971 states have (on average 6.222729578893962) internal successors, (12265), 4561 states have internal predecessors, (12265), 7681 states have call successors, (7681), 905 states have call predecessors, (7681), 1081 states have return successors, (314723), 4380 states have call predecessors, (314723), 7681 states have call successors, (314723)
[2025-05-07 17:48:57,750 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9846 states to 9846 states and 334669 transitions.
[2025-05-07 17:48:57,751 INFO  L79                 Accepts]: Start accepts. Automaton has 9846 states and 334669 transitions. Word has length 59
[2025-05-07 17:48:57,751 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-05-07 17:48:57,751 INFO  L485      AbstractCegarLoop]: Abstraction has 9846 states and 334669 transitions.
[2025-05-07 17:48:57,751 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (14), 1 states have call predecessors, (14), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14)
[2025-05-07 17:48:57,751 INFO  L278                IsEmpty]: Start isEmpty. Operand 9846 states and 334669 transitions.
[2025-05-07 17:48:57,828 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2025-05-07 17:48:57,828 INFO  L210           NwaCegarLoop]: Found error trace
[2025-05-07 17:48:57,828 INFO  L218           NwaCegarLoop]: trace histogram [14, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-07 17:48:57,828 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2025-05-07 17:48:57,828 INFO  L403      AbstractCegarLoop]: === Iteration 59 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-05-07 17:48:57,829 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-05-07 17:48:57,829 INFO  L85        PathProgramCache]: Analyzing trace with hash -1478061763, now seen corresponding path program 1 times
[2025-05-07 17:48:57,829 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-05-07 17:48:57,829 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085812860]
[2025-05-07 17:48:57,829 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-05-07 17:48:57,829 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-05-07 17:48:57,835 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes.
[2025-05-07 17:48:57,838 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements.
[2025-05-07 17:48:57,838 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-05-07 17:48:57,838 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-05-07 17:48:57,856 INFO  L134       CoverageAnalysis]: Checked inductivity of 273 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked.
[2025-05-07 17:48:57,856 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-05-07 17:48:57,856 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085812860]
[2025-05-07 17:48:57,856 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085812860] provided 1 perfect and 0 imperfect interpolant sequences
[2025-05-07 17:48:57,856 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-05-07 17:48:57,856 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-05-07 17:48:57,856 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403948515]
[2025-05-07 17:48:57,856 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-05-07 17:48:57,857 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-05-07 17:48:57,857 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-05-07 17:48:57,857 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-05-07 17:48:57,857 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-05-07 17:48:57,857 INFO  L87              Difference]: Start difference. First operand 9846 states and 334669 transitions. Second operand  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14)
[2025-05-07 17:49:05,928 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-05-07 17:49:05,928 INFO  L93              Difference]: Finished difference Result 10968 states and 512527 transitions.
[2025-05-07 17:49:05,929 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-05-07 17:49:05,929 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 59
[2025-05-07 17:49:05,929 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
