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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:45,284 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:45,379 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c37fd80-d108-454d-a483-ff58ec2f3ca2/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:45,386 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:45,388 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:45,421 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:45,422 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:45,422 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:45,423 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:45,423 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:45,423 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:45,423 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:45,424 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:45,424 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:45,424 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:45,424 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:45,424 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:45,424 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:45,425 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:45,425 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:45,425 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:45,425 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:45,425 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:45,425 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:45,425 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:45,427 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:45,428 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:45,739 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:45,751 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:45,754 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:45,757 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:45,758 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:45,759 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c37fd80-d108-454d-a483-ff58ec2f3ca2/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-111.smt2
[2025-04-28 21:21:45,761 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:45,765 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:45,968 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2c37fd80-d108-454d-a483-ff58ec2f3ca2/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-111.smt2
[2025-04-28 21:21:45,971 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:45,973 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:45,974 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:45,974 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:45,974 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:45,979 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:45" (1/1) ...
[2025-04-28 21:21:46,005 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46 Unit
[2025-04-28 21:21:46,005 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:46,007 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:46,007 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:46,007 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:46,023 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,024 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,050 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,051 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,054 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,055 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,058 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,058 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,059 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,074 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:46,078 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:46,078 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:46,079 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:46,080 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (1/1) ...
[2025-04-28 21:21:46,082 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:46,096 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:46,112 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:46,116 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:46,131 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:46,131 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:46,131 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:46,131 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure POST given in one single declaration
[2025-04-28 21:21:46,131 INFO  L130     BoogieDeclarations]: Found specification of procedure POST
[2025-04-28 21:21:46,132 INFO  L138     BoogieDeclarations]: Found implementation of procedure POST
[2025-04-28 21:21:46,132 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure PRE given in one single declaration
[2025-04-28 21:21:46,132 INFO  L130     BoogieDeclarations]: Found specification of procedure PRE
[2025-04-28 21:21:46,132 INFO  L138     BoogieDeclarations]: Found implementation of procedure PRE
[2025-04-28 21:21:46,132 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:46,132 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:46,132 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:46,188 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:46,190 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:46,289 INFO  L?                        ?]: Removed 0 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:46,289 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:46,302 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:46,302 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-04-28 21:21:46,303 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:46 BoogieIcfgContainer
[2025-04-28 21:21:46,303 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:46,306 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:46,306 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:46,311 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:46,311 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:45" (1/3) ...
[2025-04-28 21:21:46,312 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b37e712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:46, skipping insertion in model container
[2025-04-28 21:21:46,312 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:46" (2/3) ...
[2025-04-28 21:21:46,312 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b37e712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:46, skipping insertion in model container
[2025-04-28 21:21:46,312 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:46" (3/3) ...
[2025-04-28 21:21:46,313 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:46,331 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:46,333 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 4 procedures, 18 locations, 26 edges, 4 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:46,380 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:46,402 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;@c28b73b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:46,403 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:46,407 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 18 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5)
[2025-04-28 21:21:46,414 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2025-04-28 21:21:46,415 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:46,416 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:46,417 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:46,424 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:46,424 INFO  L85        PathProgramCache]: Analyzing trace with hash 655600984, now seen corresponding path program 1 times
[2025-04-28 21:21:46,434 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:46,436 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214652021]
[2025-04-28 21:21:46,436 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:46,437 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:46,467 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-04-28 21:21:46,488 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-04-28 21:21:46,489 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:46,489 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:46,714 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:46,715 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:46,715 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214652021]
[2025-04-28 21:21:46,718 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214652021] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:46,718 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:46,722 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:46,723 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292611411]
[2025-04-28 21:21:46,724 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:46,731 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:46,731 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:46,762 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:46,763 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:46,765 INFO  L87              Difference]: Start difference. First operand  has 18 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand  has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2025-04-28 21:21:46,879 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:46,879 INFO  L93              Difference]: Finished difference Result 22 states and 27 transitions.
[2025-04-28 21:21:46,884 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:46,885 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 13
[2025-04-28 21:21:46,885 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:46,895 INFO  L225             Difference]: With dead ends: 22
[2025-04-28 21:21:46,895 INFO  L226             Difference]: Without dead ends: 22
[2025-04-28 21:21:46,901 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:46,907 INFO  L437           NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:46,908 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 74 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:46,965 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2025-04-28 21:21:46,994 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20.
[2025-04-28 21:21:46,995 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 11 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8)
[2025-04-28 21:21:47,002 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions.
[2025-04-28 21:21:47,004 INFO  L79                 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13
[2025-04-28 21:21:47,005 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:47,005 INFO  L485      AbstractCegarLoop]: Abstraction has 20 states and 24 transitions.
[2025-04-28 21:21:47,005 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2025-04-28 21:21:47,007 INFO  L278                IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions.
[2025-04-28 21:21:47,008 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:47,009 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:47,009 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:47,010 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:47,010 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:47,011 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:47,011 INFO  L85        PathProgramCache]: Analyzing trace with hash -432325187, now seen corresponding path program 1 times
[2025-04-28 21:21:47,012 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:47,012 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462231241]
[2025-04-28 21:21:47,013 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:47,013 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:47,026 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:47,043 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:47,043 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:47,044 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:47,200 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:47,201 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:47,201 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462231241]
[2025-04-28 21:21:47,201 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462231241] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:47,201 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:47,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:47,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3291317]
[2025-04-28 21:21:47,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:47,203 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:47,203 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:47,205 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:47,206 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:47,206 INFO  L87              Difference]: Start difference. First operand 20 states and 24 transitions. Second operand  has 6 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (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:47,260 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:47,260 INFO  L93              Difference]: Finished difference Result 22 states and 26 transitions.
[2025-04-28 21:21:47,262 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:47,263 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 17
[2025-04-28 21:21:47,263 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:47,264 INFO  L225             Difference]: With dead ends: 22
[2025-04-28 21:21:47,264 INFO  L226             Difference]: Without dead ends: 20
[2025-04-28 21:21:47,264 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:47,265 INFO  L437           NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:47,265 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 87 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:47,269 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20 states.
[2025-04-28 21:21:47,274 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18.
[2025-04-28 21:21:47,275 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18 states, 8 states have (on average 1.25) internal successors, (10), 10 states have internal predecessors, (10), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6)
[2025-04-28 21:21:47,276 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions.
[2025-04-28 21:21:47,277 INFO  L79                 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 17
[2025-04-28 21:21:47,278 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:47,278 INFO  L485      AbstractCegarLoop]: Abstraction has 18 states and 21 transitions.
[2025-04-28 21:21:47,278 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.25) internal successors, (9), 6 states have internal predecessors, (9), 3 states have call successors, (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:47,279 INFO  L278                IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions.
[2025-04-28 21:21:47,280 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:47,280 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:47,280 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:47,281 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:47,281 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:47,282 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:47,282 INFO  L85        PathProgramCache]: Analyzing trace with hash 1473639610, now seen corresponding path program 1 times
[2025-04-28 21:21:47,282 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:47,282 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419303689]
[2025-04-28 21:21:47,283 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:47,283 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:47,294 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:47,313 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:47,317 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:47,317 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:47,617 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:47,617 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:47,617 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419303689]
[2025-04-28 21:21:47,617 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419303689] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:47,617 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641856244]
[2025-04-28 21:21:47,617 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:47,618 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:47,624 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:47,628 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:47,631 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:47,676 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:47,700 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:47,701 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:47,701 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:47,704 INFO  L256         TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:47,714 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:48,178 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:48,178 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:49,347 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:49,347 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641856244] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:49,347 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:49,347 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14
[2025-04-28 21:21:49,348 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705983422]
[2025-04-28 21:21:49,348 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:49,351 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-04-28 21:21:49,351 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:49,352 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-04-28 21:21:49,352 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:49,352 INFO  L87              Difference]: Start difference. First operand 18 states and 21 transitions. Second operand  has 14 states, 8 states have (on average 2.125) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9)
[2025-04-28 21:21:49,545 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:49,546 INFO  L93              Difference]: Finished difference Result 24 states and 28 transitions.
[2025-04-28 21:21:49,548 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:49,549 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 8 states have (on average 2.125) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 17
[2025-04-28 21:21:49,549 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:49,550 INFO  L225             Difference]: With dead ends: 24
[2025-04-28 21:21:49,550 INFO  L226             Difference]: Without dead ends: 24
[2025-04-28 21:21:49,550 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:49,551 INFO  L437           NwaCegarLoop]: 17 mSDtfsCounter, 5 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:49,551 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 118 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:49,552 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2025-04-28 21:21:49,555 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20.
[2025-04-28 21:21:49,555 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 11 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7)
[2025-04-28 21:21:49,556 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions.
[2025-04-28 21:21:49,556 INFO  L79                 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17
[2025-04-28 21:21:49,556 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:49,556 INFO  L485      AbstractCegarLoop]: Abstraction has 20 states and 23 transitions.
[2025-04-28 21:21:49,557 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 8 states have (on average 2.125) internal successors, (17), 14 states have internal predecessors, (17), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9)
[2025-04-28 21:21:49,557 INFO  L278                IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions.
[2025-04-28 21:21:49,557 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2025-04-28 21:21:49,557 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:49,558 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:49,564 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:49,759 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:49,760 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:49,760 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:49,761 INFO  L85        PathProgramCache]: Analyzing trace with hash 230231199, now seen corresponding path program 1 times
[2025-04-28 21:21:49,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:49,761 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448021376]
[2025-04-28 21:21:49,761 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:49,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:49,766 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-04-28 21:21:49,779 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:49,780 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:49,780 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:50,062 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:50,063 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:50,063 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448021376]
[2025-04-28 21:21:50,063 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448021376] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:50,063 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256925428]
[2025-04-28 21:21:50,063 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:50,063 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:50,066 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:50,068 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:50,071 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:50,114 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-04-28 21:21:50,131 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:50,131 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:50,131 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:50,136 INFO  L256         TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:50,137 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:50,329 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:50,330 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:51,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:51,570 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256925428] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:51,570 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:51,570 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21
[2025-04-28 21:21:51,570 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450743819]
[2025-04-28 21:21:51,571 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:51,572 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2025-04-28 21:21:51,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:51,574 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2025-04-28 21:21:51,575 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420
[2025-04-28 21:21:51,576 INFO  L87              Difference]: Start difference. First operand 20 states and 23 transitions. Second operand  has 21 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 20 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 10 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11)
[2025-04-28 21:21:51,811 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:51,811 INFO  L93              Difference]: Finished difference Result 26 states and 29 transitions.
[2025-04-28 21:21:51,812 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:21:51,812 INFO  L79                 Accepts]: Start accepts. Automaton has  has 21 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 20 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 10 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) Word has length 21
[2025-04-28 21:21:51,812 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:51,813 INFO  L225             Difference]: With dead ends: 26
[2025-04-28 21:21:51,813 INFO  L226             Difference]: Without dead ends: 22
[2025-04-28 21:21:51,813 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552
[2025-04-28 21:21:51,814 INFO  L437           NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:51,815 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 172 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:51,815 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2025-04-28 21:21:51,818 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22.
[2025-04-28 21:21:51,818 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22 states, 10 states have (on average 1.2) internal successors, (12), 12 states have internal predecessors, (12), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8)
[2025-04-28 21:21:51,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions.
[2025-04-28 21:21:51,819 INFO  L79                 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 21
[2025-04-28 21:21:51,819 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:51,819 INFO  L485      AbstractCegarLoop]: Abstraction has 22 states and 25 transitions.
[2025-04-28 21:21:51,820 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 20 states have internal predecessors, (24), 11 states have call successors, (11), 1 states have call predecessors, (11), 10 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11)
[2025-04-28 21:21:51,820 INFO  L278                IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions.
[2025-04-28 21:21:51,822 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:51,823 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:51,823 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:51,829 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:21:52,024 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:52,024 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:52,024 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:52,025 INFO  L85        PathProgramCache]: Analyzing trace with hash 408953089, now seen corresponding path program 2 times
[2025-04-28 21:21:52,025 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:52,025 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165182702]
[2025-04-28 21:21:52,025 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:52,025 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:52,032 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes.
[2025-04-28 21:21:52,054 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:52,056 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:52,057 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:52,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:52,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:52,961 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165182702]
[2025-04-28 21:21:52,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165182702] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:52,961 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226124777]
[2025-04-28 21:21:52,962 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:52,962 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:52,965 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:52,967 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:52,971 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:53,021 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes.
[2025-04-28 21:21:53,038 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:53,038 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:53,039 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:53,041 WARN  L254         TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 58 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:53,043 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:53,773 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:53,773 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:57,571 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:57,571 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [226124777] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:57,572 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:57,572 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 25
[2025-04-28 21:21:57,572 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433566344]
[2025-04-28 21:21:57,572 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:57,572 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2025-04-28 21:21:57,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:57,573 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2025-04-28 21:21:57,574 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600
[2025-04-28 21:21:57,575 INFO  L87              Difference]: Start difference. First operand 22 states and 25 transitions. Second operand  has 25 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 25 states have internal predecessors, (28), 13 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16)
[2025-04-28 21:21:58,305 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:58,306 INFO  L93              Difference]: Finished difference Result 36 states and 46 transitions.
[2025-04-28 21:21:58,306 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-04-28 21:21:58,307 INFO  L79                 Accepts]: Start accepts. Automaton has  has 25 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 25 states have internal predecessors, (28), 13 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16) Word has length 25
[2025-04-28 21:21:58,307 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:58,308 INFO  L225             Difference]: With dead ends: 36
[2025-04-28 21:21:58,308 INFO  L226             Difference]: Without dead ends: 34
[2025-04-28 21:21:58,309 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=142, Invalid=980, Unknown=0, NotChecked=0, Total=1122
[2025-04-28 21:21:58,310 INFO  L437           NwaCegarLoop]: 16 mSDtfsCounter, 14 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:58,310 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 214 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:58,311 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2025-04-28 21:21:58,317 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32.
[2025-04-28 21:21:58,318 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 32 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 4 states have call predecessors, (6), 10 states have return successors, (16), 10 states have call predecessors, (16), 6 states have call successors, (16)
[2025-04-28 21:21:58,319 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions.
[2025-04-28 21:21:58,319 INFO  L79                 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 25
[2025-04-28 21:21:58,319 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:58,319 INFO  L485      AbstractCegarLoop]: Abstraction has 32 states and 40 transitions.
[2025-04-28 21:21:58,319 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 25 states have internal predecessors, (28), 13 states have call successors, (14), 1 states have call predecessors, (14), 12 states have return successors, (16), 10 states have call predecessors, (16), 13 states have call successors, (16)
[2025-04-28 21:21:58,319 INFO  L278                IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions.
[2025-04-28 21:21:58,320 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 30
[2025-04-28 21:21:58,321 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:58,321 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:58,326 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:58,524 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:58,525 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:58,525 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:58,525 INFO  L85        PathProgramCache]: Analyzing trace with hash 1673851686, now seen corresponding path program 3 times
[2025-04-28 21:21:58,525 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:58,525 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407288056]
[2025-04-28 21:21:58,525 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:58,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:58,531 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes.
[2025-04-28 21:21:58,539 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:58,540 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:58,540 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:58,772 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:58,772 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:58,772 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407288056]
[2025-04-28 21:21:58,772 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407288056] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:58,772 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124701452]
[2025-04-28 21:21:58,772 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:58,772 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:58,775 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:58,777 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:58,781 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:58,833 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 3 equivalence classes.
[2025-04-28 21:21:58,855 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 29 statements.
[2025-04-28 21:21:58,855 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2025-04-28 21:21:58,855 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:58,857 INFO  L256         TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 31 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:58,859 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:59,021 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:21:59,021 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:59,915 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:59,915 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [124701452] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:59,915 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:59,915 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 28
[2025-04-28 21:21:59,915 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827887997]
[2025-04-28 21:21:59,915 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:59,916 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2025-04-28 21:21:59,916 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:59,917 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2025-04-28 21:21:59,917 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756
[2025-04-28 21:21:59,917 INFO  L87              Difference]: Start difference. First operand 32 states and 40 transitions. Second operand  has 28 states, 16 states have (on average 1.9375) internal successors, (31), 27 states have internal predecessors, (31), 13 states have call successors, (13), 1 states have call predecessors, (13), 15 states have return successors, (17), 12 states have call predecessors, (17), 13 states have call successors, (17)
[2025-04-28 21:22:00,181 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:00,181 INFO  L93              Difference]: Finished difference Result 34 states and 39 transitions.
[2025-04-28 21:22:00,182 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:22:00,182 INFO  L79                 Accepts]: Start accepts. Automaton has  has 28 states, 16 states have (on average 1.9375) internal successors, (31), 27 states have internal predecessors, (31), 13 states have call successors, (13), 1 states have call predecessors, (13), 15 states have return successors, (17), 12 states have call predecessors, (17), 13 states have call successors, (17) Word has length 29
[2025-04-28 21:22:00,183 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:00,183 INFO  L225             Difference]: With dead ends: 34
[2025-04-28 21:22:00,183 INFO  L226             Difference]: Without dead ends: 28
[2025-04-28 21:22:00,184 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=984, Unknown=0, NotChecked=0, Total=1122
[2025-04-28 21:22:00,185 INFO  L437           NwaCegarLoop]: 19 mSDtfsCounter, 16 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:00,186 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 245 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:22:00,186 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2025-04-28 21:22:00,190 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28.
[2025-04-28 21:22:00,190 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10)
[2025-04-28 21:22:00,191 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions.
[2025-04-28 21:22:00,191 INFO  L79                 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 29
[2025-04-28 21:22:00,191 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:00,191 INFO  L485      AbstractCegarLoop]: Abstraction has 28 states and 32 transitions.
[2025-04-28 21:22:00,192 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 16 states have (on average 1.9375) internal successors, (31), 27 states have internal predecessors, (31), 13 states have call successors, (13), 1 states have call predecessors, (13), 15 states have return successors, (17), 12 states have call predecessors, (17), 13 states have call successors, (17)
[2025-04-28 21:22:00,192 INFO  L278                IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions.
[2025-04-28 21:22:00,193 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:22:00,193 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:00,193 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:00,197 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-04-28 21:22:00,394 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:00,395 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:00,395 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:00,395 INFO  L85        PathProgramCache]: Analyzing trace with hash -582757240, now seen corresponding path program 4 times
[2025-04-28 21:22:00,395 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:00,395 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392102061]
[2025-04-28 21:22:00,395 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:22:00,395 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:00,400 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes.
[2025-04-28 21:22:00,424 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:22:00,424 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:22:00,424 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:01,784 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-04-28 21:22:01,784 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:01,784 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392102061]
[2025-04-28 21:22:01,784 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392102061] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:01,784 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955149918]
[2025-04-28 21:22:01,785 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:22:01,785 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:01,788 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:01,790 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:22:01,793 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:22:01,858 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes.
[2025-04-28 21:22:01,878 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:22:01,879 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s)
[2025-04-28 21:22:01,879 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:01,881 WARN  L254         TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 78 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:01,883 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:02,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2025-04-28 21:22:02,776 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:10,191 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2025-04-28 21:22:10,191 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [955149918] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:10,191 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:10,191 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 16] total 34
[2025-04-28 21:22:10,192 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763677954]
[2025-04-28 21:22:10,192 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:10,192 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2025-04-28 21:22:10,192 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:10,193 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2025-04-28 21:22:10,194 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1011, Unknown=0, NotChecked=0, Total=1122
[2025-04-28 21:22:10,194 INFO  L87              Difference]: Start difference. First operand 28 states and 32 transitions. Second operand  has 34 states, 17 states have (on average 2.176470588235294) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (19), 1 states have call predecessors, (19), 16 states have return successors, (22), 14 states have call predecessors, (22), 18 states have call successors, (22)
[2025-04-28 21:22:11,748 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:11,748 INFO  L93              Difference]: Finished difference Result 51 states and 65 transitions.
[2025-04-28 21:22:11,748 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2025-04-28 21:22:11,749 INFO  L79                 Accepts]: Start accepts. Automaton has  has 34 states, 17 states have (on average 2.176470588235294) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (19), 1 states have call predecessors, (19), 16 states have return successors, (22), 14 states have call predecessors, (22), 18 states have call successors, (22) Word has length 33
[2025-04-28 21:22:11,749 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:11,750 INFO  L225             Difference]: With dead ends: 51
[2025-04-28 21:22:11,750 INFO  L226             Difference]: Without dead ends: 42
[2025-04-28 21:22:11,751 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=319, Invalid=2333, Unknown=0, NotChecked=0, Total=2652
[2025-04-28 21:22:11,752 INFO  L437           NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:11,752 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 239 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-04-28 21:22:11,753 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2025-04-28 21:22:11,759 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38.
[2025-04-28 21:22:11,759 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 13 states have return successors, (17), 13 states have call predecessors, (17), 6 states have call successors, (17)
[2025-04-28 21:22:11,760 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions.
[2025-04-28 21:22:11,760 INFO  L79                 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 33
[2025-04-28 21:22:11,760 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:11,761 INFO  L485      AbstractCegarLoop]: Abstraction has 38 states and 43 transitions.
[2025-04-28 21:22:11,761 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 34 states, 17 states have (on average 2.176470588235294) internal successors, (37), 34 states have internal predecessors, (37), 18 states have call successors, (19), 1 states have call predecessors, (19), 16 states have return successors, (22), 14 states have call predecessors, (22), 18 states have call successors, (22)
[2025-04-28 21:22:11,761 INFO  L278                IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions.
[2025-04-28 21:22:11,762 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 38
[2025-04-28 21:22:11,762 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:11,762 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:11,770 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-04-28 21:22:11,963 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:11,963 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:11,964 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:11,964 INFO  L85        PathProgramCache]: Analyzing trace with hash -1892314899, now seen corresponding path program 5 times
[2025-04-28 21:22:11,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:11,964 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426246463]
[2025-04-28 21:22:11,964 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-04-28 21:22:11,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:11,970 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes.
[2025-04-28 21:22:11,985 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements.
[2025-04-28 21:22:11,985 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s)
[2025-04-28 21:22:11,985 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:12,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-04-28 21:22:12,364 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:12,364 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426246463]
[2025-04-28 21:22:12,364 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426246463] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:12,365 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873422503]
[2025-04-28 21:22:12,365 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-04-28 21:22:12,365 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:12,368 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:12,370 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:22:12,374 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:22:12,447 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 37 statements into 4 equivalence classes.
[2025-04-28 21:22:12,473 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 37 of 37 statements.
[2025-04-28 21:22:12,473 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s)
[2025-04-28 21:22:12,473 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:12,475 INFO  L256         TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 41 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:12,478 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:12,540 INFO  L134       CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2025-04-28 21:22:12,540 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:14,095 INFO  L134       CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:22:14,095 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [873422503] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:14,095 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:14,096 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 18] total 25
[2025-04-28 21:22:14,096 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063153107]
[2025-04-28 21:22:14,096 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:14,096 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2025-04-28 21:22:14,097 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:14,097 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2025-04-28 21:22:14,098 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600
[2025-04-28 21:22:14,098 INFO  L87              Difference]: Start difference. First operand 38 states and 43 transitions. Second operand  has 25 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 1 states have call predecessors, (12), 13 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16)
[2025-04-28 21:22:14,460 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:14,461 INFO  L93              Difference]: Finished difference Result 42 states and 46 transitions.
[2025-04-28 21:22:14,461 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-04-28 21:22:14,462 INFO  L79                 Accepts]: Start accepts. Automaton has  has 25 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 1 states have call predecessors, (12), 13 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16) Word has length 37
[2025-04-28 21:22:14,462 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:14,464 INFO  L225             Difference]: With dead ends: 42
[2025-04-28 21:22:14,467 INFO  L226             Difference]: Without dead ends: 40
[2025-04-28 21:22:14,468 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992
[2025-04-28 21:22:14,469 INFO  L437           NwaCegarLoop]: 21 mSDtfsCounter, 14 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:14,469 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 250 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:22:14,470 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40 states.
[2025-04-28 21:22:14,477 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36.
[2025-04-28 21:22:14,481 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 36 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 12 states have return successors, (15), 12 states have call predecessors, (15), 6 states have call successors, (15)
[2025-04-28 21:22:14,482 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions.
[2025-04-28 21:22:14,483 INFO  L79                 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 37
[2025-04-28 21:22:14,483 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:14,483 INFO  L485      AbstractCegarLoop]: Abstraction has 36 states and 40 transitions.
[2025-04-28 21:22:14,483 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 24 states have internal predecessors, (27), 12 states have call successors, (12), 1 states have call predecessors, (12), 13 states have return successors, (16), 11 states have call predecessors, (16), 12 states have call successors, (16)
[2025-04-28 21:22:14,483 INFO  L278                IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions.
[2025-04-28 21:22:14,484 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-04-28 21:22:14,484 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:14,484 INFO  L218           NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:14,491 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-04-28 21:22:14,685 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:14,685 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:14,687 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:14,687 INFO  L85        PathProgramCache]: Analyzing trace with hash 132071247, now seen corresponding path program 6 times
[2025-04-28 21:22:14,687 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:14,687 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905936876]
[2025-04-28 21:22:14,688 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-04-28 21:22:14,688 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:14,698 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 5 equivalence classes.
[2025-04-28 21:22:14,779 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 41 of 41 statements.
[2025-04-28 21:22:14,779 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s)
[2025-04-28 21:22:14,779 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
