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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:17,186 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:17,271 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a60e61ca-e241-47fe-b344-157fb9b87472/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:17,276 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:17,276 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:17,306 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:17,308 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:17,308 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:17,309 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:17,310 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:17,311 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:17,311 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:17,311 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:17,311 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:17,311 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:17,312 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:17,312 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:17,312 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:17,313 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:17,313 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:17,313 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:17,313 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:17,313 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:17,313 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:17,313 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:17,314 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:17,314 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:17,642 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:17,652 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:17,654 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:17,657 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:17,658 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:17,659 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a60e61ca-e241-47fe-b344-157fb9b87472/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin-Arrays/chc-comp24-LIA-Lin-Arrays-114.smt2
[2025-04-28 21:21:17,662 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:17,665 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:17,887 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a60e61ca-e241-47fe-b344-157fb9b87472/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin-Arrays/chc-comp24-LIA-Lin-Arrays-114.smt2
[2025-04-28 21:21:17,890 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:17,893 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:17,894 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:17,894 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:17,895 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:17,897 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,924 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17 Unit
[2025-04-28 21:21:17,925 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:17,927 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:17,928 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:17,928 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:17,947 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,947 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,981 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,981 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,984 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,985 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,987 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,989 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:17,989 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:18,004 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:18,005 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:18,005 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:18,005 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:18,006 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (1/1) ...
[2025-04-28 21:21:18,010 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:18,030 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:18,044 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-04-28 21:21:18,048 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-04-28 21:21:18,060 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:18,060 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:18,060 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:18,061 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure END_QUERY given in one single declaration
[2025-04-28 21:21:18,061 INFO  L130     BoogieDeclarations]: Found specification of procedure END_QUERY
[2025-04-28 21:21:18,061 INFO  L138     BoogieDeclarations]: Found implementation of procedure END_QUERY
[2025-04-28 21:21:18,061 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure INV_MAIN_42 given in one single declaration
[2025-04-28 21:21:18,061 INFO  L130     BoogieDeclarations]: Found specification of procedure INV_MAIN_42
[2025-04-28 21:21:18,061 INFO  L138     BoogieDeclarations]: Found implementation of procedure INV_MAIN_42
[2025-04-28 21:21:18,061 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:18,061 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:18,062 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:18,104 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:18,106 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:18,253 INFO  L?                        ?]: Removed 0 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:18,253 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:18,269 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:18,271 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-04-28 21:21:18,271 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:18 BoogieIcfgContainer
[2025-04-28 21:21:18,272 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:18,275 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:18,275 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:18,279 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:18,280 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:17" (1/3) ...
[2025-04-28 21:21:18,280 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e88766a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:18, skipping insertion in model container
[2025-04-28 21:21:18,281 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:17" (2/3) ...
[2025-04-28 21:21:18,281 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e88766a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:18, skipping insertion in model container
[2025-04-28 21:21:18,281 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:18" (3/3) ...
[2025-04-28 21:21:18,283 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:18,296 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:18,299 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:21:18,356 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:18,369 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;@7d6873c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:18,370 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:18,374 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:21:18,382 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2025-04-28 21:21:18,383 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:18,383 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:18,384 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:18,389 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:18,390 INFO  L85        PathProgramCache]: Analyzing trace with hash 2123209953, now seen corresponding path program 1 times
[2025-04-28 21:21:18,401 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:18,402 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669931542]
[2025-04-28 21:21:18,403 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:18,404 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:18,434 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes.
[2025-04-28 21:21:18,459 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements.
[2025-04-28 21:21:18,459 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:18,459 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:18,576 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:18,576 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:18,577 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669931542]
[2025-04-28 21:21:18,578 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669931542] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:18,579 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:18,585 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:18,587 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994893316]
[2025-04-28 21:21:18,588 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:18,591 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:18,592 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:18,617 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:18,617 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:18,619 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:21:18,695 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:18,696 INFO  L93              Difference]: Finished difference Result 18 states and 25 transitions.
[2025-04-28 21:21:18,697 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:18,699 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 12
[2025-04-28 21:21:18,699 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:18,706 INFO  L225             Difference]: With dead ends: 18
[2025-04-28 21:21:18,706 INFO  L226             Difference]: Without dead ends: 18
[2025-04-28 21:21:18,708 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:18,711 INFO  L437           NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:21:18,712 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:21:18,727 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 18 states.
[2025-04-28 21:21:18,746 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18.
[2025-04-28 21:21:18,751 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:21:18,754 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions.
[2025-04-28 21:21:18,755 INFO  L79                 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 12
[2025-04-28 21:21:18,756 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:18,756 INFO  L485      AbstractCegarLoop]: Abstraction has 18 states and 25 transitions.
[2025-04-28 21:21:18,757 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3)
[2025-04-28 21:21:18,757 INFO  L278                IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions.
[2025-04-28 21:21:18,759 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:18,759 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:18,759 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:18,759 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:18,759 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:18,761 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:18,761 INFO  L85        PathProgramCache]: Analyzing trace with hash -1781338650, now seen corresponding path program 1 times
[2025-04-28 21:21:18,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:18,761 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812392457]
[2025-04-28 21:21:18,761 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:18,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:18,773 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:18,874 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:18,874 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:18,874 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:19,783 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:19,785 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:19,785 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812392457]
[2025-04-28 21:21:19,785 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812392457] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:19,786 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567032892]
[2025-04-28 21:21:19,786 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:19,786 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:19,789 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:19,794 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:19,796 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:19,850 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:19,872 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:19,872 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:19,872 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:19,876 INFO  L256         TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 32 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:19,883 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:20,147 INFO  L325             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2025-04-28 21:21:20,148 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 17 treesize of output 14
[2025-04-28 21:21:20,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:20,222 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:21,234 INFO  L325             Elim1Store]: treesize reduction 19, result has 44.1 percent of original size
[2025-04-28 21:21:21,234 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:21:21,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [567032892] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:21,550 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-04-28 21:21:21,550 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10
[2025-04-28 21:21:21,551 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512444645]
[2025-04-28 21:21:21,551 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:21,552 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-28 21:21:21,552 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:21,553 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-28 21:21:21,553 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110
[2025-04-28 21:21:21,553 INFO  L87              Difference]: Start difference. First operand 18 states and 25 transitions. Second operand  has 10 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 9 states have internal predecessors, (13), 5 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6)
[2025-04-28 21:21:21,930 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:21,930 INFO  L93              Difference]: Finished difference Result 22 states and 34 transitions.
[2025-04-28 21:21:21,931 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:21,931 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 9 states have internal predecessors, (13), 5 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 16
[2025-04-28 21:21:21,931 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:21,933 INFO  L225             Difference]: With dead ends: 22
[2025-04-28 21:21:21,933 INFO  L226             Difference]: Without dead ends: 22
[2025-04-28 21:21:21,934 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=44, Invalid=137, Unknown=1, NotChecked=0, Total=182
[2025-04-28 21:21:21,935 INFO  L437           NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:21,936 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 100 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-28 21:21:21,937 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2025-04-28 21:21:21,945 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20.
[2025-04-28 21:21:21,945 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:21:21,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions.
[2025-04-28 21:21:21,948 INFO  L79                 Accepts]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 16
[2025-04-28 21:21:21,948 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:21,948 INFO  L485      AbstractCegarLoop]: Abstraction has 20 states and 29 transitions.
[2025-04-28 21:21:21,948 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 9 states have internal predecessors, (13), 5 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6)
[2025-04-28 21:21:21,949 INFO  L278                IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions.
[2025-04-28 21:21:21,949 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:21,949 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:21,950 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:21,957 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:22,150 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:21:22,151 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:22,151 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:22,151 INFO  L85        PathProgramCache]: Analyzing trace with hash -1502372541, now seen corresponding path program 1 times
[2025-04-28 21:21:22,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:22,152 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847112791]
[2025-04-28 21:21:22,152 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:22,152 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:22,159 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:22,169 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:22,170 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:22,170 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:22,292 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:22,293 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:22,293 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847112791]
[2025-04-28 21:21:22,293 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847112791] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:22,293 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066258588]
[2025-04-28 21:21:22,293 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:22,293 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:22,297 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:22,299 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:22,303 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:22,349 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:22,365 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:22,365 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:22,365 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:22,367 INFO  L256         TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:22,368 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:22,493 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:22,494 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:23,801 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:23,801 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066258588] provided 1 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:23,801 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-04-28 21:21:23,802 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11
[2025-04-28 21:21:23,802 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362234355]
[2025-04-28 21:21:23,802 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:23,802 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:23,802 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:23,804 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:23,804 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:23,805 INFO  L87              Difference]: Start difference. First operand 20 states and 29 transitions. Second operand  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:23,913 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:23,914 INFO  L93              Difference]: Finished difference Result 24 states and 38 transitions.
[2025-04-28 21:21:23,915 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:23,915 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-04-28 21:21:23,916 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:23,916 INFO  L225             Difference]: With dead ends: 24
[2025-04-28 21:21:23,916 INFO  L226             Difference]: Without dead ends: 24
[2025-04-28 21:21:23,917 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:23,918 INFO  L437           NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:23,919 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 55 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:23,921 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2025-04-28 21:21:23,928 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22.
[2025-04-28 21:21:23,929 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, (15), 6 states have call predecessors, (15), 6 states have call successors, (15)
[2025-04-28 21:21:23,929 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions.
[2025-04-28 21:21:23,930 INFO  L79                 Accepts]: Start accepts. Automaton has 22 states and 33 transitions. Word has length 16
[2025-04-28 21:21:23,930 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:23,930 INFO  L485      AbstractCegarLoop]: Abstraction has 22 states and 33 transitions.
[2025-04-28 21:21:23,930 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:23,930 INFO  L278                IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions.
[2025-04-28 21:21:23,931 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:23,931 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:23,932 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:23,937 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:24,135 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:24,135 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:24,136 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:24,136 INFO  L85        PathProgramCache]: Analyzing trace with hash 1976497099, now seen corresponding path program 1 times
[2025-04-28 21:21:24,136 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:24,136 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292467410]
[2025-04-28 21:21:24,136 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:24,136 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:24,141 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:24,147 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:24,147 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:24,147 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:24,263 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:24,263 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:24,263 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292467410]
[2025-04-28 21:21:24,263 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292467410] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:24,263 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569480450]
[2025-04-28 21:21:24,263 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:24,263 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:24,266 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:24,268 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:24,271 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:24,313 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:24,331 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:24,331 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:24,332 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:24,333 INFO  L256         TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:24,335 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:24,427 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:24,427 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:25,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:25,420 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569480450] provided 1 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:25,421 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-04-28 21:21:25,421 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11
[2025-04-28 21:21:25,421 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946774470]
[2025-04-28 21:21:25,421 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:25,422 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:25,422 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:25,422 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:25,422 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:25,423 INFO  L87              Difference]: Start difference. First operand 22 states and 33 transitions. Second operand  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:25,514 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:25,514 INFO  L93              Difference]: Finished difference Result 26 states and 42 transitions.
[2025-04-28 21:21:25,515 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:25,516 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-04-28 21:21:25,516 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:25,517 INFO  L225             Difference]: With dead ends: 26
[2025-04-28 21:21:25,517 INFO  L226             Difference]: Without dead ends: 26
[2025-04-28 21:21:25,517 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:25,518 INFO  L437           NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:25,518 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 52 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:25,518 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2025-04-28 21:21:25,526 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24.
[2025-04-28 21:21:25,526 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 6 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18)
[2025-04-28 21:21:25,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions.
[2025-04-28 21:21:25,530 INFO  L79                 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 16
[2025-04-28 21:21:25,530 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:25,531 INFO  L485      AbstractCegarLoop]: Abstraction has 24 states and 37 transitions.
[2025-04-28 21:21:25,531 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:25,531 INFO  L278                IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions.
[2025-04-28 21:21:25,532 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:25,532 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:25,532 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:21:25,539 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:25,732 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:25,732 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:25,733 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:25,733 INFO  L85        PathProgramCache]: Analyzing trace with hash -101921136, now seen corresponding path program 1 times
[2025-04-28 21:21:25,733 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:25,733 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640016673]
[2025-04-28 21:21:25,733 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:25,733 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:25,747 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:25,760 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:25,760 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:25,760 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:25,966 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:21:25,967 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:25,967 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640016673]
[2025-04-28 21:21:25,967 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640016673] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:25,967 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681815802]
[2025-04-28 21:21:25,967 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:25,967 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:25,970 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:25,972 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:25,975 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:26,028 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:26,049 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:26,049 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:26,049 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:26,051 INFO  L256         TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 20 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:26,053 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:26,248 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:21:26,248 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:28,518 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:28,519 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681815802] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:28,519 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:28,519 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16
[2025-04-28 21:21:28,519 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111513997]
[2025-04-28 21:21:28,519 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:28,519 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-04-28 21:21:28,520 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:28,520 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-04-28 21:21:28,520 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:28,521 INFO  L87              Difference]: Start difference. First operand 24 states and 37 transitions. Second operand  has 16 states, 9 states have (on average 2.111111111111111) internal successors, (19), 15 states have internal predecessors, (19), 8 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11)
[2025-04-28 21:21:28,917 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:28,918 INFO  L93              Difference]: Finished difference Result 36 states and 65 transitions.
[2025-04-28 21:21:28,919 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:28,920 INFO  L79                 Accepts]: Start accepts. Automaton has  has 16 states, 9 states have (on average 2.111111111111111) internal successors, (19), 15 states have internal predecessors, (19), 8 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) Word has length 20
[2025-04-28 21:21:28,920 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:28,922 INFO  L225             Difference]: With dead ends: 36
[2025-04-28 21:21:28,924 INFO  L226             Difference]: Without dead ends: 36
[2025-04-28 21:21:28,924 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462
[2025-04-28 21:21:28,925 INFO  L437           NwaCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:28,927 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 153 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:28,928 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 36 states.
[2025-04-28 21:21:28,937 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26.
[2025-04-28 21:21:28,937 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 14 states have internal predecessors, (14), 6 states have call successors, (6), 3 states have call predecessors, (6), 8 states have return successors, (22), 8 states have call predecessors, (22), 6 states have call successors, (22)
[2025-04-28 21:21:28,938 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 42 transitions.
[2025-04-28 21:21:28,938 INFO  L79                 Accepts]: Start accepts. Automaton has 26 states and 42 transitions. Word has length 20
[2025-04-28 21:21:28,939 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:28,939 INFO  L485      AbstractCegarLoop]: Abstraction has 26 states and 42 transitions.
[2025-04-28 21:21:28,939 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 9 states have (on average 2.111111111111111) internal successors, (19), 15 states have internal predecessors, (19), 8 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11)
[2025-04-28 21:21:28,939 INFO  L278                IsEmpty]: Start isEmpty. Operand 26 states and 42 transitions.
[2025-04-28 21:21:28,940 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:28,940 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:28,940 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:21:28,947 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-04-28 21:21:29,144 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2025-04-28 21:21:29,145 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:29,145 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:29,146 INFO  L85        PathProgramCache]: Analyzing trace with hash 225319432, now seen corresponding path program 1 times
[2025-04-28 21:21:29,146 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:29,146 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341574086]
[2025-04-28 21:21:29,146 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:29,146 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:29,151 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:29,158 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:29,158 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:29,158 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:29,379 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:21:29,379 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:29,380 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341574086]
[2025-04-28 21:21:29,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341574086] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:29,380 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130126287]
[2025-04-28 21:21:29,380 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:29,380 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:29,383 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:29,385 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:29,389 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:21:29,462 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:29,485 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:29,485 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:29,485 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:29,500 INFO  L256         TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:29,502 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:29,654 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:21:29,654 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:31,827 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:31,827 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130126287] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:31,827 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:31,827 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16
[2025-04-28 21:21:31,828 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244831241]
[2025-04-28 21:21:31,828 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:31,828 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-04-28 21:21:31,828 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:31,829 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-04-28 21:21:31,829 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:31,829 INFO  L87              Difference]: Start difference. First operand 26 states and 42 transitions. Second operand  has 16 states, 9 states have (on average 2.111111111111111) internal successors, (19), 15 states have internal predecessors, (19), 8 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11)
[2025-04-28 21:21:32,240 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:32,241 INFO  L93              Difference]: Finished difference Result 42 states and 79 transitions.
[2025-04-28 21:21:32,241 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-04-28 21:21:32,241 INFO  L79                 Accepts]: Start accepts. Automaton has  has 16 states, 9 states have (on average 2.111111111111111) internal successors, (19), 15 states have internal predecessors, (19), 8 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) Word has length 20
[2025-04-28 21:21:32,242 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:32,243 INFO  L225             Difference]: With dead ends: 42
[2025-04-28 21:21:32,243 INFO  L226             Difference]: Without dead ends: 42
[2025-04-28 21:21:32,243 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:21:32,244 INFO  L437           NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:32,244 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 117 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:32,245 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2025-04-28 21:21:32,254 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 28.
[2025-04-28 21:21:32,258 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28 states, 12 states have (on average 1.25) internal successors, (15), 15 states have internal predecessors, (15), 6 states have call successors, (6), 3 states have call predecessors, (6), 9 states have return successors, (26), 9 states have call predecessors, (26), 6 states have call successors, (26)
[2025-04-28 21:21:32,259 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 47 transitions.
[2025-04-28 21:21:32,259 INFO  L79                 Accepts]: Start accepts. Automaton has 28 states and 47 transitions. Word has length 20
[2025-04-28 21:21:32,260 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:32,260 INFO  L485      AbstractCegarLoop]: Abstraction has 28 states and 47 transitions.
[2025-04-28 21:21:32,260 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 9 states have (on average 2.111111111111111) internal successors, (19), 15 states have internal predecessors, (19), 8 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11)
[2025-04-28 21:21:32,260 INFO  L278                IsEmpty]: Start isEmpty. Operand 28 states and 47 transitions.
[2025-04-28 21:21:32,261 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:32,261 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:32,261 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:32,268 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:32,461 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:32,462 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:32,462 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:32,462 INFO  L85        PathProgramCache]: Analyzing trace with hash -448835029, now seen corresponding path program 2 times
[2025-04-28 21:21:32,462 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:32,462 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346798692]
[2025-04-28 21:21:32,462 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:32,463 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:32,469 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes.
[2025-04-28 21:21:32,501 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:32,502 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:32,502 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:33,005 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:33,005 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346798692]
[2025-04-28 21:21:33,005 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346798692] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:33,005 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248787104]
[2025-04-28 21:21:33,005 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:33,006 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:33,009 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:33,012 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:33,015 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:21:33,085 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes.
[2025-04-28 21:21:33,105 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:33,105 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:33,105 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,107 INFO  L256         TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 56 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:33,110 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:33,260 INFO  L325             Elim1Store]: treesize reduction 48, result has 12.7 percent of original size
[2025-04-28 21:21:33,260 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 19 treesize of output 26
[2025-04-28 21:21:33,465 INFO  L325             Elim1Store]: treesize reduction 218, result has 8.0 percent of original size
[2025-04-28 21:21:33,465 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 75 treesize of output 138
[2025-04-28 21:21:33,528 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 51 treesize of output 28
[2025-04-28 21:21:35,664 WARN  L871   $PredicateComparison]: unable to prove that (or (exists ((INV_MAIN_42_hhv_INV_MAIN_42_A_0 Int)) (let ((.cse3 (+ INV_MAIN_42_hhv_INV_MAIN_42_A_0 4))) (let ((.cse0 (select c_INV_MAIN_42_hhv_INV_MAIN_42_D_4 .cse3)) (.cse1 (select c_INV_MAIN_42_hhv_INV_MAIN_42_D_4 INV_MAIN_42_hhv_INV_MAIN_42_A_0)) (.cse2 (select c_INV_MAIN_42_hhv_INV_MAIN_42_H_9 INV_MAIN_42_hhv_INV_MAIN_42_A_0))) (and (= .cse0 .cse1) (= (store (store c_INV_MAIN_42_hhv_INV_MAIN_42_H_9 INV_MAIN_42_hhv_INV_MAIN_42_A_0 .cse2) .cse3 .cse0) (store (store c_INV_MAIN_42_hhv_INV_MAIN_42_D_4 INV_MAIN_42_hhv_INV_MAIN_42_A_0 .cse2) .cse3 .cse0)) (= (select c_INV_MAIN_42_hhv_INV_MAIN_42_H_9 (+ (- 4) INV_MAIN_42_hhv_INV_MAIN_42_A_0)) .cse2) (= (select c_INV_MAIN_42_hhv_INV_MAIN_42_H_9 .cse3) .cse2) (= .cse1 .cse2))))) (exists ((INV_MAIN_42_hhv_INV_MAIN_42_A_0 Int)) (let ((.cse5 (+ INV_MAIN_42_hhv_INV_MAIN_42_A_0 4))) (let ((.cse4 (select c_INV_MAIN_42_hhv_INV_MAIN_42_H_9 INV_MAIN_42_hhv_INV_MAIN_42_A_0)) (.cse6 (select c_INV_MAIN_42_hhv_INV_MAIN_42_H_9 .cse5))) (and (= (store (store c_INV_MAIN_42_hhv_INV_MAIN_42_D_4 INV_MAIN_42_hhv_INV_MAIN_42_A_0 .cse4) .cse5 .cse6) c_INV_MAIN_42_hhv_INV_MAIN_42_H_9) (= (select c_INV_MAIN_42_hhv_INV_MAIN_42_D_4 INV_MAIN_42_hhv_INV_MAIN_42_A_0) .cse4) (= .cse6 (select c_INV_MAIN_42_hhv_INV_MAIN_42_D_4 (+ 8 INV_MAIN_42_hhv_INV_MAIN_42_A_0))) (= (select c_INV_MAIN_42_hhv_INV_MAIN_42_D_4 .cse5) .cse6))))) (exists ((INV_MAIN_42_hhv_INV_MAIN_42_A_0 Int)) (let ((.cse8 (+ INV_MAIN_42_hhv_INV_MAIN_42_A_0 4))) (let ((.cse7 (select c_INV_MAIN_42_hhv_INV_MAIN_42_H_9 INV_MAIN_42_hhv_INV_MAIN_42_A_0)) (.cse9 (select c_INV_MAIN_42_hhv_INV_MAIN_42_H_9 .cse8))) (and (= (store (store c_INV_MAIN_42_hhv_INV_MAIN_42_D_4 INV_MAIN_42_hhv_INV_MAIN_42_A_0 .cse7) .cse8 .cse9) c_INV_MAIN_42_hhv_INV_MAIN_42_H_9) (= (select c_INV_MAIN_42_hhv_INV_MAIN_42_D_4 INV_MAIN_42_hhv_INV_MAIN_42_A_0) .cse7) (exists ((INV_MAIN_42_hhv_INV_MAIN_42_C_3 Int)) (and (= (select c_INV_MAIN_42_hhv_INV_MAIN_42_H_9 INV_MAIN_42_hhv_INV_MAIN_42_C_3) .cse7) (= .cse9 (select c_INV_MAIN_42_hhv_INV_MAIN_42_D_4 (+ INV_MAIN_42_hhv_INV_MAIN_42_C_3 4))))) (= (select c_INV_MAIN_42_hhv_INV_MAIN_42_D_4 .cse8) .cse9)))))) is different from true
[2025-04-28 21:21:35,778 INFO  L134       CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 4 not checked.
[2025-04-28 21:21:35,778 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:37,560 INFO  L325             Elim1Store]: treesize reduction 175, result has 23.6 percent of original size
[2025-04-28 21:21:37,560 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 4 new quantified variables, introduced 9 case distinctions, treesize of input 113 treesize of output 120
[2025-04-28 21:21:37,663 INFO  L325             Elim1Store]: treesize reduction 63, result has 17.1 percent of original size
[2025-04-28 21:21:37,663 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 3 case distinctions, treesize of input 59 treesize of output 30
[2025-04-28 21:21:39,441 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [248787104] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:39,441 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2025-04-28 21:21:39,441 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12
[2025-04-28 21:21:39,441 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565961791]
[2025-04-28 21:21:39,442 INFO  L85    oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:39,442 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-04-28 21:21:39,442 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:39,443 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-04-28 21:21:39,443 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=97, Unknown=2, NotChecked=20, Total=156
[2025-04-28 21:21:39,443 INFO  L87              Difference]: Start difference. First operand 28 states and 47 transitions. Second operand  has 12 states, 7 states have (on average 2.0) internal successors, (14), 11 states have internal predecessors, (14), 6 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8)
[2025-04-28 21:21:39,813 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:39,813 INFO  L93              Difference]: Finished difference Result 34 states and 60 transitions.
[2025-04-28 21:21:39,814 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:39,814 INFO  L79                 Accepts]: Start accepts. Automaton has  has 12 states, 7 states have (on average 2.0) internal successors, (14), 11 states have internal predecessors, (14), 6 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) Word has length 20
[2025-04-28 21:21:39,814 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:39,815 INFO  L225             Difference]: With dead ends: 34
[2025-04-28 21:21:39,815 INFO  L226             Difference]: Without dead ends: 34
[2025-04-28 21:21:39,815 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=66, Invalid=146, Unknown=2, NotChecked=26, Total=240
[2025-04-28 21:21:39,816 INFO  L437           NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:39,816 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 80 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time]
[2025-04-28 21:21:39,817 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34 states.
[2025-04-28 21:21:39,822 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24.
[2025-04-28 21:21:39,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24 states, 10 states have (on average 1.3) internal successors, (13), 13 states have internal predecessors, (13), 6 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (19), 8 states have call predecessors, (19), 6 states have call successors, (19)
[2025-04-28 21:21:39,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions.
[2025-04-28 21:21:39,823 INFO  L79                 Accepts]: Start accepts. Automaton has 24 states and 38 transitions. Word has length 20
[2025-04-28 21:21:39,823 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:39,823 INFO  L485      AbstractCegarLoop]: Abstraction has 24 states and 38 transitions.
[2025-04-28 21:21:39,823 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 7 states have (on average 2.0) internal successors, (14), 11 states have internal predecessors, (14), 6 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8)
[2025-04-28 21:21:39,824 INFO  L278                IsEmpty]: Start isEmpty. Operand 24 states and 38 transitions.
[2025-04-28 21:21:39,824 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:39,824 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:39,825 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:21:39,831 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:40,025 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:40,025 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:40,026 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:40,026 INFO  L85        PathProgramCache]: Analyzing trace with hash 1696537261, now seen corresponding path program 1 times
[2025-04-28 21:21:40,026 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:40,026 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379395866]
[2025-04-28 21:21:40,026 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:40,026 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,031 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:40,036 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:40,036 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:40,036 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:40,072 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:40,072 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379395866]
[2025-04-28 21:21:40,072 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379395866] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:40,072 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:40,072 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:40,072 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837242707]
[2025-04-28 21:21:40,072 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:40,072 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:40,073 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:40,073 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:40,073 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:40,073 INFO  L87              Difference]: Start difference. First operand 24 states and 38 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:40,174 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,175 INFO  L93              Difference]: Finished difference Result 35 states and 53 transitions.
[2025-04-28 21:21:40,175 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:40,175 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-04-28 21:21:40,176 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,176 INFO  L225             Difference]: With dead ends: 35
[2025-04-28 21:21:40,176 INFO  L226             Difference]: Without dead ends: 21
[2025-04-28 21:21:40,176 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:40,177 INFO  L437           NwaCegarLoop]: 23 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,177 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 43 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:40,178 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 21 states.
[2025-04-28 21:21:40,181 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19.
[2025-04-28 21:21:40,181 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19 states, 8 states have (on average 1.25) internal successors, (10), 10 states have internal predecessors, (10), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9)
[2025-04-28 21:21:40,181 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions.
[2025-04-28 21:21:40,182 INFO  L79                 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 20
[2025-04-28 21:21:40,182 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,182 INFO  L485      AbstractCegarLoop]: Abstraction has 19 states and 24 transitions.
[2025-04-28 21:21:40,183 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:40,183 INFO  L278                IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions.
[2025-04-28 21:21:40,183 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:40,184 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,184 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:21:40,184 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-04-28 21:21:40,184 INFO  L403      AbstractCegarLoop]: === Iteration 9 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:40,184 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:40,184 INFO  L85        PathProgramCache]: Analyzing trace with hash -1236176176, now seen corresponding path program 2 times
[2025-04-28 21:21:40,184 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:40,184 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701630395]
[2025-04-28 21:21:40,184 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:40,185 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,194 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes.
[2025-04-28 21:21:40,202 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:40,202 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:40,203 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:40,253 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:40,253 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:40,253 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701630395]
[2025-04-28 21:21:40,253 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701630395] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:40,253 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:40,254 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:40,254 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610546089]
[2025-04-28 21:21:40,254 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:40,254 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:40,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:40,255 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:40,255 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:40,255 INFO  L87              Difference]: Start difference. First operand 19 states and 24 transitions. Second operand  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:40,327 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,328 INFO  L93              Difference]: Finished difference Result 19 states and 25 transitions.
[2025-04-28 21:21:40,329 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:40,330 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 20
[2025-04-28 21:21:40,330 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,330 INFO  L225             Difference]: With dead ends: 19
[2025-04-28 21:21:40,330 INFO  L226             Difference]: Without dead ends: 0
[2025-04-28 21:21:40,330 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:40,331 INFO  L437           NwaCegarLoop]: 16 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,331 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 26 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:40,332 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-04-28 21:21:40,332 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-04-28 21:21:40,332 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-28 21:21:40,333 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-04-28 21:21:40,333 INFO  L79                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20
[2025-04-28 21:21:40,333 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,333 INFO  L485      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-04-28 21:21:40,333 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:40,333 INFO  L278                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-04-28 21:21:40,333 INFO  L284                IsEmpty]: Finished isEmpty. No accepting run.
[2025-04-28 21:21:40,336 INFO  L790   garLoopResultBuilder]: Registering result SAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:40,337 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-04-28 21:21:40,341 INFO  L422         BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1]
[2025-04-28 21:21:40,344 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:40,355 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:40 BoogieIcfgContainer
[2025-04-28 21:21:40,355 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:40,356 INFO  L158              Benchmark]: Toolchain (without parser) took 22465.00ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 162.9MB in the beginning and 63.7MB in the end (delta: 99.2MB). Peak memory consumption was 29.7MB. Max. memory is 33.6GB.
[2025-04-28 21:21:40,357 INFO  L158              Benchmark]: SmtParser took 1.56ms. Allocated memory is still 234.9MB. Free memory is still 170.2MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:40,357 INFO  L158              Benchmark]: ChcToBoogie took 31.39ms. Allocated memory is still 234.9MB. Free memory was 162.9MB in the beginning and 161.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:40,357 INFO  L158              Benchmark]: Boogie Preprocessor took 77.52ms. Allocated memory is still 234.9MB. Free memory was 161.8MB in the beginning and 159.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:40,357 INFO  L158              Benchmark]: RCFGBuilder took 267.19ms. Allocated memory is still 234.9MB. Free memory was 159.6MB in the beginning and 150.7MB in the end (delta: 8.9MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-04-28 21:21:40,358 INFO  L158              Benchmark]: TraceAbstraction took 22080.90ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 150.2MB in the beginning and 63.7MB in the end (delta: 86.5MB). Peak memory consumption was 12.9MB. Max. memory is 33.6GB.
[2025-04-28 21:21:40,362 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 1.56ms. Allocated memory is still 234.9MB. Free memory is still 170.2MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 31.39ms. Allocated memory is still 234.9MB. Free memory was 162.9MB in the beginning and 161.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 77.52ms. Allocated memory is still 234.9MB. Free memory was 161.8MB in the beginning and 159.6MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 267.19ms. Allocated memory is still 234.9MB. Free memory was 159.6MB in the beginning and 150.7MB in the end (delta: 8.9MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 22080.90ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 150.2MB in the beginning and 63.7MB in the end (delta: 86.5MB). Peak memory consumption was 12.9MB. 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.0s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 104 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 669 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 40 IncrementalHoareTripleChecker+Unchecked, 495 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 728 IncrementalHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 174 mSDtfsCounter, 728 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 168 SyntacticMatches, 6 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=6, InterpolantAutomatonStates: 65, 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, 42 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 321 ConstructedInterpolants, 4 QuantifiedInterpolants, 2020 SizeOfPredicates, 73 NumberOfNonLiveVariables, 594 ConjunctsInSsa, 152 ConjunctsInUnsatCore, 19 InterpolantComputations, 5 PerfectInterpolantSequences, 59/116 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2025-04-28 21:21:40,412 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
sat
