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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:12:47,464 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:12:47,550 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9fccb9-63ba-4d25-a8b0-b6f63e921964/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:12:47,555 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:12:47,555 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:12:47,575 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:12:47,576 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:12:47,576 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:12:47,577 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:12:47,577 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:12:47,577 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:12:47,577 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:12:47,577 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:12:47,577 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:12:47,578 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:12:47,578 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:12:47,578 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:12:47,578 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:12:47,578 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:12:47,578 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:12:47,578 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:12:47,578 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:12:47,579 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:12:47,579 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:12:47,579 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:12:47,582 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:12:47,582 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:12:47,938 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:12:47,953 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:12:47,955 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:12:47,959 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:12:47,959 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:12:47,961 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9fccb9-63ba-4d25-a8b0-b6f63e921964/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin-Arrays/chc-comp24-LIA-Lin-Arrays-121.smt2
[2025-04-28 21:12:47,964 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:12:47,968 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:12:48,193 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2b9fccb9-63ba-4d25-a8b0-b6f63e921964/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin-Arrays/chc-comp24-LIA-Lin-Arrays-121.smt2
[2025-04-28 21:12:48,197 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:12:48,198 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:12:48,199 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:12:48,199 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:12:48,199 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:12:48,206 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:12:48" (1/1) ...
[2025-04-28 21:12:48,234 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:12:48 Unit
[2025-04-28 21:12:48,235 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:12:48,237 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:12:48,237 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:12:48,237 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:12:48,253 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:12:48" (1/1) ...
[2025-04-28 21:12:48,253 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:12:48" (1/1) ...
[2025-04-28 21:12:48,288 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:12:48" (1/1) ...
[2025-04-28 21:12:48,289 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:12:48" (1/1) ...
[2025-04-28 21:12:48,293 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:12:48" (1/1) ...
[2025-04-28 21:12:48,296 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:12:48" (1/1) ...
[2025-04-28 21:12:48,298 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:12:48" (1/1) ...
[2025-04-28 21:12:48,300 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:12:48" (1/1) ...
[2025-04-28 21:12:48,301 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:12:48" (1/1) ...
[2025-04-28 21:12:48,322 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:12:48,325 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:12:48,325 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:12:48,325 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:12:48,326 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:12:48" (1/1) ...
[2025-04-28 21:12:48,330 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:12:48,350 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:12:48,366 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:12:48,370 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:12:48,387 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:12:48,387 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:12:48,387 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:12:48,387 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure END_QUERY given in one single declaration
[2025-04-28 21:12:48,387 INFO  L130     BoogieDeclarations]: Found specification of procedure END_QUERY
[2025-04-28 21:12:48,388 INFO  L138     BoogieDeclarations]: Found implementation of procedure END_QUERY
[2025-04-28 21:12:48,388 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_MAIN_0 given in one single declaration
[2025-04-28 21:12:48,388 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_MAIN_0
[2025-04-28 21:12:48,388 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_MAIN_0
[2025-04-28 21:12:48,388 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:12:48,388 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:12:48,388 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:12:48,437 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:12:48,439 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:12:48,548 INFO  L?                        ?]: Removed 0 outVars from TransFormulas that were not future-live.
[2025-04-28 21:12:48,548 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:12:48,560 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:12:48,561 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-04-28 21:12:48,561 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:12:48 BoogieIcfgContainer
[2025-04-28 21:12:48,564 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:12:48,568 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:12:48,568 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:12:48,574 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:12:48,575 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:12:48" (1/3) ...
[2025-04-28 21:12:48,575 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5d2519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:12:48, skipping insertion in model container
[2025-04-28 21:12:48,576 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:12:48" (2/3) ...
[2025-04-28 21:12:48,576 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5d2519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:12:48, skipping insertion in model container
[2025-04-28 21:12:48,576 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:12:48" (3/3) ...
[2025-04-28 21:12:48,578 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:12:48,597 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:12:48,600 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 4 procedures, 18 locations, 29 edges, 4 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:12:48,660 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:12:48,672 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;@66b67aa5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:12:48,673 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:12:48,677 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 18 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 11 states have internal predecessors, (11), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6)
[2025-04-28 21:12:48,685 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2025-04-28 21:12:48,685 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:12:48,685 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:12:48,686 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:12:48,691 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:12:48,693 INFO  L85        PathProgramCache]: Analyzing trace with hash 1494436889, now seen corresponding path program 1 times
[2025-04-28 21:12:48,702 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:12:48,703 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834535130]
[2025-04-28 21:12:48,703 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:12:48,703 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:12:48,742 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-04-28 21:12:48,762 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-04-28 21:12:48,763 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:12:48,763 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:12:49,089 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:12:49,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:12:49,090 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834535130]
[2025-04-28 21:12:49,090 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834535130] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:12:49,091 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:12:49,093 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:12:49,095 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008431265]
[2025-04-28 21:12:49,096 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:12:49,099 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:12:49,100 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:12:49,125 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:12:49,126 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:12:49,127 INFO  L87              Difference]: Start difference. First operand  has 18 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 11 states have internal predecessors, (11), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Second operand  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-04-28 21:12:49,226 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:12:49,227 INFO  L93              Difference]: Finished difference Result 18 states and 25 transitions.
[2025-04-28 21:12:49,230 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:12:49,232 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 12
[2025-04-28 21:12:49,232 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:12:49,242 INFO  L225             Difference]: With dead ends: 18
[2025-04-28 21:12:49,243 INFO  L226             Difference]: Without dead ends: 18
[2025-04-28 21:12:49,244 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:12:49,252 INFO  L437           NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:12:49,253 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:12:49,269 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18 states.
[2025-04-28 21:12:49,288 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18.
[2025-04-28 21:12:49,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 18 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 10 states have internal predecessors, (10), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (9), 4 states have call predecessors, (9), 6 states have call successors, (9)
[2025-04-28 21:12:49,295 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions.
[2025-04-28 21:12:49,296 INFO  L79                 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 12
[2025-04-28 21:12:49,297 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:12:49,297 INFO  L485      AbstractCegarLoop]: Abstraction has 18 states and 25 transitions.
[2025-04-28 21:12:49,297 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-04-28 21:12:49,297 INFO  L278                IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions.
[2025-04-28 21:12:49,299 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:12:49,299 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:12:49,299 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:12:49,299 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:12:49,299 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:12:49,300 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:12:49,300 INFO  L85        PathProgramCache]: Analyzing trace with hash -2091930205, now seen corresponding path program 1 times
[2025-04-28 21:12:49,300 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:12:49,300 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424086453]
[2025-04-28 21:12:49,301 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:12:49,301 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:12:49,310 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:12:49,359 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:12:49,359 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:12:49,359 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:12:49,981 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:12:49,981 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:12:49,981 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424086453]
[2025-04-28 21:12:49,982 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424086453] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:12:49,982 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965048973]
[2025-04-28 21:12:49,982 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:12:49,982 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:12:49,989 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:12:49,995 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:12:49,996 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:12:50,053 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:12:50,086 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:12:50,086 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:12:50,086 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:12:50,089 WARN  L254         TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 44 conjuncts are in the unsatisfiable core
[2025-04-28 21:12:50,095 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:12:50,376 INFO  L325             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2025-04-28 21:12:50,377 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 16
[2025-04-28 21:12:50,425 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:12:50,426 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:12:51,539 INFO  L325             Elim1Store]: treesize reduction 17, result has 50.0 percent of original size
[2025-04-28 21:12:51,540 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 21
[2025-04-28 21:12:51,743 INFO  L325             Elim1Store]: treesize reduction 33, result has 2.9 percent of original size
[2025-04-28 21:12:51,744 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1
[2025-04-28 21:12:51,749 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:12:51,749 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965048973] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:12:51,749 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:12:51,749 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9
[2025-04-28 21:12:51,750 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130249625]
[2025-04-28 21:12:51,750 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:12:51,750 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-04-28 21:12:51,751 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:12:51,751 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-04-28 21:12:51,751 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2025-04-28 21:12:51,752 INFO  L87              Difference]: Start difference. First operand 18 states and 25 transitions. Second operand  has 9 states, 4 states have (on average 2.75) internal successors, (11), 8 states have internal predecessors, (11), 6 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 6 states have call successors, (7)
[2025-04-28 21:12:51,893 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:12:51,893 INFO  L93              Difference]: Finished difference Result 22 states and 34 transitions.
[2025-04-28 21:12:51,894 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:12:51,894 INFO  L79                 Accepts]: Start accepts. Automaton has  has 9 states, 4 states have (on average 2.75) internal successors, (11), 8 states have internal predecessors, (11), 6 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 6 states have call successors, (7) Word has length 16
[2025-04-28 21:12:51,894 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:12:51,895 INFO  L225             Difference]: With dead ends: 22
[2025-04-28 21:12:51,895 INFO  L226             Difference]: Without dead ends: 22
[2025-04-28 21:12:51,895 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:12:51,896 INFO  L437           NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:12:51,897 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 57 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:12:51,897 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2025-04-28 21:12:51,903 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20.
[2025-04-28 21:12:51,903 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12)
[2025-04-28 21:12:51,904 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions.
[2025-04-28 21:12:51,904 INFO  L79                 Accepts]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 16
[2025-04-28 21:12:51,904 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:12:51,904 INFO  L485      AbstractCegarLoop]: Abstraction has 20 states and 29 transitions.
[2025-04-28 21:12:51,904 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 4 states have (on average 2.75) internal successors, (11), 8 states have internal predecessors, (11), 6 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 6 states have call successors, (7)
[2025-04-28 21:12:51,905 INFO  L278                IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions.
[2025-04-28 21:12:51,905 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:12:51,905 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:12:51,906 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:12:51,912 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-04-28 21:12:52,110 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:12:52,110 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:12:52,111 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:12:52,111 INFO  L85        PathProgramCache]: Analyzing trace with hash -1554798658, now seen corresponding path program 1 times
[2025-04-28 21:12:52,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:12:52,111 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422326782]
[2025-04-28 21:12:52,111 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:12:52,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:12:52,121 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:12:52,126 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:12:52,126 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:12:52,126 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:12:52,195 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:12:52,196 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:12:52,196 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422326782]
[2025-04-28 21:12:52,196 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422326782] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:12:52,196 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:12:52,196 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:12:52,196 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149103937]
[2025-04-28 21:12:52,196 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:12:52,197 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:12:52,197 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:12:52,197 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:12:52,197 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:12:52,197 INFO  L87              Difference]: Start difference. First operand 20 states and 29 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:12:52,262 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:12:52,262 INFO  L93              Difference]: Finished difference Result 22 states and 33 transitions.
[2025-04-28 21:12:52,263 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:12:52,263 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 16
[2025-04-28 21:12:52,263 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:12:52,264 INFO  L225             Difference]: With dead ends: 22
[2025-04-28 21:12:52,264 INFO  L226             Difference]: Without dead ends: 22
[2025-04-28 21:12:52,264 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:12:52,265 INFO  L437           NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:12:52,265 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:12:52,266 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2025-04-28 21:12:52,270 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20.
[2025-04-28 21:12:52,270 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11)
[2025-04-28 21:12:52,271 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions.
[2025-04-28 21:12:52,271 INFO  L79                 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 16
[2025-04-28 21:12:52,271 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:12:52,272 INFO  L485      AbstractCegarLoop]: Abstraction has 20 states and 28 transitions.
[2025-04-28 21:12:52,272 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:12:52,272 INFO  L278                IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions.
[2025-04-28 21:12:52,273 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:12:52,273 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:12:52,273 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:12:52,273 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:12:52,273 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:12:52,274 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:12:52,274 INFO  L85        PathProgramCache]: Analyzing trace with hash -1275832549, now seen corresponding path program 1 times
[2025-04-28 21:12:52,274 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:12:52,274 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695027131]
[2025-04-28 21:12:52,274 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:12:52,274 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:12:52,279 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:12:52,282 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:12:52,282 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:12:52,282 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:12:52,345 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:12:52,345 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:12:52,345 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695027131]
[2025-04-28 21:12:52,345 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695027131] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:12:52,346 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:12:52,346 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:12:52,346 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417011621]
[2025-04-28 21:12:52,346 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:12:52,346 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:12:52,346 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:12:52,347 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:12:52,347 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:12:52,347 INFO  L87              Difference]: Start difference. First operand 20 states and 28 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:12:52,398 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:12:52,398 INFO  L93              Difference]: Finished difference Result 22 states and 32 transitions.
[2025-04-28 21:12:52,398 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:12:52,398 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 16
[2025-04-28 21:12:52,399 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:12:52,399 INFO  L225             Difference]: With dead ends: 22
[2025-04-28 21:12:52,399 INFO  L226             Difference]: Without dead ends: 22
[2025-04-28 21:12:52,400 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:12:52,400 INFO  L437           NwaCegarLoop]: 20 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:12:52,401 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 41 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:12:52,401 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2025-04-28 21:12:52,405 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20.
[2025-04-28 21:12:52,405 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10)
[2025-04-28 21:12:52,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions.
[2025-04-28 21:12:52,406 INFO  L79                 Accepts]: Start accepts. Automaton has 20 states and 27 transitions. Word has length 16
[2025-04-28 21:12:52,406 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:12:52,406 INFO  L485      AbstractCegarLoop]: Abstraction has 20 states and 27 transitions.
[2025-04-28 21:12:52,406 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4)
[2025-04-28 21:12:52,407 INFO  L278                IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions.
[2025-04-28 21:12:52,407 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:12:52,407 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:12:52,407 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:12:52,408 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:12:52,408 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:12:52,408 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:12:52,408 INFO  L85        PathProgramCache]: Analyzing trace with hash 1772701128, now seen corresponding path program 1 times
[2025-04-28 21:12:52,408 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:12:52,408 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080505674]
[2025-04-28 21:12:52,409 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:12:52,409 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:12:52,415 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:12:52,433 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:12:52,435 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:12:52,435 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:12:52,873 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:12:52,874 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:12:52,874 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080505674]
[2025-04-28 21:12:52,874 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080505674] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:12:52,874 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133536318]
[2025-04-28 21:12:52,874 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:12:52,874 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:12:52,877 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:12:52,879 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:12:52,882 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:12:52,933 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:12:52,953 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:12:52,953 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:12:52,953 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:12:52,955 INFO  L256         TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 34 conjuncts are in the unsatisfiable core
[2025-04-28 21:12:52,958 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:12:53,069 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:12:53,088 INFO  L325             Elim1Store]: treesize reduction 48, result has 12.7 percent of original size
[2025-04-28 21:12:53,089 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 26
[2025-04-28 21:12:53,134 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:12:53,135 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:12:54,109 INFO  L325             Elim1Store]: treesize reduction 21, result has 41.7 percent of original size
[2025-04-28 21:12:54,110 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 19
[2025-04-28 21:12:54,141 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133536318] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:12:54,141 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-04-28 21:12:54,141 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10
[2025-04-28 21:12:54,141 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077563154]
[2025-04-28 21:12:54,142 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:12:54,142 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:12:54,142 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:12:54,143 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:12:54,143 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:12:54,143 INFO  L87              Difference]: Start difference. First operand 20 states and 27 transitions. Second operand  has 10 states, 5 states have (on average 2.8) internal successors, (14), 10 states have internal predecessors, (14), 6 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8)
[2025-04-28 21:12:54,345 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:12:54,345 INFO  L93              Difference]: Finished difference Result 24 states and 36 transitions.
[2025-04-28 21:12:54,346 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:12:54,346 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 5 states have (on average 2.8) internal successors, (14), 10 states have internal predecessors, (14), 6 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 20
[2025-04-28 21:12:54,346 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:12:54,347 INFO  L225             Difference]: With dead ends: 24
[2025-04-28 21:12:54,347 INFO  L226             Difference]: Without dead ends: 24
[2025-04-28 21:12:54,347 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:12:54,348 INFO  L437           NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:12:54,348 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 121 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:12:54,349 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2025-04-28 21:12:54,353 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20.
[2025-04-28 21:12:54,353 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 8 states have (on average 1.375) internal successors, (11), 11 states have internal predecessors, (11), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9)
[2025-04-28 21:12:54,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions.
[2025-04-28 21:12:54,354 INFO  L79                 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 20
[2025-04-28 21:12:54,354 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:12:54,354 INFO  L485      AbstractCegarLoop]: Abstraction has 20 states and 26 transitions.
[2025-04-28 21:12:54,354 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 5 states have (on average 2.8) internal successors, (14), 10 states have internal predecessors, (14), 6 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8)
[2025-04-28 21:12:54,354 INFO  L278                IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions.
[2025-04-28 21:12:54,355 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:12:54,355 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:12:54,355 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:12:54,360 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:12:54,559 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:12:54,559 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:12:54,560 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:12:54,560 INFO  L85        PathProgramCache]: Analyzing trace with hash 2119615021, now seen corresponding path program 2 times
[2025-04-28 21:12:54,560 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:12:54,560 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036844071]
[2025-04-28 21:12:54,560 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:12:54,560 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:12:54,568 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes.
[2025-04-28 21:12:54,582 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:12:54,582 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:12:54,582 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:12:55,054 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:12:55,055 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:12:55,055 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036844071]
[2025-04-28 21:12:55,055 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036844071] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:12:55,055 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751963758]
[2025-04-28 21:12:55,055 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:12:55,055 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:12:55,058 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:12:55,060 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:12:55,064 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:12:55,115 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes.
[2025-04-28 21:12:55,138 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:12:55,139 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:12:55,139 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:12:55,141 WARN  L254         TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 64 conjuncts are in the unsatisfiable core
[2025-04-28 21:12:55,147 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:12:55,378 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:12:55,399 INFO  L325             Elim1Store]: treesize reduction 40, result has 14.9 percent of original size
[2025-04-28 21:12:55,401 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 34
[2025-04-28 21:12:55,624 INFO  L325             Elim1Store]: treesize reduction 234, result has 5.3 percent of original size
[2025-04-28 21:12:55,624 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 76 treesize of output 141
[2025-04-28 21:12:55,836 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 39
[2025-04-28 21:12:55,891 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:12:55,891 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:12:57,708 INFO  L325             Elim1Store]: treesize reduction 164, result has 28.4 percent of original size
[2025-04-28 21:12:57,708 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 113 treesize of output 131
[2025-04-28 21:12:57,774 INFO  L325             Elim1Store]: treesize reduction 16, result has 60.0 percent of original size
[2025-04-28 21:12:57,774 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 55
[2025-04-28 21:12:58,181 INFO  L325             Elim1Store]: treesize reduction 17, result has 50.0 percent of original size
[2025-04-28 21:12:58,182 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 21
[2025-04-28 21:12:58,438 INFO  L325             Elim1Store]: treesize reduction 33, result has 2.9 percent of original size
[2025-04-28 21:12:58,438 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1
[2025-04-28 21:12:58,464 INFO  L325             Elim1Store]: treesize reduction 86, result has 1.1 percent of original size
[2025-04-28 21:12:58,465 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 35 treesize of output 1
[2025-04-28 21:12:58,469 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:12:58,469 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751963758] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:12:58,469 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:12:58,469 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 13
[2025-04-28 21:12:58,469 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160094515]
[2025-04-28 21:12:58,469 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:12:58,470 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-28 21:12:58,470 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:12:58,470 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-28 21:12:58,470 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:12:58,471 INFO  L87              Difference]: Start difference. First operand 20 states and 26 transitions. Second operand  has 13 states, 5 states have (on average 3.0) internal successors, (15), 12 states have internal predecessors, (15), 9 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 9 states have call successors, (10)
[2025-04-28 21:12:58,688 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:12:58,688 INFO  L93              Difference]: Finished difference Result 24 states and 35 transitions.
[2025-04-28 21:12:58,689 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:12:58,689 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 5 states have (on average 3.0) internal successors, (15), 12 states have internal predecessors, (15), 9 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 9 states have call successors, (10) Word has length 20
[2025-04-28 21:12:58,690 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:12:58,690 INFO  L225             Difference]: With dead ends: 24
[2025-04-28 21:12:58,691 INFO  L226             Difference]: Without dead ends: 24
[2025-04-28 21:12:58,691 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:12:58,691 INFO  L437           NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:12:58,692 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 122 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:12:58,692 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2025-04-28 21:12:58,696 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22.
[2025-04-28 21:12:58,696 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 12 states have internal predecessors, (12), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12)
[2025-04-28 21:12:58,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions.
[2025-04-28 21:12:58,697 INFO  L79                 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 20
[2025-04-28 21:12:58,697 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:12:58,698 INFO  L485      AbstractCegarLoop]: Abstraction has 22 states and 30 transitions.
[2025-04-28 21:12:58,698 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 5 states have (on average 3.0) internal successors, (15), 12 states have internal predecessors, (15), 9 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (10), 4 states have call predecessors, (10), 9 states have call successors, (10)
[2025-04-28 21:12:58,698 INFO  L278                IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions.
[2025-04-28 21:12:58,699 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:12:58,699 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:12:58,699 INFO  L218           NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:12:58,704 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-04-28 21:12:58,899 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:12:58,899 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:12:58,900 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:12:58,900 INFO  L85        PathProgramCache]: Analyzing trace with hash -1848111707, now seen corresponding path program 1 times
[2025-04-28 21:12:58,900 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:12:58,900 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603495089]
[2025-04-28 21:12:58,900 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:12:58,900 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:12:58,906 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:12:58,928 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:12:58,929 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:12:58,929 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:12:59,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:12:59,220 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:12:59,220 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603495089]
[2025-04-28 21:12:59,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603495089] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:12:59,220 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048778864]
[2025-04-28 21:12:59,220 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:12:59,220 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:12:59,223 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:12:59,225 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:12:59,229 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:12:59,280 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:12:59,295 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:12:59,295 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:12:59,295 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:12:59,298 INFO  L256         TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 36 conjuncts are in the unsatisfiable core
[2025-04-28 21:12:59,300 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:12:59,386 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:12:59,401 INFO  L325             Elim1Store]: treesize reduction 48, result has 12.7 percent of original size
[2025-04-28 21:12:59,402 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 26
[2025-04-28 21:12:59,433 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:12:59,434 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:13:00,308 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2025-04-28 21:13:00,337 INFO  L325             Elim1Store]: treesize reduction 42, result has 37.3 percent of original size
[2025-04-28 21:13:00,338 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 38
[2025-04-28 21:13:00,375 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048778864] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:13:00,375 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-04-28 21:13:00,375 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10
[2025-04-28 21:13:00,375 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234396549]
[2025-04-28 21:13:00,375 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:13:00,376 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:13:00,376 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:13:00,376 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:13:00,376 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:13:00,377 INFO  L87              Difference]: Start difference. First operand 22 states and 30 transitions. Second operand  has 10 states, 5 states have (on average 2.8) internal successors, (14), 10 states have internal predecessors, (14), 6 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8)
[2025-04-28 21:13:00,519 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:13:00,519 INFO  L93              Difference]: Finished difference Result 26 states and 39 transitions.
[2025-04-28 21:13:00,519 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:13:00,520 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 5 states have (on average 2.8) internal successors, (14), 10 states have internal predecessors, (14), 6 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8) Word has length 20
[2025-04-28 21:13:00,520 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:13:00,520 INFO  L225             Difference]: With dead ends: 26
[2025-04-28 21:13:00,521 INFO  L226             Difference]: Without dead ends: 26
[2025-04-28 21:13:00,521 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132
[2025-04-28 21:13:00,522 INFO  L437           NwaCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:13:00,522 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 95 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:13:00,523 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2025-04-28 21:13:00,531 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22.
[2025-04-28 21:13:00,531 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 12 states have internal predecessors, (12), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11)
[2025-04-28 21:13:00,532 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions.
[2025-04-28 21:13:00,532 INFO  L79                 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 20
[2025-04-28 21:13:00,537 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:13:00,537 INFO  L485      AbstractCegarLoop]: Abstraction has 22 states and 29 transitions.
[2025-04-28 21:13:00,537 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 5 states have (on average 2.8) internal successors, (14), 10 states have internal predecessors, (14), 6 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 6 states have call successors, (8)
[2025-04-28 21:13:00,537 INFO  L278                IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions.
[2025-04-28 21:13:00,538 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:13:00,538 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:13:00,538 INFO  L218           NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:13:00,542 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-04-28 21:13:00,738 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:13:00,739 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:13:00,739 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:13:00,739 INFO  L85        PathProgramCache]: Analyzing trace with hash -632162513, now seen corresponding path program 2 times
[2025-04-28 21:13:00,739 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:13:00,739 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565353571]
[2025-04-28 21:13:00,739 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:13:00,739 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:13:00,751 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes.
[2025-04-28 21:13:00,778 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:13:00,779 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:13:00,779 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:13:01,374 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:13:01,375 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:13:01,375 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565353571]
[2025-04-28 21:13:01,375 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565353571] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:13:01,375 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096885828]
[2025-04-28 21:13:01,375 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:13:01,375 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:13:01,378 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:13:01,381 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:13:01,384 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:13:01,434 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes.
[2025-04-28 21:13:01,455 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:13:01,455 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:13:01,455 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:13:01,457 WARN  L254         TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 67 conjuncts are in the unsatisfiable core
[2025-04-28 21:13:01,460 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:13:01,655 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:13:01,674 INFO  L325             Elim1Store]: treesize reduction 40, result has 14.9 percent of original size
[2025-04-28 21:13:01,674 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 34
[2025-04-28 21:13:01,749 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:13:01,750 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2025-04-28 21:13:01,856 INFO  L325             Elim1Store]: treesize reduction 228, result has 9.9 percent of original size
[2025-04-28 21:13:01,856 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 89 treesize of output 162
[2025-04-28 21:13:01,932 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2025-04-28 21:13:01,933 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2025-04-28 21:13:01,934 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:13:01,939 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 66
[2025-04-28 21:13:01,977 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2025-04-28 21:13:02,016 INFO  L325             Elim1Store]: treesize reduction 16, result has 55.6 percent of original size
[2025-04-28 21:13:02,016 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 61
[2025-04-28 21:13:02,247 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:13:02,248 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:13:04,201 INFO  L325             Elim1Store]: treesize reduction 264, result has 22.1 percent of original size
[2025-04-28 21:13:04,202 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 168 treesize of output 206
[2025-04-28 21:13:04,338 INFO  L325             Elim1Store]: treesize reduction 95, result has 17.4 percent of original size
[2025-04-28 21:13:04,338 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 77 treesize of output 48
[2025-04-28 21:13:06,441 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096885828] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:13:06,441 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-04-28 21:13:06,442 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14
[2025-04-28 21:13:06,442 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920875710]
[2025-04-28 21:13:06,442 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:13:06,442 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2025-04-28 21:13:06,442 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:13:06,443 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2025-04-28 21:13:06,443 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=174, Unknown=1, NotChecked=0, Total=210
[2025-04-28 21:13:06,443 INFO  L87              Difference]: Start difference. First operand 22 states and 29 transitions. Second operand  has 14 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 13 states have internal predecessors, (16), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9)
[2025-04-28 21:13:06,913 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:13:06,913 INFO  L93              Difference]: Finished difference Result 26 states and 38 transitions.
[2025-04-28 21:13:06,913 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:13:06,914 INFO  L79                 Accepts]: Start accepts. Automaton has  has 14 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 13 states have internal predecessors, (16), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) Word has length 24
[2025-04-28 21:13:06,914 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:13:06,915 INFO  L225             Difference]: With dead ends: 26
[2025-04-28 21:13:06,915 INFO  L226             Difference]: Without dead ends: 26
[2025-04-28 21:13:06,915 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=63, Invalid=242, Unknown=1, NotChecked=0, Total=306
[2025-04-28 21:13:06,916 INFO  L437           NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:13:06,916 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 150 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:13:06,918 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2025-04-28 21:13:06,923 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22.
[2025-04-28 21:13:06,923 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 22 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 12 states have internal predecessors, (12), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10)
[2025-04-28 21:13:06,924 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions.
[2025-04-28 21:13:06,924 INFO  L79                 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 24
[2025-04-28 21:13:06,924 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:13:06,924 INFO  L485      AbstractCegarLoop]: Abstraction has 22 states and 28 transitions.
[2025-04-28 21:13:06,925 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 13 states have internal predecessors, (16), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9)
[2025-04-28 21:13:06,925 INFO  L278                IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions.
[2025-04-28 21:13:06,925 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:13:06,926 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:13:06,926 INFO  L218           NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:13:06,930 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-04-28 21:13:07,128 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:13:07,128 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:13:07,128 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:13:07,128 INFO  L85        PathProgramCache]: Analyzing trace with hash -1202366766, now seen corresponding path program 2 times
[2025-04-28 21:13:07,128 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:13:07,128 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305752256]
[2025-04-28 21:13:07,128 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:13:07,129 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:13:07,134 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes.
[2025-04-28 21:13:07,151 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:13:07,152 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:13:07,152 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:13:07,858 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2025-04-28 21:13:07,859 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:13:07,859 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305752256]
[2025-04-28 21:13:07,859 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305752256] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:13:07,859 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074049392]
[2025-04-28 21:13:07,859 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:13:07,859 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:13:07,863 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:13:07,865 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:13:07,868 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:13:07,932 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes.
[2025-04-28 21:13:07,952 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:13:07,952 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:13:07,952 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:13:07,954 INFO  L256         TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 58 conjuncts are in the unsatisfiable core
[2025-04-28 21:13:07,956 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:13:08,117 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:13:08,135 INFO  L325             Elim1Store]: treesize reduction 40, result has 14.9 percent of original size
[2025-04-28 21:13:08,135 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 34
[2025-04-28 21:13:08,263 INFO  L325             Elim1Store]: treesize reduction 116, result has 11.5 percent of original size
[2025-04-28 21:13:08,263 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 54
[2025-04-28 21:13:08,362 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:13:08,362 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:13:10,244 INFO  L325             Elim1Store]: treesize reduction 185, result has 23.2 percent of original size
[2025-04-28 21:13:10,244 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 101 treesize of output 110
[2025-04-28 21:13:10,270 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:13:10,271 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 8
[2025-04-28 21:13:10,674 INFO  L189   IndexEqualityManager]: detected not equals via solver
[2025-04-28 21:13:10,705 INFO  L325             Elim1Store]: treesize reduction 42, result has 37.3 percent of original size
[2025-04-28 21:13:10,705 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 47
[2025-04-28 21:13:10,975 INFO  L325             Elim1Store]: treesize reduction 33, result has 2.9 percent of original size
[2025-04-28 21:13:10,975 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 1
[2025-04-28 21:13:11,009 INFO  L325             Elim1Store]: treesize reduction 80, result has 1.2 percent of original size
[2025-04-28 21:13:11,010 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 1
[2025-04-28 21:13:11,011 INFO  L134       CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:13:11,011 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074049392] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:13:11,011 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:13:11,011 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17
[2025-04-28 21:13:11,011 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207737486]
[2025-04-28 21:13:11,012 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:13:11,012 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-04-28 21:13:11,012 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:13:11,013 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-04-28 21:13:11,013 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:13:11,013 INFO  L87              Difference]: Start difference. First operand 22 states and 28 transitions. Second operand  has 17 states, 8 states have (on average 2.625) internal successors, (21), 17 states have internal predecessors, (21), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13)
[2025-04-28 21:13:11,221 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:13:11,221 INFO  L93              Difference]: Finished difference Result 14 states and 17 transitions.
[2025-04-28 21:13:11,222 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:13:11,222 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 8 states have (on average 2.625) internal successors, (21), 17 states have internal predecessors, (21), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13) Word has length 24
[2025-04-28 21:13:11,222 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:13:11,222 INFO  L225             Difference]: With dead ends: 14
[2025-04-28 21:13:11,222 INFO  L226             Difference]: Without dead ends: 0
[2025-04-28 21:13:11,223 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:13:11,223 INFO  L437           NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:13:11,224 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:13:11,224 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-04-28 21:13:11,224 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-04-28 21:13:11,224 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-28 21:13:11,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-04-28 21:13:11,225 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24
[2025-04-28 21:13:11,225 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:13:11,225 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-04-28 21:13:11,225 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 8 states have (on average 2.625) internal successors, (21), 17 states have internal predecessors, (21), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 7 states have call predecessors, (13), 10 states have call successors, (13)
[2025-04-28 21:13:11,225 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-04-28 21:13:11,225 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-04-28 21:13:11,228 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:13:11,232 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-04-28 21:13:11,428 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2025-04-28 21:13:11,432 INFO  L422         BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1]
[2025-04-28 21:13:11,434 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:13:11,437 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:13:11 BoogieIcfgContainer
[2025-04-28 21:13:11,438 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:13:11,438 INFO  L158              Benchmark]: Toolchain (without parser) took 23240.40ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 163.1MB in the beginning and 110.6MB in the end (delta: 52.5MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:13:11,438 INFO  L158              Benchmark]: SmtParser took 2.31ms. Allocated memory is still 234.9MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:13:11,439 INFO  L158              Benchmark]: ChcToBoogie took 36.77ms. Allocated memory is still 234.9MB. Free memory was 163.1MB in the beginning and 162.3MB in the end (delta: 760.6kB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:13:11,439 INFO  L158              Benchmark]: Boogie Preprocessor took 87.36ms. Allocated memory is still 234.9MB. Free memory was 162.3MB in the beginning and 160.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:13:11,439 INFO  L158              Benchmark]: RCFGBuilder took 238.86ms. Allocated memory is still 234.9MB. Free memory was 160.1MB in the beginning and 151.8MB in the end (delta: 8.4MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-04-28 21:13:11,440 INFO  L158              Benchmark]: TraceAbstraction took 22869.68ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 151.0MB in the beginning and 110.6MB in the end (delta: 40.4MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:13:11,441 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 2.31ms. Allocated memory is still 234.9MB. Free memory is still 170.5MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 36.77ms. Allocated memory is still 234.9MB. Free memory was 163.1MB in the beginning and 162.3MB in the end (delta: 760.6kB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 87.36ms. Allocated memory is still 234.9MB. Free memory was 162.3MB in the beginning and 160.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 238.86ms. Allocated memory is still 234.9MB. Free memory was 160.1MB in the beginning and 151.8MB in the end (delta: 8.4MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 22869.68ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 151.0MB in the beginning and 110.6MB in the end (delta: 40.4MB). There was no memory consumed. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Unknown line] : the set of constraint Horn clauses is satisfiable
    For all program executions holds that the set of constraint Horn clauses is satisfiable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 18 locations, 29 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.8s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 56 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 721 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 548 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 624 IncrementalHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 173 mSDtfsCounter, 624 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 191 SyntacticMatches, 9 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=6, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 334 ConstructedInterpolants, 4 QuantifiedInterpolants, 2928 SizeOfPredicates, 133 NumberOfNonLiveVariables, 612 ConjunctsInSsa, 303 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 104/176 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-04-28 21:13:11,460 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
sat
