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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:33,019 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:33,102 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd646521-4d6e-496e-ab08-394b8a28f877/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:33,107 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:33,108 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:33,132 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:33,132 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:33,133 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:33,133 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:33,133 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:33,134 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:33,134 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:33,134 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:33,134 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:33,134 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:33,134 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:33,135 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:33,135 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:33,135 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:33,135 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:33,135 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:33,135 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:33,135 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:33,136 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:33,136 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:33,137 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:33,137 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:33,481 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:33,494 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:33,497 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:33,500 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:33,500 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:33,503 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd646521-4d6e-496e-ab08-394b8a28f877/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-090.smt2
[2025-04-28 21:21:33,504 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:33,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:33,695 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd646521-4d6e-496e-ab08-394b8a28f877/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-090.smt2
[2025-04-28 21:21:33,698 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:33,702 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:33,703 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:33,703 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:33,703 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:33,709 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,734 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33 Unit
[2025-04-28 21:21:33,735 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:33,737 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:33,737 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:33,737 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:33,754 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,754 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,785 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,785 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,788 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,789 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,791 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,792 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,793 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,809 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:33,812 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:33,812 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:33,812 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:33,813 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (1/1) ...
[2025-04-28 21:21:33,816 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:33,836 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:33,852 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2025-04-28 21:21:33,855 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2025-04-28 21:21:33,868 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:33,868 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:33,868 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:33,869 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure inv given in one single declaration
[2025-04-28 21:21:33,869 INFO  L130     BoogieDeclarations]: Found specification of procedure inv
[2025-04-28 21:21:33,869 INFO  L138     BoogieDeclarations]: Found implementation of procedure inv
[2025-04-28 21:21:33,869 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:33,869 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:33,869 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:33,920 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:33,923 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:33,994 INFO  L?                        ?]: Removed 0 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:33,994 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:34,008 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:34,008 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-04-28 21:21:34,009 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:34 BoogieIcfgContainer
[2025-04-28 21:21:34,009 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:34,016 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:34,016 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:34,020 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:34,020 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:33" (1/3) ...
[2025-04-28 21:21:34,021 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786ff399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:34, skipping insertion in model container
[2025-04-28 21:21:34,021 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:33" (2/3) ...
[2025-04-28 21:21:34,024 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@786ff399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:34, skipping insertion in model container
[2025-04-28 21:21:34,024 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:34" (3/3) ...
[2025-04-28 21:21:34,027 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:34,046 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:34,049 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 3 procedures, 13 locations, 17 edges, 3 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:34,113 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:34,137 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;@2ebafd3f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:34,138 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:34,143 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 13 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 8 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2025-04-28 21:21:34,153 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2025-04-28 21:21:34,153 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:34,154 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:34,154 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:34,160 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:34,161 INFO  L85        PathProgramCache]: Analyzing trace with hash -1672547219, now seen corresponding path program 1 times
[2025-04-28 21:21:34,171 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:34,172 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419462298]
[2025-04-28 21:21:34,172 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:34,173 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:34,213 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-04-28 21:21:34,229 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-04-28 21:21:34,230 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:34,230 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:34,334 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:34,334 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419462298]
[2025-04-28 21:21:34,335 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419462298] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:34,335 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:34,338 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:34,340 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093360452]
[2025-04-28 21:21:34,340 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:34,345 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:34,345 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:34,376 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:34,377 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:34,379 INFO  L87              Difference]: Start difference. First operand  has 13 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 8 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:34,440 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:34,441 INFO  L93              Difference]: Finished difference Result 13 states and 14 transitions.
[2025-04-28 21:21:34,443 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:34,444 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 9
[2025-04-28 21:21:34,444 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:34,454 INFO  L225             Difference]: With dead ends: 13
[2025-04-28 21:21:34,455 INFO  L226             Difference]: Without dead ends: 13
[2025-04-28 21:21:34,457 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:34,460 INFO  L437           NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:34,461 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 26 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:34,477 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13 states.
[2025-04-28 21:21:34,501 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13.
[2025-04-28 21:21:34,505 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 7 states have internal predecessors, (7), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:34,510 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions.
[2025-04-28 21:21:34,512 INFO  L79                 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9
[2025-04-28 21:21:34,512 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:34,512 INFO  L485      AbstractCegarLoop]: Abstraction has 13 states and 14 transitions.
[2025-04-28 21:21:34,512 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-04-28 21:21:34,513 INFO  L278                IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions.
[2025-04-28 21:21:34,516 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2025-04-28 21:21:34,516 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:34,517 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:34,517 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:34,517 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:34,518 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:34,518 INFO  L85        PathProgramCache]: Analyzing trace with hash 13498287, now seen corresponding path program 1 times
[2025-04-28 21:21:34,518 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:34,518 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210634523]
[2025-04-28 21:21:34,519 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:34,519 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:34,532 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-04-28 21:21:34,557 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-04-28 21:21:34,559 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:34,559 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,767 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:34,768 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:34,768 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210634523]
[2025-04-28 21:21:34,768 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210634523] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:34,768 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130076933]
[2025-04-28 21:21:34,768 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:34,768 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:34,771 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:34,774 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:34,778 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:34,814 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-04-28 21:21:34,827 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-04-28 21:21:34,828 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:34,828 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:34,830 INFO  L256         TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:34,854 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:34,958 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:34,959 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:35,317 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:35,317 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130076933] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:35,318 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:35,318 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8
[2025-04-28 21:21:35,318 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967521725]
[2025-04-28 21:21:35,319 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:35,320 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:35,321 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:35,323 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:35,323 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:35,324 INFO  L87              Difference]: Start difference. First operand 13 states and 14 transitions. Second operand  has 8 states, 4 states have (on average 2.25) internal successors, (9), 7 states have internal predecessors, (9), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5)
[2025-04-28 21:21:35,497 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:35,497 INFO  L93              Difference]: Finished difference Result 19 states and 22 transitions.
[2025-04-28 21:21:35,499 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:35,500 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 4 states have (on average 2.25) internal successors, (9), 7 states have internal predecessors, (9), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 13
[2025-04-28 21:21:35,501 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:35,502 INFO  L225             Difference]: With dead ends: 19
[2025-04-28 21:21:35,502 INFO  L226             Difference]: Without dead ends: 19
[2025-04-28 21:21:35,502 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2025-04-28 21:21:35,503 INFO  L437           NwaCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:35,506 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 36 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:35,507 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19 states.
[2025-04-28 21:21:35,512 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17.
[2025-04-28 21:21:35,514 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 17 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5)
[2025-04-28 21:21:35,515 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions.
[2025-04-28 21:21:35,516 INFO  L79                 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13
[2025-04-28 21:21:35,516 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:35,516 INFO  L485      AbstractCegarLoop]: Abstraction has 17 states and 19 transitions.
[2025-04-28 21:21:35,517 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 4 states have (on average 2.25) internal successors, (9), 7 states have internal predecessors, (9), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5)
[2025-04-28 21:21:35,517 INFO  L278                IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions.
[2025-04-28 21:21:35,518 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:35,518 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:35,518 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:35,525 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:35,723 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:35,723 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:35,724 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:35,724 INFO  L85        PathProgramCache]: Analyzing trace with hash -1177266959, now seen corresponding path program 2 times
[2025-04-28 21:21:35,724 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:35,725 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343308037]
[2025-04-28 21:21:35,725 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:35,725 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:35,732 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes.
[2025-04-28 21:21:35,747 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:35,751 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:35,751 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:35,953 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:35,953 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:35,953 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343308037]
[2025-04-28 21:21:35,953 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343308037] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:35,953 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143585466]
[2025-04-28 21:21:35,953 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:35,954 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:35,957 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:35,959 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:35,963 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:35,997 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes.
[2025-04-28 21:21:36,017 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:36,018 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:36,018 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,019 INFO  L256         TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:36,020 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:36,067 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:36,069 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:36,585 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:36,585 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143585466] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:36,585 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:36,586 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11
[2025-04-28 21:21:36,586 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123256564]
[2025-04-28 21:21:36,586 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:36,586 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-04-28 21:21:36,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:36,589 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-04-28 21:21:36,590 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:36,591 INFO  L87              Difference]: Start difference. First operand 17 states and 19 transitions. Second operand  has 11 states, 5 states have (on average 2.4) internal successors, (12), 10 states have internal predecessors, (12), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7)
[2025-04-28 21:21:36,770 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:36,771 INFO  L93              Difference]: Finished difference Result 27 states and 31 transitions.
[2025-04-28 21:21:36,772 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-04-28 21:21:36,772 INFO  L79                 Accepts]: Start accepts. Automaton has  has 11 states, 5 states have (on average 2.4) internal successors, (12), 10 states have internal predecessors, (12), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 17
[2025-04-28 21:21:36,773 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:36,773 INFO  L225             Difference]: With dead ends: 27
[2025-04-28 21:21:36,773 INFO  L226             Difference]: Without dead ends: 25
[2025-04-28 21:21:36,774 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240
[2025-04-28 21:21:36,776 INFO  L437           NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:36,777 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 42 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:36,779 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 25 states.
[2025-04-28 21:21:36,785 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23.
[2025-04-28 21:21:36,787 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8)
[2025-04-28 21:21:36,788 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions.
[2025-04-28 21:21:36,789 INFO  L79                 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 17
[2025-04-28 21:21:36,789 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:36,789 INFO  L485      AbstractCegarLoop]: Abstraction has 23 states and 27 transitions.
[2025-04-28 21:21:36,789 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 5 states have (on average 2.4) internal successors, (12), 10 states have internal predecessors, (12), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7)
[2025-04-28 21:21:36,790 INFO  L278                IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions.
[2025-04-28 21:21:36,790 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2025-04-28 21:21:36,791 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:36,792 INFO  L218           NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:36,797 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:21:36,996 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:36,996 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:36,996 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:36,997 INFO  L85        PathProgramCache]: Analyzing trace with hash 329141299, now seen corresponding path program 3 times
[2025-04-28 21:21:36,997 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:36,997 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668703223]
[2025-04-28 21:21:36,997 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:36,997 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:37,003 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes.
[2025-04-28 21:21:37,035 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:37,035 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-04-28 21:21:37,036 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,251 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:37,251 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:37,251 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668703223]
[2025-04-28 21:21:37,251 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668703223] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:37,251 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802554508]
[2025-04-28 21:21:37,252 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2025-04-28 21:21:37,252 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:37,255 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:37,257 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:37,263 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:37,304 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes.
[2025-04-28 21:21:37,333 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:37,333 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s)
[2025-04-28 21:21:37,334 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:37,336 INFO  L256         TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 9 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:37,337 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:37,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2025-04-28 21:21:37,386 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:38,159 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-04-28 21:21:38,160 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [802554508] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:38,160 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:38,160 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 13
[2025-04-28 21:21:38,160 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116628984]
[2025-04-28 21:21:38,160 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:38,161 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-28 21:21:38,161 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:38,162 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-28 21:21:38,162 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:38,162 INFO  L87              Difference]: Start difference. First operand 23 states and 27 transitions. Second operand  has 13 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 12 states have internal predecessors, (14), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9)
[2025-04-28 21:21:38,336 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:38,336 INFO  L93              Difference]: Finished difference Result 33 states and 41 transitions.
[2025-04-28 21:21:38,338 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-04-28 21:21:38,338 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 12 states have internal predecessors, (14), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) Word has length 21
[2025-04-28 21:21:38,338 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:38,339 INFO  L225             Difference]: With dead ends: 33
[2025-04-28 21:21:38,339 INFO  L226             Difference]: Without dead ends: 27
[2025-04-28 21:21:38,340 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306
[2025-04-28 21:21:38,340 INFO  L437           NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:38,341 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 62 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:38,341 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2025-04-28 21:21:38,350 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25.
[2025-04-28 21:21:38,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 25 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8)
[2025-04-28 21:21:38,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions.
[2025-04-28 21:21:38,353 INFO  L79                 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21
[2025-04-28 21:21:38,353 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:38,353 INFO  L485      AbstractCegarLoop]: Abstraction has 25 states and 28 transitions.
[2025-04-28 21:21:38,353 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 12 states have internal predecessors, (14), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9)
[2025-04-28 21:21:38,353 INFO  L278                IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions.
[2025-04-28 21:21:38,354 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2025-04-28 21:21:38,354 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:38,354 INFO  L218           NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:38,360 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-04-28 21:21:38,554 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:38,555 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:38,555 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:38,555 INFO  L85        PathProgramCache]: Analyzing trace with hash 1761090933, now seen corresponding path program 4 times
[2025-04-28 21:21:38,555 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:38,555 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956161675]
[2025-04-28 21:21:38,555 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:38,556 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:38,562 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes.
[2025-04-28 21:21:38,572 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:38,573 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-04-28 21:21:38,573 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,805 INFO  L134       CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2025-04-28 21:21:38,805 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:38,806 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956161675]
[2025-04-28 21:21:38,806 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956161675] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:38,806 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163503145]
[2025-04-28 21:21:38,806 INFO  L95    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2025-04-28 21:21:38,806 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:38,809 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:38,811 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:38,814 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-04-28 21:21:38,863 INFO  L108    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes.
[2025-04-28 21:21:38,883 INFO  L111    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements.
[2025-04-28 21:21:38,883 INFO  L114    AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s)
[2025-04-28 21:21:38,883 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:38,885 INFO  L256         TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:38,886 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:38,980 INFO  L134       CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2025-04-28 21:21:38,980 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:40,131 INFO  L134       CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2025-04-28 21:21:40,131 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163503145] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:40,131 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:40,131 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 17
[2025-04-28 21:21:40,131 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358586322]
[2025-04-28 21:21:40,132 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:40,132 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-04-28 21:21:40,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:40,133 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-04-28 21:21:40,133 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:40,133 INFO  L87              Difference]: Start difference. First operand 25 states and 28 transitions. Second operand  has 17 states, 8 states have (on average 2.375) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (12), 5 states have call predecessors, (12), 10 states have call successors, (12)
[2025-04-28 21:21:40,291 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:40,292 INFO  L93              Difference]: Finished difference Result 33 states and 38 transitions.
[2025-04-28 21:21:40,292 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:21:40,292 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 8 states have (on average 2.375) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (12), 5 states have call predecessors, (12), 10 states have call successors, (12) Word has length 25
[2025-04-28 21:21:40,293 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:40,293 INFO  L225             Difference]: With dead ends: 33
[2025-04-28 21:21:40,293 INFO  L226             Difference]: Without dead ends: 31
[2025-04-28 21:21:40,294 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:21:40,294 INFO  L437           NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:40,295 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 55 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:40,295 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2025-04-28 21:21:40,299 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29.
[2025-04-28 21:21:40,299 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 29 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 6 states have call successors, (6), 5 states have call predecessors, (6), 8 states have return successors, (10), 8 states have call predecessors, (10), 6 states have call successors, (10)
[2025-04-28 21:21:40,300 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions.
[2025-04-28 21:21:40,300 INFO  L79                 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 25
[2025-04-28 21:21:40,300 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:40,300 INFO  L485      AbstractCegarLoop]: Abstraction has 29 states and 32 transitions.
[2025-04-28 21:21:40,300 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 8 states have (on average 2.375) internal successors, (19), 16 states have internal predecessors, (19), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (12), 5 states have call predecessors, (12), 10 states have call successors, (12)
[2025-04-28 21:21:40,300 INFO  L278                IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions.
[2025-04-28 21:21:40,301 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 34
[2025-04-28 21:21:40,301 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:40,301 INFO  L218           NwaCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:40,310 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-04-28 21:21:40,505 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:40,505 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:40,505 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:40,505 INFO  L85        PathProgramCache]: Analyzing trace with hash -2107879943, now seen corresponding path program 5 times
[2025-04-28 21:21:40,506 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:40,506 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545754678]
[2025-04-28 21:21:40,506 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-04-28 21:21:40,506 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:40,514 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 7 equivalence classes.
[2025-04-28 21:21:40,661 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:40,661 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s)
[2025-04-28 21:21:40,661 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,026 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-04-28 21:21:41,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:41,026 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545754678]
[2025-04-28 21:21:41,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545754678] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:41,026 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66839359]
[2025-04-28 21:21:41,027 INFO  L95    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2025-04-28 21:21:41,028 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:41,030 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:41,032 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:41,036 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-04-28 21:21:41,087 INFO  L108    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 33 statements into 7 equivalence classes.
[2025-04-28 21:21:41,373 INFO  L111    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 33 of 33 statements.
[2025-04-28 21:21:41,374 INFO  L114    AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s)
[2025-04-28 21:21:41,374 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:41,376 INFO  L256         TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:41,379 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:41,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2025-04-28 21:21:41,472 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:44,046 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2025-04-28 21:21:44,046 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [66839359] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:44,047 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:44,047 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 16] total 19
[2025-04-28 21:21:44,047 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733218631]
[2025-04-28 21:21:44,047 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:44,047 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2025-04-28 21:21:44,049 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:44,050 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2025-04-28 21:21:44,050 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:44,050 INFO  L87              Difference]: Start difference. First operand 29 states and 32 transitions. Second operand  has 19 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 18 states have internal predecessors, (20), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (15), 7 states have call predecessors, (15), 11 states have call successors, (15)
[2025-04-28 21:21:44,254 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:44,254 INFO  L93              Difference]: Finished difference Result 37 states and 42 transitions.
[2025-04-28 21:21:44,255 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-04-28 21:21:44,255 INFO  L79                 Accepts]: Start accepts. Automaton has  has 19 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 18 states have internal predecessors, (20), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (15), 7 states have call predecessors, (15), 11 states have call successors, (15) Word has length 33
[2025-04-28 21:21:44,255 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:44,256 INFO  L225             Difference]: With dead ends: 37
[2025-04-28 21:21:44,256 INFO  L226             Difference]: Without dead ends: 35
[2025-04-28 21:21:44,257 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756
[2025-04-28 21:21:44,257 INFO  L437           NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:44,258 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 70 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:44,258 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2025-04-28 21:21:44,262 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33.
[2025-04-28 21:21:44,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 5 states have call predecessors, (6), 10 states have return successors, (12), 10 states have call predecessors, (12), 6 states have call successors, (12)
[2025-04-28 21:21:44,263 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions.
[2025-04-28 21:21:44,264 INFO  L79                 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 33
[2025-04-28 21:21:44,264 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:44,264 INFO  L485      AbstractCegarLoop]: Abstraction has 33 states and 36 transitions.
[2025-04-28 21:21:44,264 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 18 states have internal predecessors, (20), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (15), 7 states have call predecessors, (15), 11 states have call successors, (15)
[2025-04-28 21:21:44,264 INFO  L278                IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions.
[2025-04-28 21:21:44,265 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 42
[2025-04-28 21:21:44,265 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:44,265 INFO  L218           NwaCegarLoop]: trace histogram [9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:44,271 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-04-28 21:21:44,469 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:44,469 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:44,470 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:44,470 INFO  L85        PathProgramCache]: Analyzing trace with hash 1201858173, now seen corresponding path program 6 times
[2025-04-28 21:21:44,470 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:44,470 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761426715]
[2025-04-28 21:21:44,470 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-04-28 21:21:44,470 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:44,478 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 9 equivalence classes.
[2025-04-28 21:21:44,554 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 41 of 41 statements.
[2025-04-28 21:21:44,554 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s)
[2025-04-28 21:21:44,555 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:44,904 INFO  L134       CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2025-04-28 21:21:44,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:44,904 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761426715]
[2025-04-28 21:21:44,904 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761426715] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:44,905 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615532462]
[2025-04-28 21:21:44,905 INFO  L95    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2025-04-28 21:21:44,905 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:44,907 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:44,911 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:44,912 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-04-28 21:21:44,986 INFO  L108    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 9 equivalence classes.
[2025-04-28 21:21:45,046 INFO  L111    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) and asserted 41 of 41 statements.
[2025-04-28 21:21:45,046 INFO  L114    AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s)
[2025-04-28 21:21:45,046 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:45,047 INFO  L256         TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 19 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:45,049 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:45,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked.
[2025-04-28 21:21:45,116 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:49,771 INFO  L134       CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2025-04-28 21:21:49,771 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615532462] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:49,771 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:49,771 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 20] total 23
[2025-04-28 21:21:49,772 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123322941]
[2025-04-28 21:21:49,772 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:49,772 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2025-04-28 21:21:49,772 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:49,773 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2025-04-28 21:21:49,773 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:21:49,774 INFO  L87              Difference]: Start difference. First operand 33 states and 36 transitions. Second operand  has 23 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 22 states have internal predecessors, (24), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (19), 9 states have call predecessors, (19), 13 states have call successors, (19)
[2025-04-28 21:21:50,040 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:50,041 INFO  L93              Difference]: Finished difference Result 41 states and 46 transitions.
[2025-04-28 21:21:50,041 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-04-28 21:21:50,041 INFO  L79                 Accepts]: Start accepts. Automaton has  has 23 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 22 states have internal predecessors, (24), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (19), 9 states have call predecessors, (19), 13 states have call successors, (19) Word has length 41
[2025-04-28 21:21:50,042 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:50,042 INFO  L225             Difference]: With dead ends: 41
[2025-04-28 21:21:50,043 INFO  L226             Difference]: Without dead ends: 39
[2025-04-28 21:21:50,043 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 71 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=322, Invalid=800, Unknown=0, NotChecked=0, Total=1122
[2025-04-28 21:21:50,044 INFO  L437           NwaCegarLoop]: 10 mSDtfsCounter, 48 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:50,044 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 72 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:50,045 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39 states.
[2025-04-28 21:21:50,048 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37.
[2025-04-28 21:21:50,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 37 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 12 states have return successors, (14), 12 states have call predecessors, (14), 6 states have call successors, (14)
[2025-04-28 21:21:50,049 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions.
[2025-04-28 21:21:50,050 INFO  L79                 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 41
[2025-04-28 21:21:50,050 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:50,050 INFO  L485      AbstractCegarLoop]: Abstraction has 37 states and 40 transitions.
[2025-04-28 21:21:50,050 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 22 states have internal predecessors, (24), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (19), 9 states have call predecessors, (19), 13 states have call successors, (19)
[2025-04-28 21:21:50,050 INFO  L278                IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions.
[2025-04-28 21:21:50,051 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 50
[2025-04-28 21:21:50,051 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:50,051 INFO  L218           NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:50,060 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-04-28 21:21:50,251 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:50,252 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:50,252 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:50,252 INFO  L85        PathProgramCache]: Analyzing trace with hash -479336703, now seen corresponding path program 7 times
[2025-04-28 21:21:50,252 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:50,253 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206044886]
[2025-04-28 21:21:50,253 INFO  L95    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2025-04-28 21:21:50,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:50,262 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes.
[2025-04-28 21:21:50,341 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements.
[2025-04-28 21:21:50,341 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:50,341 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:50,341 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-04-28 21:21:50,353 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes.
[2025-04-28 21:21:50,414 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements.
[2025-04-28 21:21:50,414 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:50,414 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:50,443 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-04-28 21:21:50,443 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-04-28 21:21:50,444 INFO  L790   garLoopResultBuilder]: Registering result UNSAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:50,446 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-04-28 21:21:50,450 INFO  L422         BasicCegarLoop]: Path program histogram: [7, 1]
[2025-04-28 21:21:50,481 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:50,487 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:50 BoogieIcfgContainer
[2025-04-28 21:21:50,487 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:50,488 INFO  L158              Benchmark]: Toolchain (without parser) took 16786.52ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 165.8MB in the beginning and 99.2MB in the end (delta: 66.5MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:50,488 INFO  L158              Benchmark]: SmtParser took 1.71ms. Allocated memory is still 234.9MB. Free memory is still 172.4MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:50,490 INFO  L158              Benchmark]: ChcToBoogie took 32.86ms. Allocated memory is still 234.9MB. Free memory was 165.8MB in the beginning and 164.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:50,490 INFO  L158              Benchmark]: Boogie Preprocessor took 74.01ms. Allocated memory is still 234.9MB. Free memory was 164.3MB in the beginning and 162.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:50,491 INFO  L158              Benchmark]: RCFGBuilder took 197.68ms. Allocated memory is still 234.9MB. Free memory was 162.2MB in the beginning and 153.6MB in the end (delta: 8.6MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:50,491 INFO  L158              Benchmark]: TraceAbstraction took 16471.90ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 153.0MB in the beginning and 99.2MB in the end (delta: 53.7MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:50,492 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.71ms. Allocated memory is still 234.9MB. Free memory is still 172.4MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 32.86ms. Allocated memory is still 234.9MB. Free memory was 165.8MB in the beginning and 164.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 74.01ms. Allocated memory is still 234.9MB. Free memory was 164.3MB in the beginning and 162.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 197.68ms. Allocated memory is still 234.9MB. Free memory was 162.2MB in the beginning and 153.6MB in the end (delta: 8.6MB). There was no memory consumed. Max. memory is 33.6GB.
 * TraceAbstraction took 16471.90ms. Allocated memory was 234.9MB in the beginning and 167.8MB in the end (delta: -67.1MB). Free memory was 153.0MB in the beginning and 99.2MB in the end (delta: 53.7MB). There was no memory consumed. Max. memory is 33.6GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - CounterExampleResult [Unknown line] : the set of constraint Horn clauses is unsatisfiable
    the set of constraint Horn clauses is unsatisfiable
We found a FailurePath: 
[L0]  CALL  call False();
[L0]        assume !(hbv_False_A_2 <= 0) && !(hbv_False_B_1 < 80914);
      VAL   [hbv_False_A_2=2032812951, hbv_False_B_1=80914]
[L0]  CALL  call inv(hbv_False_D_3, hbv_False_B_1, hbv_False_C_4, hbv_False_A_2);
      VAL   [hhv_inv_A_3=2032812951, hhv_inv_B_2=3362010343, hhv_inv_C_1=80914, hhv_inv_D_0=14229690670]
[L0]        assume ((hhv_inv_D_0 + 7 * hbv_inv_F_2 == 13 && 8754 + hhv_inv_B_2 + 5 * hbv_inv_F_2 == 3 * hbv_inv_H_3 + hbv_inv_G_4 * 4) && (if hhv_inv_B_2 <= 0 then hbv_inv_E_1 else hbv_inv_E_1 + -1 * hbv_inv_F_2) == hhv_inv_A_3) && 2 * hbv_inv_H_3 + hhv_inv_C_1 == 54;
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=-2032812951, hbv_inv_G_4=-1700481092, hbv_inv_H_3=-40430, hhv_inv_A_3=2032812951, hhv_inv_B_2=3362010343, hhv_inv_C_1=80914, hhv_inv_D_0=14229690670]
[L0]  CALL  call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hhv_inv_A_3=0, hhv_inv_B_2=-1700481092, hhv_inv_C_1=-40430, hhv_inv_D_0=-2032812951]
[L0]        assume ((hhv_inv_D_0 + 7 * hbv_inv_F_2 == 13 && 8754 + hhv_inv_B_2 + 5 * hbv_inv_F_2 == 3 * hbv_inv_H_3 + hbv_inv_G_4 * 4) && (if hhv_inv_B_2 <= 0 then hbv_inv_E_1 else hbv_inv_E_1 + -1 * hbv_inv_F_2) == hhv_inv_A_3) && 2 * hbv_inv_H_3 + hhv_inv_C_1 == 54;
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=290401852, hbv_inv_G_4=-62130951, hbv_inv_H_3=20242, hhv_inv_A_3=0, hhv_inv_B_2=-1700481092, hhv_inv_C_1=-40430, hhv_inv_D_0=-2032812951]
[L0]  CALL  call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hhv_inv_A_3=0, hhv_inv_B_2=-62130951, hhv_inv_C_1=20242, hhv_inv_D_0=290401852]
[L0]        assume ((hhv_inv_D_0 + 7 * hbv_inv_F_2 == 13 && 8754 + hhv_inv_B_2 + 5 * hbv_inv_F_2 == 3 * hbv_inv_H_3 + hbv_inv_G_4 * 4) && (if hhv_inv_B_2 <= 0 then hbv_inv_E_1 else hbv_inv_E_1 + -1 * hbv_inv_F_2) == hhv_inv_A_3) && 2 * hbv_inv_H_3 + hhv_inv_C_1 == 54;
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=-41485977, hbv_inv_G_4=-67380450, hbv_inv_H_3=-10094, hhv_inv_A_3=0, hhv_inv_B_2=-62130951, hhv_inv_C_1=20242, hhv_inv_D_0=290401852]
[L0]  CALL  call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hhv_inv_A_3=0, hhv_inv_B_2=-67380450, hhv_inv_C_1=-10094, hhv_inv_D_0=-41485977]
[L0]        assume ((hhv_inv_D_0 + 7 * hbv_inv_F_2 == 13 && 8754 + hhv_inv_B_2 + 5 * hbv_inv_F_2 == 3 * hbv_inv_H_3 + hbv_inv_G_4 * 4) && (if hhv_inv_B_2 <= 0 then hbv_inv_E_1 else hbv_inv_E_1 + -1 * hbv_inv_F_2) == hhv_inv_A_3) && 2 * hbv_inv_H_3 + hhv_inv_C_1 == 54;
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=5926570, hbv_inv_G_4=-9438517, hbv_inv_H_3=5074, hhv_inv_A_3=0, hhv_inv_B_2=-67380450, hhv_inv_C_1=-10094, hhv_inv_D_0=-41485977]
[L0]  CALL  call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hhv_inv_A_3=0, hhv_inv_B_2=-9438517, hhv_inv_C_1=5074, hhv_inv_D_0=5926570]
[L0]        assume ((hhv_inv_D_0 + 7 * hbv_inv_F_2 == 13 && 8754 + hhv_inv_B_2 + 5 * hbv_inv_F_2 == 3 * hbv_inv_H_3 + hbv_inv_G_4 * 4) && (if hhv_inv_B_2 <= 0 then hbv_inv_E_1 else hbv_inv_E_1 + -1 * hbv_inv_F_2) == hhv_inv_A_3) && 2 * hbv_inv_H_3 + hhv_inv_C_1 == 54;
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=-846651, hbv_inv_G_4=-3413872, hbv_inv_H_3=-2510, hhv_inv_A_3=0, hhv_inv_B_2=-9438517, hhv_inv_C_1=5074, hhv_inv_D_0=5926570]
[L0]  CALL  call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hhv_inv_A_3=0, hhv_inv_B_2=-3413872, hhv_inv_C_1=-2510, hhv_inv_D_0=-846651]
[L0]        assume ((hhv_inv_D_0 + 7 * hbv_inv_F_2 == 13 && 8754 + hhv_inv_B_2 + 5 * hbv_inv_F_2 == 3 * hbv_inv_H_3 + hbv_inv_G_4 * 4) && (if hhv_inv_B_2 <= 0 then hbv_inv_E_1 else hbv_inv_E_1 + -1 * hbv_inv_F_2) == hhv_inv_A_3) && 2 * hbv_inv_H_3 + hhv_inv_C_1 == 54;
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=120952, hbv_inv_G_4=-701051, hbv_inv_H_3=1282, hhv_inv_A_3=0, hhv_inv_B_2=-3413872, hhv_inv_C_1=-2510, hhv_inv_D_0=-846651]
[L0]  CALL  call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hhv_inv_A_3=0, hhv_inv_B_2=-701051, hhv_inv_C_1=1282, hhv_inv_D_0=120952]
[L0]        assume ((hhv_inv_D_0 + 7 * hbv_inv_F_2 == 13 && 8754 + hhv_inv_B_2 + 5 * hbv_inv_F_2 == 3 * hbv_inv_H_3 + hbv_inv_G_4 * 4) && (if hhv_inv_B_2 <= 0 then hbv_inv_E_1 else hbv_inv_E_1 + -1 * hbv_inv_F_2) == hhv_inv_A_3) && 2 * hbv_inv_H_3 + hhv_inv_C_1 == 54;
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=-17277, hbv_inv_G_4=-194210, hbv_inv_H_3=-614, hhv_inv_A_3=0, hhv_inv_B_2=-701051, hhv_inv_C_1=1282, hhv_inv_D_0=120952]
[L0]  CALL  call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hhv_inv_A_3=0, hhv_inv_B_2=-194210, hhv_inv_C_1=-614, hhv_inv_D_0=-17277]
[L0]        assume ((hhv_inv_D_0 + 7 * hbv_inv_F_2 == 13 && 8754 + hhv_inv_B_2 + 5 * hbv_inv_F_2 == 3 * hbv_inv_H_3 + hbv_inv_G_4 * 4) && (if hhv_inv_B_2 <= 0 then hbv_inv_E_1 else hbv_inv_E_1 + -1 * hbv_inv_F_2) == hhv_inv_A_3) && 2 * hbv_inv_H_3 + hhv_inv_C_1 == 54;
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=2470, hbv_inv_G_4=-43527, hbv_inv_H_3=334, hhv_inv_A_3=0, hhv_inv_B_2=-194210, hhv_inv_C_1=-614, hhv_inv_D_0=-17277]
[L0]  CALL  call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hhv_inv_A_3=0, hhv_inv_B_2=-43527, hhv_inv_C_1=334, hhv_inv_D_0=2470]
[L0]        assume ((hhv_inv_D_0 + 7 * hbv_inv_F_2 == 13 && 8754 + hhv_inv_B_2 + 5 * hbv_inv_F_2 == 3 * hbv_inv_H_3 + hbv_inv_G_4 * 4) && (if hhv_inv_B_2 <= 0 then hbv_inv_E_1 else hbv_inv_E_1 + -1 * hbv_inv_F_2) == hhv_inv_A_3) && 2 * hbv_inv_H_3 + hhv_inv_C_1 == 54;
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=-351, hbv_inv_G_4=-9027, hbv_inv_H_3=-140, hhv_inv_A_3=0, hhv_inv_B_2=-43527, hhv_inv_C_1=334, hhv_inv_D_0=2470]
[L0]  CALL  call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hhv_inv_A_3=0, hhv_inv_B_2=-9027, hhv_inv_C_1=-140, hhv_inv_D_0=-351]
[L0]        assume ((hhv_inv_D_0 + 7 * hbv_inv_F_2 == 13 && 8754 + hhv_inv_B_2 + 5 * hbv_inv_F_2 == 3 * hbv_inv_H_3 + hbv_inv_G_4 * 4) && (if hhv_inv_B_2 <= 0 then hbv_inv_E_1 else hbv_inv_E_1 + -1 * hbv_inv_F_2) == hhv_inv_A_3) && 2 * hbv_inv_H_3 + hhv_inv_C_1 == 54;
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=52, hbv_inv_G_4=-76, hbv_inv_H_3=97, hhv_inv_A_3=0, hhv_inv_B_2=-9027, hhv_inv_C_1=-140, hhv_inv_D_0=-351]
[L0]  CALL  call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hhv_inv_A_3=0, hhv_inv_B_2=-76, hhv_inv_C_1=97, hhv_inv_D_0=52]
[L0]        assume ((76 + hhv_inv_B_2 == 0 && 97 == hhv_inv_C_1) && 52 == hhv_inv_D_0) && hhv_inv_A_3 == 0;
      VAL   [hhv_inv_A_3=0, hhv_inv_B_2=-76, hhv_inv_C_1=97, hhv_inv_D_0=52]
[L0]  RET   call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=52, hbv_inv_G_4=-76, hbv_inv_H_3=97, hhv_inv_A_3=0, hhv_inv_B_2=-9027, hhv_inv_C_1=-140, hhv_inv_D_0=-351]
[L0]  RET   call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=-351, hbv_inv_G_4=-9027, hbv_inv_H_3=-140, hhv_inv_A_3=0, hhv_inv_B_2=-43527, hhv_inv_C_1=334, hhv_inv_D_0=2470]
[L0]  RET   call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=2470, hbv_inv_G_4=-43527, hbv_inv_H_3=334, hhv_inv_A_3=0, hhv_inv_B_2=-194210, hhv_inv_C_1=-614, hhv_inv_D_0=-17277]
[L0]  RET   call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=-17277, hbv_inv_G_4=-194210, hbv_inv_H_3=-614, hhv_inv_A_3=0, hhv_inv_B_2=-701051, hhv_inv_C_1=1282, hhv_inv_D_0=120952]
[L0]  RET   call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=120952, hbv_inv_G_4=-701051, hbv_inv_H_3=1282, hhv_inv_A_3=0, hhv_inv_B_2=-3413872, hhv_inv_C_1=-2510, hhv_inv_D_0=-846651]
[L0]  RET   call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=-846651, hbv_inv_G_4=-3413872, hbv_inv_H_3=-2510, hhv_inv_A_3=0, hhv_inv_B_2=-9438517, hhv_inv_C_1=5074, hhv_inv_D_0=5926570]
[L0]  RET   call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=5926570, hbv_inv_G_4=-9438517, hbv_inv_H_3=5074, hhv_inv_A_3=0, hhv_inv_B_2=-67380450, hhv_inv_C_1=-10094, hhv_inv_D_0=-41485977]
[L0]  RET   call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=-41485977, hbv_inv_G_4=-67380450, hbv_inv_H_3=-10094, hhv_inv_A_3=0, hhv_inv_B_2=-62130951, hhv_inv_C_1=20242, hhv_inv_D_0=290401852]
[L0]  RET   call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=290401852, hbv_inv_G_4=-62130951, hbv_inv_H_3=20242, hhv_inv_A_3=0, hhv_inv_B_2=-1700481092, hhv_inv_C_1=-40430, hhv_inv_D_0=-2032812951]
[L0]  RET   call inv(hbv_inv_F_2, hbv_inv_H_3, hbv_inv_G_4, hbv_inv_E_1);
      VAL   [hbv_inv_E_1=0, hbv_inv_F_2=-2032812951, hbv_inv_G_4=-1700481092, hbv_inv_H_3=-40430, hhv_inv_A_3=2032812951, hhv_inv_B_2=3362010343, hhv_inv_C_1=80914, hhv_inv_D_0=14229690670]
[L0]  RET   call inv(hbv_False_D_3, hbv_False_B_1, hbv_False_C_4, hbv_False_A_2);
      VAL   [hbv_False_A_2=2032812951, hbv_False_B_1=80914, hbv_False_C_4=3362010343, hbv_False_D_3=14229690670]
[L0]  RET   call False();
[L0]        assert false;

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 3 procedures, 13 locations, 17 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 144 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 134 mSDsluCounter, 363 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 290 mSDsCounter, 193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 322 IncrementalHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 193 mSolverCounterUnsat, 73 mSDtfsCounter, 322 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 408 GetRequests, 259 SyntacticMatches, 30 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=7, InterpolantAutomatonStates: 74, 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, 7 MinimizatonAttempts, 12 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 358 NumberOfCodeBlocks, 358 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 440 ConstructedInterpolants, 0 QuantifiedInterpolants, 1485 SizeOfPredicates, 48 NumberOfNonLiveVariables, 660 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 284/852 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
RESULT: Ultimate proved your program to be incorrect!
[2025-04-28 21:21:50,512 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
unsat
