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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:32,839 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:32,933 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf31620-d571-45c3-97b8-56e263f8548d/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:32,941 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:32,941 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:32,963 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:32,964 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:32,964 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:32,967 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:32,967 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:32,968 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:32,968 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:32,968 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:32,968 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:32,968 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:32,968 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:32,969 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:32,969 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:32,969 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:32,969 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:32,969 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:32,969 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:32,969 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:32,969 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:32,969 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:32,972 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:32,973 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:33,316 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:33,325 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:33,327 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:33,329 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:33,329 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:33,330 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf31620-d571-45c3-97b8-56e263f8548d/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-147.smt2
[2025-04-28 21:21:33,332 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:33,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:33,570 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7cf31620-d571-45c3-97b8-56e263f8548d/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-147.smt2
[2025-04-28 21:21:33,577 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:33,579 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:33,580 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:33,580 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:33,580 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:33,585 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,614 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33 Unit
[2025-04-28 21:21:33,614 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:33,615 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:33,616 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:33,617 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:33,634 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,635 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,660 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,661 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,664 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,665 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,667 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,668 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,668 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,688 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:33,691 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:33,691 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:33,691 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:33,693 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,696 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:33,713 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:33,728 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-04-28 21:21:33,732 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-04-28 21:21:33,744 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:33,744 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:33,744 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:33,745 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure CHC_COMP_FALSE given in one single declaration
[2025-04-28 21:21:33,745 INFO  L130     BoogieDeclarations]: Found specification of procedure CHC_COMP_FALSE
[2025-04-28 21:21:33,745 INFO  L138     BoogieDeclarations]: Found implementation of procedure CHC_COMP_FALSE
[2025-04-28 21:21:33,745 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure loop.DLRunknown.CLN3 given in one single declaration
[2025-04-28 21:21:33,745 INFO  L130     BoogieDeclarations]: Found specification of procedure loop.DLRunknown.CLN3
[2025-04-28 21:21:33,745 INFO  L138     BoogieDeclarations]: Found implementation of procedure loop.DLRunknown.CLN3
[2025-04-28 21:21:33,745 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:33,745 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:33,745 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:33,790 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:33,793 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:33,932 INFO  L?                        ?]: Removed 13 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:33,933 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:33,951 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:33,951 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-04-28 21:21:33,952 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:33 BoogieIcfgContainer
[2025-04-28 21:21:33,952 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:33,957 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:33,957 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:33,961 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:33,962 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:33" (1/3) ...
[2025-04-28 21:21:33,962 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d82a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:33, skipping insertion in model container
[2025-04-28 21:21:33,963 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (2/3) ...
[2025-04-28 21:21:33,963 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d82a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:33, skipping insertion in model container
[2025-04-28 21:21:33,963 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:33" (3/3) ...
[2025-04-28 21:21:33,966 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:33,982 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:33,984 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 4 procedures, 20 locations, 36 edges, 4 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:34,038 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:34,061 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;@9477d0c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:34,061 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:34,068 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 20 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 12 states have internal predecessors, (12), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8)
[2025-04-28 21:21:34,081 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2025-04-28 21:21:34,081 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:34,082 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:34,082 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:34,089 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:34,089 INFO  L85        PathProgramCache]: Analyzing trace with hash -2078019927, now seen corresponding path program 1 times
[2025-04-28 21:21:34,099 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:34,099 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308959502]
[2025-04-28 21:21:34,100 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:34,103 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:34,137 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-04-28 21:21:34,158 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-04-28 21:21:34,159 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:34,159 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,350 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:34,351 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:34,351 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308959502]
[2025-04-28 21:21:34,352 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308959502] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:34,352 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:34,355 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:34,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870977190]
[2025-04-28 21:21:34,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:34,362 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:34,362 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:34,397 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:34,397 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:34,400 INFO  L87              Difference]: Start difference. First operand  has 20 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 12 states have internal predecessors, (12), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) Second operand  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-04-28 21:21:34,511 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:34,512 INFO  L93              Difference]: Finished difference Result 22 states and 34 transitions.
[2025-04-28 21:21:34,513 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:34,515 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 12
[2025-04-28 21:21:34,515 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:34,524 INFO  L225             Difference]: With dead ends: 22
[2025-04-28 21:21:34,524 INFO  L226             Difference]: Without dead ends: 22
[2025-04-28 21:21:34,526 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:34,529 INFO  L437           NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:34,530 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:34,544 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2025-04-28 21:21:34,587 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20.
[2025-04-28 21:21:34,592 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 11 states have internal predecessors, (11), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (13), 5 states have call predecessors, (13), 8 states have call successors, (13)
[2025-04-28 21:21:34,597 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions.
[2025-04-28 21:21:34,599 INFO  L79                 Accepts]: Start accepts. Automaton has 20 states and 32 transitions. Word has length 12
[2025-04-28 21:21:34,599 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:34,599 INFO  L485      AbstractCegarLoop]: Abstraction has 20 states and 32 transitions.
[2025-04-28 21:21:34,600 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-04-28 21:21:34,600 INFO  L278                IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions.
[2025-04-28 21:21:34,605 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:34,605 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:34,605 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:34,606 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:34,606 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:34,607 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:34,607 INFO  L85        PathProgramCache]: Analyzing trace with hash -1634589737, now seen corresponding path program 1 times
[2025-04-28 21:21:34,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:34,607 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775610359]
[2025-04-28 21:21:34,607 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:34,609 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:34,619 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:34,637 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:34,637 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:34,637 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,782 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:34,782 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:34,783 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775610359]
[2025-04-28 21:21:34,783 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775610359] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:34,783 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:34,783 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:34,783 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278111477]
[2025-04-28 21:21:34,783 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:34,784 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:34,784 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:34,785 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:34,785 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:34,787 INFO  L87              Difference]: Start difference. First operand 20 states and 32 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (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-04-28 21:21:34,933 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:34,935 INFO  L93              Difference]: Finished difference Result 22 states and 38 transitions.
[2025-04-28 21:21:34,936 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:34,936 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (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 16
[2025-04-28 21:21:34,937 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:34,938 INFO  L225             Difference]: With dead ends: 22
[2025-04-28 21:21:34,938 INFO  L226             Difference]: Without dead ends: 22
[2025-04-28 21:21:34,938 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:34,939 INFO  L437           NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:34,939 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 60 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:34,940 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2025-04-28 21:21:34,952 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22.
[2025-04-28 21:21:34,953 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22 states, 8 states have (on average 1.5) internal successors, (12), 12 states have internal predecessors, (12), 8 states have call successors, (8), 3 states have call predecessors, (8), 5 states have return successors, (18), 6 states have call predecessors, (18), 8 states have call successors, (18)
[2025-04-28 21:21:34,954 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 38 transitions.
[2025-04-28 21:21:34,956 INFO  L79                 Accepts]: Start accepts. Automaton has 22 states and 38 transitions. Word has length 16
[2025-04-28 21:21:34,957 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:34,957 INFO  L485      AbstractCegarLoop]: Abstraction has 22 states and 38 transitions.
[2025-04-28 21:21:34,957 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (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-04-28 21:21:34,957 INFO  L278                IsEmpty]: Start isEmpty. Operand 22 states and 38 transitions.
[2025-04-28 21:21:34,958 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:34,960 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:34,960 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:34,960 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:34,961 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:34,962 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:34,963 INFO  L85        PathProgramCache]: Analyzing trace with hash -302161205, now seen corresponding path program 1 times
[2025-04-28 21:21:34,963 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:34,964 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507721769]
[2025-04-28 21:21:34,964 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:34,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:34,977 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:34,990 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:34,993 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:34,993 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:35,184 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:35,184 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:35,185 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507721769]
[2025-04-28 21:21:35,185 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507721769] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:35,185 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591318819]
[2025-04-28 21:21:35,185 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:35,185 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:35,189 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:35,195 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:35,198 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:35,236 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:35,257 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:35,257 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:35,257 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:35,259 INFO  L256         TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 10 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:35,266 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:35,440 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:35,441 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:35,992 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:35,993 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591318819] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:35,993 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:35,993 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8
[2025-04-28 21:21:35,993 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058430446]
[2025-04-28 21:21:35,993 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:35,994 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:35,994 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:35,996 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:35,996 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:35,997 INFO  L87              Difference]: Start difference. First operand 22 states and 38 transitions. Second operand  has 8 states, 4 states have (on average 2.5) internal successors, (10), 7 states have internal predecessors, (10), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6)
[2025-04-28 21:21:36,190 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:36,190 INFO  L93              Difference]: Finished difference Result 24 states and 43 transitions.
[2025-04-28 21:21:36,191 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:36,191 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 4 states have (on average 2.5) internal successors, (10), 7 states have internal predecessors, (10), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6) Word has length 16
[2025-04-28 21:21:36,191 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:36,192 INFO  L225             Difference]: With dead ends: 24
[2025-04-28 21:21:36,192 INFO  L226             Difference]: Without dead ends: 23
[2025-04-28 21:21:36,193 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:36,194 INFO  L437           NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:36,194 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 81 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:36,195 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2025-04-28 21:21:36,199 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17.
[2025-04-28 21:21:36,199 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17 states, 6 states have (on average 1.5) internal successors, (9), 9 states have internal predecessors, (9), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7)
[2025-04-28 21:21:36,200 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions.
[2025-04-28 21:21:36,200 INFO  L79                 Accepts]: Start accepts. Automaton has 17 states and 23 transitions. Word has length 16
[2025-04-28 21:21:36,200 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:36,201 INFO  L485      AbstractCegarLoop]: Abstraction has 17 states and 23 transitions.
[2025-04-28 21:21:36,201 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 4 states have (on average 2.5) internal successors, (10), 7 states have internal predecessors, (10), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 5 states have call successors, (6)
[2025-04-28 21:21:36,201 INFO  L278                IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions.
[2025-04-28 21:21:36,202 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:36,202 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:36,202 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:36,208 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:36,407 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:36,407 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:36,408 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:36,408 INFO  L85        PathProgramCache]: Analyzing trace with hash 779059663, now seen corresponding path program 1 times
[2025-04-28 21:21:36,408 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:36,408 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337699506]
[2025-04-28 21:21:36,408 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,408 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:36,413 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:36,420 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:36,420 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,420 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,475 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:36,475 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:36,476 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337699506]
[2025-04-28 21:21:36,476 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337699506] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:36,476 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909038294]
[2025-04-28 21:21:36,476 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,476 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:36,479 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:36,481 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:36,485 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:36,513 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:36,523 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:36,523 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,523 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,524 INFO  L256         TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:36,525 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:36,562 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:36,563 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:36,563 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909038294] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:36,563 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:36,563 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5
[2025-04-28 21:21:36,563 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709120282]
[2025-04-28 21:21:36,563 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:36,564 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:36,564 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:36,564 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:36,564 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:36,564 INFO  L87              Difference]: Start difference. First operand 17 states and 23 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:36,604 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:36,605 INFO  L93              Difference]: Finished difference Result 19 states and 28 transitions.
[2025-04-28 21:21:36,606 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:36,606 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-04-28 21:21:36,606 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:36,607 INFO  L225             Difference]: With dead ends: 19
[2025-04-28 21:21:36,607 INFO  L226             Difference]: Without dead ends: 19
[2025-04-28 21:21:36,607 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:36,609 INFO  L437           NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:36,610 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 45 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:36,612 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2025-04-28 21:21:36,618 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19.
[2025-04-28 21:21:36,618 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 10 states have internal predecessors, (10), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11)
[2025-04-28 21:21:36,619 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions.
[2025-04-28 21:21:36,619 INFO  L79                 Accepts]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 16
[2025-04-28 21:21:36,619 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:36,620 INFO  L485      AbstractCegarLoop]: Abstraction has 19 states and 28 transitions.
[2025-04-28 21:21:36,620 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:36,620 INFO  L278                IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions.
[2025-04-28 21:21:36,621 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:36,621 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:36,621 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:36,625 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:36,823 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:36,823 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:36,823 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:36,823 INFO  L85        PathProgramCache]: Analyzing trace with hash -1146263427, now seen corresponding path program 1 times
[2025-04-28 21:21:36,823 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:36,823 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543141628]
[2025-04-28 21:21:36,824 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:36,824 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:36,829 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:36,834 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:36,834 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:36,834 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,001 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:37,002 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:37,002 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543141628]
[2025-04-28 21:21:37,002 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543141628] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:37,002 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073050134]
[2025-04-28 21:21:37,002 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:37,002 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:37,006 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:37,009 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:37,012 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:37,044 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:37,060 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:37,060 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:37,060 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,061 INFO  L256         TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:37,063 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:37,086 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:37,086 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:37,363 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:37,363 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073050134] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:37,363 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:37,363 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5
[2025-04-28 21:21:37,363 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715836769]
[2025-04-28 21:21:37,364 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:37,364 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:37,364 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:37,367 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:37,368 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:37,368 INFO  L87              Difference]: Start difference. First operand 19 states and 28 transitions. Second operand  has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:37,449 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:37,449 INFO  L93              Difference]: Finished difference Result 20 states and 30 transitions.
[2025-04-28 21:21:37,450 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:37,450 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-04-28 21:21:37,450 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:37,451 INFO  L225             Difference]: With dead ends: 20
[2025-04-28 21:21:37,451 INFO  L226             Difference]: Without dead ends: 20
[2025-04-28 21:21:37,451 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:37,452 INFO  L437           NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:37,452 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:37,453 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20 states.
[2025-04-28 21:21:37,456 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20.
[2025-04-28 21:21:37,456 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 8 states have (on average 1.625) internal successors, (13), 10 states have internal predecessors, (13), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (10), 5 states have call predecessors, (10), 7 states have call successors, (10)
[2025-04-28 21:21:37,457 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 30 transitions.
[2025-04-28 21:21:37,457 INFO  L79                 Accepts]: Start accepts. Automaton has 20 states and 30 transitions. Word has length 20
[2025-04-28 21:21:37,457 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:37,457 INFO  L485      AbstractCegarLoop]: Abstraction has 20 states and 30 transitions.
[2025-04-28 21:21:37,457 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:37,457 INFO  L278                IsEmpty]: Start isEmpty. Operand 20 states and 30 transitions.
[2025-04-28 21:21:37,458 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:37,458 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:37,458 INFO  L218           NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:37,464 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-04-28 21:21:37,662 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:37,663 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:37,663 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:37,663 INFO  L85        PathProgramCache]: Analyzing trace with hash -737136213, now seen corresponding path program 2 times
[2025-04-28 21:21:37,663 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:37,664 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907390412]
[2025-04-28 21:21:37,664 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:37,664 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:37,671 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes.
[2025-04-28 21:21:37,679 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:37,679 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:37,679 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,786 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:37,786 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:37,786 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907390412]
[2025-04-28 21:21:37,786 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907390412] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:37,786 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:37,786 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:37,787 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30130870]
[2025-04-28 21:21:37,787 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:37,787 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:37,787 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:37,787 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:37,788 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:37,788 INFO  L87              Difference]: Start difference. First operand 20 states and 30 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, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:37,828 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:37,828 INFO  L93              Difference]: Finished difference Result 22 states and 35 transitions.
[2025-04-28 21:21:37,829 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:37,829 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, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 24
[2025-04-28 21:21:37,829 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:37,830 INFO  L225             Difference]: With dead ends: 22
[2025-04-28 21:21:37,830 INFO  L226             Difference]: Without dead ends: 22
[2025-04-28 21:21:37,830 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:37,831 INFO  L437           NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:37,831 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 54 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:37,832 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2025-04-28 21:21:37,835 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22.
[2025-04-28 21:21:37,835 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 11 states have internal predecessors, (14), 7 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14)
[2025-04-28 21:21:37,836 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 35 transitions.
[2025-04-28 21:21:37,836 INFO  L79                 Accepts]: Start accepts. Automaton has 22 states and 35 transitions. Word has length 24
[2025-04-28 21:21:37,836 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:37,837 INFO  L485      AbstractCegarLoop]: Abstraction has 22 states and 35 transitions.
[2025-04-28 21:21:37,837 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, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:37,837 INFO  L278                IsEmpty]: Start isEmpty. Operand 22 states and 35 transitions.
[2025-04-28 21:21:37,838 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:37,838 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:37,838 INFO  L218           NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:37,838 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-04-28 21:21:37,838 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:37,839 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:37,839 INFO  L85        PathProgramCache]: Analyzing trace with hash 595292319, now seen corresponding path program 1 times
[2025-04-28 21:21:37,839 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:37,839 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790658616]
[2025-04-28 21:21:37,839 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:37,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:37,844 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:37,850 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:37,850 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:37,850 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,966 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:21:37,966 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:37,966 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790658616]
[2025-04-28 21:21:37,966 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790658616] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:37,966 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370661610]
[2025-04-28 21:21:37,966 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:37,966 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:37,969 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:37,976 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:37,985 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:38,027 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:38,046 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:38,046 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:38,046 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,047 INFO  L256         TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:38,049 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:38,115 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:38,115 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:38,582 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:21:38,582 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [370661610] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:38,582 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:38,582 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10
[2025-04-28 21:21:38,582 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677126179]
[2025-04-28 21:21:38,582 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:38,583 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:38,583 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:38,583 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:38,583 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:38,584 INFO  L87              Difference]: Start difference. First operand 22 states and 35 transitions. Second operand  has 10 states, 4 states have (on average 4.5) internal successors, (18), 10 states have internal predecessors, (18), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 8 states have call successors, (12)
[2025-04-28 21:21:38,677 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:38,677 INFO  L93              Difference]: Finished difference Result 26 states and 44 transitions.
[2025-04-28 21:21:38,678 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:38,678 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 4 states have (on average 4.5) internal successors, (18), 10 states have internal predecessors, (18), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 8 states have call successors, (12) Word has length 24
[2025-04-28 21:21:38,679 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:38,679 INFO  L225             Difference]: With dead ends: 26
[2025-04-28 21:21:38,679 INFO  L226             Difference]: Without dead ends: 26
[2025-04-28 21:21:38,680 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:38,681 INFO  L437           NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:38,681 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 76 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:38,682 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2025-04-28 21:21:38,690 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24.
[2025-04-28 21:21:38,690 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24 states, 10 states have (on average 1.5) internal successors, (15), 12 states have internal predecessors, (15), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17)
[2025-04-28 21:21:38,691 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 39 transitions.
[2025-04-28 21:21:38,695 INFO  L79                 Accepts]: Start accepts. Automaton has 24 states and 39 transitions. Word has length 24
[2025-04-28 21:21:38,695 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:38,695 INFO  L485      AbstractCegarLoop]: Abstraction has 24 states and 39 transitions.
[2025-04-28 21:21:38,695 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 4 states have (on average 4.5) internal successors, (18), 10 states have internal predecessors, (18), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 3 states have call predecessors, (12), 8 states have call successors, (12)
[2025-04-28 21:21:38,695 INFO  L278                IsEmpty]: Start isEmpty. Operand 24 states and 39 transitions.
[2025-04-28 21:21:38,696 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:38,696 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:38,696 INFO  L218           NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:38,702 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:38,897 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:38,897 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:38,897 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:38,898 INFO  L85        PathProgramCache]: Analyzing trace with hash -1499170506, now seen corresponding path program 1 times
[2025-04-28 21:21:38,898 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:38,898 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131582394]
[2025-04-28 21:21:38,898 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:38,898 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:38,902 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:38,904 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:38,905 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:38,905 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,950 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:38,950 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:38,950 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131582394]
[2025-04-28 21:21:38,950 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131582394] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:38,951 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859923195]
[2025-04-28 21:21:38,951 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:38,951 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:38,953 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:38,956 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:38,959 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:21:39,004 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:39,022 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:39,023 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,023 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,024 INFO  L256         TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:39,025 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:39,044 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:39,045 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:39,046 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859923195] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:39,046 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:39,047 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4
[2025-04-28 21:21:39,047 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421267491]
[2025-04-28 21:21:39,047 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,047 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:39,047 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,048 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:39,049 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:39,049 INFO  L87              Difference]: Start difference. First operand 24 states and 39 transitions. Second operand  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:39,080 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:39,082 INFO  L93              Difference]: Finished difference Result 26 states and 43 transitions.
[2025-04-28 21:21:39,083 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:39,083 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), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24
[2025-04-28 21:21:39,083 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:39,084 INFO  L225             Difference]: With dead ends: 26
[2025-04-28 21:21:39,084 INFO  L226             Difference]: Without dead ends: 26
[2025-04-28 21:21:39,084 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:39,087 INFO  L437           NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:39,088 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 56 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:39,089 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2025-04-28 21:21:39,096 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26.
[2025-04-28 21:21:39,096 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 13 states have internal predecessors, (16), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (20), 8 states have call predecessors, (20), 7 states have call successors, (20)
[2025-04-28 21:21:39,097 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 43 transitions.
[2025-04-28 21:21:39,097 INFO  L79                 Accepts]: Start accepts. Automaton has 26 states and 43 transitions. Word has length 24
[2025-04-28 21:21:39,097 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:39,097 INFO  L485      AbstractCegarLoop]: Abstraction has 26 states and 43 transitions.
[2025-04-28 21:21:39,097 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), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:39,101 INFO  L278                IsEmpty]: Start isEmpty. Operand 26 states and 43 transitions.
[2025-04-28 21:21:39,102 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:39,102 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,102 INFO  L218           NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:39,111 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-04-28 21:21:39,303 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:39,303 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,303 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,303 INFO  L85        PathProgramCache]: Analyzing trace with hash -1140687981, now seen corresponding path program 1 times
[2025-04-28 21:21:39,304 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,304 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731043594]
[2025-04-28 21:21:39,304 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,304 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,308 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:39,311 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:39,311 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,311 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,391 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:39,391 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:39,391 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731043594]
[2025-04-28 21:21:39,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731043594] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:39,391 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358125666]
[2025-04-28 21:21:39,391 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,392 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:39,395 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:39,396 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:39,400 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:21:39,438 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:39,454 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:39,454 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,454 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,455 INFO  L256         TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:39,456 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:39,474 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:39,475 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:39,475 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [358125666] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:39,475 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:39,475 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4
[2025-04-28 21:21:39,476 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736067469]
[2025-04-28 21:21:39,476 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,476 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:39,476 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,477 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:39,478 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:39,478 INFO  L87              Difference]: Start difference. First operand 26 states and 43 transitions. Second operand  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:39,527 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:39,528 INFO  L93              Difference]: Finished difference Result 29 states and 42 transitions.
[2025-04-28 21:21:39,528 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:39,529 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), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) Word has length 24
[2025-04-28 21:21:39,529 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:39,530 INFO  L225             Difference]: With dead ends: 29
[2025-04-28 21:21:39,532 INFO  L226             Difference]: Without dead ends: 29
[2025-04-28 21:21:39,532 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:39,533 INFO  L437           NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:39,533 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 52 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:39,534 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2025-04-28 21:21:39,537 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27.
[2025-04-28 21:21:39,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 27 states, 12 states have (on average 1.5) internal successors, (18), 14 states have internal predecessors, (18), 7 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14)
[2025-04-28 21:21:39,541 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions.
[2025-04-28 21:21:39,542 INFO  L79                 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 24
[2025-04-28 21:21:39,542 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:39,543 INFO  L485      AbstractCegarLoop]: Abstraction has 27 states and 39 transitions.
[2025-04-28 21:21:39,544 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), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6)
[2025-04-28 21:21:39,544 INFO  L278                IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions.
[2025-04-28 21:21:39,545 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2025-04-28 21:21:39,545 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,545 INFO  L218           NwaCegarLoop]: trace histogram [5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:39,552 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-04-28 21:21:39,749 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2025-04-28 21:21:39,750 INFO  L403      AbstractCegarLoop]: === Iteration 10 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:39,750 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:39,750 INFO  L85        PathProgramCache]: Analyzing trace with hash -1550029619, now seen corresponding path program 2 times
[2025-04-28 21:21:39,750 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:39,750 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839684714]
[2025-04-28 21:21:39,750 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:39,750 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:39,756 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes.
[2025-04-28 21:21:39,769 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:39,770 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:39,770 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,933 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-04-28 21:21:39,933 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:39,933 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839684714]
[2025-04-28 21:21:39,933 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839684714] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:39,934 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566467449]
[2025-04-28 21:21:39,935 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:39,935 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:39,937 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:39,943 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:39,947 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-04-28 21:21:39,986 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes.
[2025-04-28 21:21:40,008 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements.
[2025-04-28 21:21:40,008 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:40,009 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,010 INFO  L256         TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:40,011 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:40,061 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-04-28 21:21:40,061 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:40,677 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-04-28 21:21:40,678 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [566467449] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:40,678 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:40,678 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11
[2025-04-28 21:21:40,679 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674284784]
[2025-04-28 21:21:40,680 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:40,680 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-04-28 21:21:40,680 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:40,681 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-04-28 21:21:40,681 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:40,681 INFO  L87              Difference]: Start difference. First operand 27 states and 39 transitions. Second operand  has 11 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 10 states have internal predecessors, (16), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9)
[2025-04-28 21:21:41,017 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:41,017 INFO  L93              Difference]: Finished difference Result 44 states and 74 transitions.
[2025-04-28 21:21:41,019 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:41,020 INFO  L79                 Accepts]: Start accepts. Automaton has  has 11 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 10 states have internal predecessors, (16), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 28
[2025-04-28 21:21:41,020 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:41,021 INFO  L225             Difference]: With dead ends: 44
[2025-04-28 21:21:41,021 INFO  L226             Difference]: Without dead ends: 37
[2025-04-28 21:21:41,022 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:41,022 INFO  L437           NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:41,023 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 109 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:41,027 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2025-04-28 21:21:41,033 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31.
[2025-04-28 21:21:41,034 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (15), 8 states have call predecessors, (15), 8 states have call successors, (15)
[2025-04-28 21:21:41,034 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions.
[2025-04-28 21:21:41,034 INFO  L79                 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 28
[2025-04-28 21:21:41,035 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:41,035 INFO  L485      AbstractCegarLoop]: Abstraction has 31 states and 41 transitions.
[2025-04-28 21:21:41,035 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 10 states have internal predecessors, (16), 7 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9)
[2025-04-28 21:21:41,035 INFO  L278                IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions.
[2025-04-28 21:21:41,036 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-04-28 21:21:41,036 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:41,036 INFO  L218           NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:41,041 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:41,239 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10
[2025-04-28 21:21:41,240 INFO  L403      AbstractCegarLoop]: === Iteration 11 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:41,240 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:41,240 INFO  L85        PathProgramCache]: Analyzing trace with hash -1663360657, now seen corresponding path program 3 times
[2025-04-28 21:21:41,240 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:41,240 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831655941]
[2025-04-28 21:21:41,240 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:41,240 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:41,247 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 5 equivalence classes.
[2025-04-28 21:21:41,258 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 32 statements.
[2025-04-28 21:21:41,259 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:41,260 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,522 INFO  L134       CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2025-04-28 21:21:41,522 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:41,522 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831655941]
[2025-04-28 21:21:41,522 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831655941] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:41,522 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461207487]
[2025-04-28 21:21:41,523 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:41,523 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:41,525 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:41,528 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:41,531 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2025-04-28 21:21:41,580 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 5 equivalence classes.
[2025-04-28 21:21:41,609 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 32 statements.
[2025-04-28 21:21:41,609 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:41,609 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,611 INFO  L256         TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:41,613 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:41,753 INFO  L134       CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2025-04-28 21:21:41,753 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:42,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2025-04-28 21:21:42,808 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [461207487] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:42,808 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:42,808 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15
[2025-04-28 21:21:42,808 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240819419]
[2025-04-28 21:21:42,808 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:42,809 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2025-04-28 21:21:42,809 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:42,810 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2025-04-28 21:21:42,810 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:42,810 INFO  L87              Difference]: Start difference. First operand 31 states and 41 transitions. Second operand  has 15 states, 6 states have (on average 4.0) internal successors, (24), 15 states have internal predecessors, (24), 11 states have call successors, (15), 2 states have call predecessors, (15), 6 states have return successors, (15), 5 states have call predecessors, (15), 11 states have call successors, (15)
[2025-04-28 21:21:43,048 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:43,049 INFO  L93              Difference]: Finished difference Result 37 states and 50 transitions.
[2025-04-28 21:21:43,049 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:43,049 INFO  L79                 Accepts]: Start accepts. Automaton has  has 15 states, 6 states have (on average 4.0) internal successors, (24), 15 states have internal predecessors, (24), 11 states have call successors, (15), 2 states have call predecessors, (15), 6 states have return successors, (15), 5 states have call predecessors, (15), 11 states have call successors, (15) Word has length 32
[2025-04-28 21:21:43,049 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:43,050 INFO  L225             Difference]: With dead ends: 37
[2025-04-28 21:21:43,050 INFO  L226             Difference]: Without dead ends: 37
[2025-04-28 21:21:43,051 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306
[2025-04-28 21:21:43,051 INFO  L437           NwaCegarLoop]: 21 mSDtfsCounter, 15 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:43,052 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 157 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:43,052 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2025-04-28 21:21:43,056 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31.
[2025-04-28 21:21:43,056 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (15), 9 states have call predecessors, (15), 8 states have call successors, (15)
[2025-04-28 21:21:43,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions.
[2025-04-28 21:21:43,057 INFO  L79                 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 32
[2025-04-28 21:21:43,057 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:43,057 INFO  L485      AbstractCegarLoop]: Abstraction has 31 states and 41 transitions.
[2025-04-28 21:21:43,057 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 6 states have (on average 4.0) internal successors, (24), 15 states have internal predecessors, (24), 11 states have call successors, (15), 2 states have call predecessors, (15), 6 states have return successors, (15), 5 states have call predecessors, (15), 11 states have call successors, (15)
[2025-04-28 21:21:43,057 INFO  L278                IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions.
[2025-04-28 21:21:43,058 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-04-28 21:21:43,058 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:43,058 INFO  L218           NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:43,063 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2025-04-28 21:21:43,262 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2025-04-28 21:21:43,263 INFO  L403      AbstractCegarLoop]: === Iteration 12 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:43,263 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:43,263 INFO  L85        PathProgramCache]: Analyzing trace with hash -1024779066, now seen corresponding path program 1 times
[2025-04-28 21:21:43,264 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:43,264 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916935622]
[2025-04-28 21:21:43,264 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:43,264 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:43,269 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:43,278 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:43,278 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:43,278 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:43,363 INFO  L134       CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2025-04-28 21:21:43,363 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:43,363 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916935622]
[2025-04-28 21:21:43,363 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916935622] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:43,364 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641120362]
[2025-04-28 21:21:43,367 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:43,367 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:43,370 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:43,373 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:43,378 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2025-04-28 21:21:43,422 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes.
[2025-04-28 21:21:43,446 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:43,446 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:43,446 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:43,447 INFO  L256         TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:43,448 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:43,473 INFO  L134       CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-04-28 21:21:43,473 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:43,831 INFO  L134       CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2025-04-28 21:21:43,831 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641120362] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:43,832 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:43,832 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8
[2025-04-28 21:21:43,832 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716665545]
[2025-04-28 21:21:43,832 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:43,832 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:43,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:43,833 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:43,833 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:43,833 INFO  L87              Difference]: Start difference. First operand 31 states and 41 transitions. Second operand  has 8 states, 4 states have (on average 4.0) internal successors, (16), 8 states have internal predecessors, (16), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11)
[2025-04-28 21:21:43,928 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:43,928 INFO  L93              Difference]: Finished difference Result 35 states and 47 transitions.
[2025-04-28 21:21:43,930 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:43,930 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 4 states have (on average 4.0) internal successors, (16), 8 states have internal predecessors, (16), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11) Word has length 32
[2025-04-28 21:21:43,930 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:43,931 INFO  L225             Difference]: With dead ends: 35
[2025-04-28 21:21:43,931 INFO  L226             Difference]: Without dead ends: 35
[2025-04-28 21:21:43,931 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:43,932 INFO  L437           NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:43,932 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 67 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:43,933 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2025-04-28 21:21:43,936 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33.
[2025-04-28 21:21:43,936 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 8 states have call successors, (8), 6 states have call predecessors, (8), 9 states have return successors, (17), 10 states have call predecessors, (17), 8 states have call successors, (17)
[2025-04-28 21:21:43,937 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions.
[2025-04-28 21:21:43,937 INFO  L79                 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 32
[2025-04-28 21:21:43,937 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:43,937 INFO  L485      AbstractCegarLoop]: Abstraction has 33 states and 44 transitions.
[2025-04-28 21:21:43,937 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 4 states have (on average 4.0) internal successors, (16), 8 states have internal predecessors, (16), 7 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 7 states have call successors, (11)
[2025-04-28 21:21:43,938 INFO  L278                IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions.
[2025-04-28 21:21:43,940 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2025-04-28 21:21:43,940 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:43,940 INFO  L218           NwaCegarLoop]: trace histogram [6, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:43,945 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:44,140 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-04-28 21:21:44,141 INFO  L403      AbstractCegarLoop]: === Iteration 13 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:44,141 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:44,141 INFO  L85        PathProgramCache]: Analyzing trace with hash -572316317, now seen corresponding path program 4 times
[2025-04-28 21:21:44,141 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:44,141 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118419472]
[2025-04-28 21:21:44,141 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:44,142 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:44,146 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes.
[2025-04-28 21:21:44,152 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:44,152 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:44,152 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,208 INFO  L134       CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2025-04-28 21:21:44,208 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:44,208 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118419472]
[2025-04-28 21:21:44,208 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118419472] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:44,208 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573441570]
[2025-04-28 21:21:44,209 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:44,209 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:44,211 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:44,213 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:44,218 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2025-04-28 21:21:44,268 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes.
[2025-04-28 21:21:44,290 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 32 statements.
[2025-04-28 21:21:44,290 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:21:44,290 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,291 INFO  L256         TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:44,293 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:44,337 INFO  L134       CoverageAnalysis]: Checked inductivity of 48 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-04-28 21:21:44,337 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:44,663 INFO  L134       CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2025-04-28 21:21:44,663 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [573441570] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:44,663 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:44,663 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 8
[2025-04-28 21:21:44,664 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85104174]
[2025-04-28 21:21:44,666 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:44,667 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:44,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:44,668 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:44,668 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:44,669 INFO  L87              Difference]: Start difference. First operand 33 states and 44 transitions. Second operand  has 8 states, 4 states have (on average 4.25) internal successors, (17), 8 states have internal predecessors, (17), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12)
[2025-04-28 21:21:44,751 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:44,751 INFO  L93              Difference]: Finished difference Result 35 states and 46 transitions.
[2025-04-28 21:21:44,752 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:44,752 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 4 states have (on average 4.25) internal successors, (17), 8 states have internal predecessors, (17), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12) Word has length 32
[2025-04-28 21:21:44,752 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:44,753 INFO  L225             Difference]: With dead ends: 35
[2025-04-28 21:21:44,753 INFO  L226             Difference]: Without dead ends: 35
[2025-04-28 21:21:44,753 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:44,754 INFO  L437           NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:44,754 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 66 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:44,755 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2025-04-28 21:21:44,760 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33.
[2025-04-28 21:21:44,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 8 states have call successors, (8), 6 states have call predecessors, (8), 9 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16)
[2025-04-28 21:21:44,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions.
[2025-04-28 21:21:44,761 INFO  L79                 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 32
[2025-04-28 21:21:44,761 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:44,765 INFO  L485      AbstractCegarLoop]: Abstraction has 33 states and 43 transitions.
[2025-04-28 21:21:44,766 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 4 states have (on average 4.25) internal successors, (17), 8 states have internal predecessors, (17), 7 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 7 states have call successors, (12)
[2025-04-28 21:21:44,766 INFO  L278                IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions.
[2025-04-28 21:21:44,766 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 37
[2025-04-28 21:21:44,766 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:44,766 INFO  L218           NwaCegarLoop]: trace histogram [7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:44,770 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:44,967 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:44,967 INFO  L403      AbstractCegarLoop]: === Iteration 14 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:44,967 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:44,967 INFO  L85        PathProgramCache]: Analyzing trace with hash -1723362124, now seen corresponding path program 2 times
[2025-04-28 21:21:44,968 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:44,968 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439383518]
[2025-04-28 21:21:44,968 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:44,968 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:44,974 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes.
[2025-04-28 21:21:44,984 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements.
[2025-04-28 21:21:44,986 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:44,986 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:45,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2025-04-28 21:21:45,110 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:45,110 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439383518]
[2025-04-28 21:21:45,110 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439383518] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:45,110 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494696679]
[2025-04-28 21:21:45,110 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:45,110 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:45,114 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:45,116 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:45,120 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2025-04-28 21:21:45,179 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes.
[2025-04-28 21:21:45,207 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements.
[2025-04-28 21:21:45,207 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:45,207 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:45,209 INFO  L256         TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:45,211 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:45,241 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-04-28 21:21:45,242 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:45,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2025-04-28 21:21:45,849 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [494696679] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:45,849 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:45,849 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9
[2025-04-28 21:21:45,849 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622321127]
[2025-04-28 21:21:45,849 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:45,850 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:21:45,850 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:45,850 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:21:45,850 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:21:45,851 INFO  L87              Difference]: Start difference. First operand 33 states and 43 transitions. Second operand  has 9 states, 4 states have (on average 4.25) internal successors, (17), 9 states have internal predecessors, (17), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12)
[2025-04-28 21:21:45,962 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:45,962 INFO  L93              Difference]: Finished difference Result 37 states and 49 transitions.
[2025-04-28 21:21:45,962 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:45,963 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 4 states have (on average 4.25) internal successors, (17), 9 states have internal predecessors, (17), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) Word has length 36
[2025-04-28 21:21:45,963 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:45,963 INFO  L225             Difference]: With dead ends: 37
[2025-04-28 21:21:45,963 INFO  L226             Difference]: Without dead ends: 37
[2025-04-28 21:21:45,964 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:21:45,964 INFO  L437           NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:45,965 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 71 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:45,965 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37 states.
[2025-04-28 21:21:45,971 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35.
[2025-04-28 21:21:45,973 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 35 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 8 states have call successors, (8), 6 states have call predecessors, (8), 10 states have return successors, (18), 11 states have call predecessors, (18), 8 states have call successors, (18)
[2025-04-28 21:21:45,974 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions.
[2025-04-28 21:21:45,974 INFO  L79                 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 36
[2025-04-28 21:21:45,975 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:45,975 INFO  L485      AbstractCegarLoop]: Abstraction has 35 states and 46 transitions.
[2025-04-28 21:21:45,975 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 4 states have (on average 4.25) internal successors, (17), 9 states have internal predecessors, (17), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12)
[2025-04-28 21:21:45,975 INFO  L278                IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions.
[2025-04-28 21:21:45,975 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2025-04-28 21:21:45,979 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:45,979 INFO  L218           NwaCegarLoop]: trace histogram [8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:45,986 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2025-04-28 21:21:46,180 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2025-04-28 21:21:46,180 INFO  L403      AbstractCegarLoop]: === Iteration 15 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:46,180 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:46,180 INFO  L85        PathProgramCache]: Analyzing trace with hash -86435550, now seen corresponding path program 3 times
[2025-04-28 21:21:46,180 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:46,181 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062604053]
[2025-04-28 21:21:46,181 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:46,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:46,186 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 8 equivalence classes.
[2025-04-28 21:21:46,193 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 40 statements.
[2025-04-28 21:21:46,193 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:46,193 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:46,271 INFO  L134       CoverageAnalysis]: Checked inductivity of 88 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2025-04-28 21:21:46,272 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:46,272 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062604053]
[2025-04-28 21:21:46,272 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062604053] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:46,272 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029119420]
[2025-04-28 21:21:46,272 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:46,272 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:46,275 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:46,277 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:46,281 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2025-04-28 21:21:46,340 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 8 equivalence classes.
[2025-04-28 21:21:46,365 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 40 statements.
[2025-04-28 21:21:46,366 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:46,366 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:46,367 INFO  L256         TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:46,368 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:46,383 INFO  L134       CoverageAnalysis]: Checked inductivity of 88 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked.
[2025-04-28 21:21:46,383 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:46,383 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029119420] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:46,383 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:46,383 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4
[2025-04-28 21:21:46,383 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875581568]
[2025-04-28 21:21:46,383 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:46,384 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:46,384 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:46,384 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:46,387 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:46,387 INFO  L87              Difference]: Start difference. First operand 35 states and 46 transitions. Second operand  has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:46,412 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:46,412 INFO  L93              Difference]: Finished difference Result 19 states and 26 transitions.
[2025-04-28 21:21:46,412 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:46,413 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), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8) Word has length 40
[2025-04-28 21:21:46,413 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:46,413 INFO  L225             Difference]: With dead ends: 19
[2025-04-28 21:21:46,413 INFO  L226             Difference]: Without dead ends: 0
[2025-04-28 21:21:46,413 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:46,414 INFO  L437           NwaCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:46,415 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:46,416 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-04-28 21:21:46,416 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-04-28 21:21:46,416 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-28 21:21:46,417 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-04-28 21:21:46,417 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40
[2025-04-28 21:21:46,417 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:46,417 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-04-28 21:21:46,417 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), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 2 states have call predecessors, (8), 4 states have call successors, (8)
[2025-04-28 21:21:46,417 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-04-28 21:21:46,417 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-04-28 21:21:46,420 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:46,425 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2025-04-28 21:21:46,621 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,13 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:46,626 INFO  L422         BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:46,630 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:46,635 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:46 BoogieIcfgContainer
[2025-04-28 21:21:46,635 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:46,636 INFO  L158              Benchmark]: Toolchain (without parser) took 13057.20ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 163.3MB in the beginning and 60.6MB in the end (delta: 102.8MB). Peak memory consumption was 42.1MB. Max. memory is 33.6GB.
[2025-04-28 21:21:46,636 INFO  L158              Benchmark]: SmtParser took 0.37ms. Allocated memory is still 234.9MB. Free memory is still 170.8MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:46,637 INFO  L158              Benchmark]: ChcToBoogie took 34.78ms. Allocated memory is still 234.9MB. Free memory was 163.3MB in the beginning and 162.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:46,638 INFO  L158              Benchmark]: Boogie Preprocessor took 75.33ms. Allocated memory is still 234.9MB. Free memory was 162.3MB in the beginning and 160.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:46,638 INFO  L158              Benchmark]: RCFGBuilder took 260.74ms. Allocated memory is still 234.9MB. Free memory was 160.0MB in the beginning and 149.8MB in the end (delta: 10.2MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-04-28 21:21:46,638 INFO  L158              Benchmark]: TraceAbstraction took 12677.93ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 149.3MB in the beginning and 60.6MB in the end (delta: 88.7MB). Peak memory consumption was 25.3MB. Max. memory is 33.6GB.
[2025-04-28 21:21:46,642 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.37ms. Allocated memory is still 234.9MB. Free memory is still 170.8MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 34.78ms. Allocated memory is still 234.9MB. Free memory was 163.3MB in the beginning and 162.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 75.33ms. Allocated memory is still 234.9MB. Free memory was 162.3MB in the beginning and 160.0MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 260.74ms. Allocated memory is still 234.9MB. Free memory was 160.0MB in the beginning and 149.8MB in the end (delta: 10.2MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 12677.93ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 149.3MB in the beginning and 60.6MB in the end (delta: 88.7MB). Peak memory consumption was 25.3MB. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Unknown line] : the set of constraint Horn clauses is satisfiable
    For all program executions holds that the set of constraint Horn clauses is satisfiable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 20 locations, 36 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 15, TraceHistogramMax: 8, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 1035 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 700 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 864 IncrementalHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 335 mSDtfsCounter, 864 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 641 GetRequests, 528 SyntacticMatches, 25 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=14, InterpolantAutomatonStates: 84, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 30 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 700 NumberOfCodeBlocks, 664 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 885 ConstructedInterpolants, 0 QuantifiedInterpolants, 1529 SizeOfPredicates, 42 NumberOfNonLiveVariables, 1361 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 35 InterpolantComputations, 7 PerfectInterpolantSequences, 813/1079 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-04-28 21:21:46,665 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
sat
