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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:26,881 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:26,965 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0567b14-2850-46b2-8ebf-227a6e64e402/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:26,972 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:26,975 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:26,999 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:27,000 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:27,000 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:27,001 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:27,001 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:27,001 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:27,001 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:27,001 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:27,002 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:27,003 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:27,004 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:27,004 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:27,004 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:27,004 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:27,004 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:27,004 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:27,004 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:27,004 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:27,004 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:27,004 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:27,005 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:27,005 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:27,363 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:27,375 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:27,378 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:27,380 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:27,380 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:27,382 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0567b14-2850-46b2-8ebf-227a6e64e402/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-043.smt2
[2025-04-28 21:21:27,383 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:27,387 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:27,607 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c0567b14-2850-46b2-8ebf-227a6e64e402/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin/chc-comp24-LIA-Lin-043.smt2
[2025-04-28 21:21:27,610 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:27,616 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:27,617 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:27,617 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:27,617 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:27,626 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,665 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27 Unit
[2025-04-28 21:21:27,665 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:27,666 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:27,666 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:27,667 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:27,685 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,685 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,719 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,720 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,722 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,725 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,727 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,730 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,732 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,750 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:27,753 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:27,754 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:27,754 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:27,755 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (1/1) ...
[2025-04-28 21:21:27,758 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:27,773 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:27,791 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:27,799 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:27,815 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:27,815 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:27,816 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:27,816 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure state given in one single declaration
[2025-04-28 21:21:27,816 INFO  L130     BoogieDeclarations]: Found specification of procedure state
[2025-04-28 21:21:27,816 INFO  L138     BoogieDeclarations]: Found implementation of procedure state
[2025-04-28 21:21:27,817 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:27,817 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:27,817 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:27,906 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:27,909 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:28,051 INFO  L?                        ?]: Removed 0 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:28,051 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:28,069 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:28,070 INFO  L312             CfgBuilder]: Removed 0 assume(true) statements.
[2025-04-28 21:21:28,070 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:28 BoogieIcfgContainer
[2025-04-28 21:21:28,070 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:28,074 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:28,075 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:28,079 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:28,080 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:27" (1/3) ...
[2025-04-28 21:21:28,081 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1750cf71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:28, skipping insertion in model container
[2025-04-28 21:21:28,081 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:27" (2/3) ...
[2025-04-28 21:21:28,082 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1750cf71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:28, skipping insertion in model container
[2025-04-28 21:21:28,082 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:28" (3/3) ...
[2025-04-28 21:21:28,084 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:28,105 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:28,109 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:28,173 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:28,194 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;@4494a078, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:28,194 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:28,199 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:28,216 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2025-04-28 21:21:28,216 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:28,217 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:28,220 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:28,228 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:28,229 INFO  L85        PathProgramCache]: Analyzing trace with hash -683425083, now seen corresponding path program 1 times
[2025-04-28 21:21:28,240 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:28,241 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010302263]
[2025-04-28 21:21:28,242 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:28,243 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:28,285 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes.
[2025-04-28 21:21:28,305 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements.
[2025-04-28 21:21:28,305 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:28,306 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:28,757 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:28,757 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:28,758 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010302263]
[2025-04-28 21:21:28,758 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010302263] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:28,759 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:28,763 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:28,765 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936327130]
[2025-04-28 21:21:28,766 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:28,770 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:28,771 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:28,807 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:28,808 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:28,811 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:28,883 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:28,883 INFO  L93              Difference]: Finished difference Result 13 states and 14 transitions.
[2025-04-28 21:21:28,885 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:28,886 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:28,887 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:28,895 INFO  L225             Difference]: With dead ends: 13
[2025-04-28 21:21:28,896 INFO  L226             Difference]: Without dead ends: 13
[2025-04-28 21:21:28,898 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:28,903 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:28,907 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:28,923 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13 states.
[2025-04-28 21:21:28,947 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13.
[2025-04-28 21:21:28,951 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:28,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions.
[2025-04-28 21:21:28,957 INFO  L79                 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9
[2025-04-28 21:21:28,957 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:28,957 INFO  L485      AbstractCegarLoop]: Abstraction has 13 states and 14 transitions.
[2025-04-28 21:21:28,957 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:28,958 INFO  L278                IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions.
[2025-04-28 21:21:28,959 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2025-04-28 21:21:28,959 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:28,959 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:28,961 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:28,961 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:28,962 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:28,962 INFO  L85        PathProgramCache]: Analyzing trace with hash 204343015, now seen corresponding path program 1 times
[2025-04-28 21:21:28,963 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:28,963 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953411116]
[2025-04-28 21:21:28,963 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:28,963 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:28,981 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-04-28 21:21:28,994 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-04-28 21:21:28,996 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:28,996 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:29,689 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:29,689 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:29,689 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953411116]
[2025-04-28 21:21:29,689 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953411116] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:29,689 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894944145]
[2025-04-28 21:21:29,689 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:29,720 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:29,723 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:29,728 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:29,732 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:29,797 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes.
[2025-04-28 21:21:29,838 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements.
[2025-04-28 21:21:29,838 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:29,838 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:29,844 INFO  L256         TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 25 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:29,851 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:31,199 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:31,200 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:34,967 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,968 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [894944145] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:34,968 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:34,968 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6
[2025-04-28 21:21:34,969 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280550146]
[2025-04-28 21:21:34,969 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:34,969 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:34,970 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:34,970 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:34,970 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:34,971 INFO  L87              Difference]: Start difference. First operand 13 states and 14 transitions. Second operand  has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2025-04-28 21:21:35,027 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:35,028 INFO  L93              Difference]: Finished difference Result 15 states and 16 transitions.
[2025-04-28 21:21:35,028 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:35,029 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 13
[2025-04-28 21:21:35,029 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:35,029 INFO  L225             Difference]: With dead ends: 15
[2025-04-28 21:21:35,029 INFO  L226             Difference]: Without dead ends: 15
[2025-04-28 21:21:35,030 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:35,031 INFO  L437           NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:35,031 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 34 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:35,032 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15 states.
[2025-04-28 21:21:35,034 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2025-04-28 21:21:35,034 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 8 states have internal predecessors, (8), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5)
[2025-04-28 21:21:35,035 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions.
[2025-04-28 21:21:35,035 INFO  L79                 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 13
[2025-04-28 21:21:35,035 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:35,035 INFO  L485      AbstractCegarLoop]: Abstraction has 15 states and 16 transitions.
[2025-04-28 21:21:35,036 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3)
[2025-04-28 21:21:35,036 INFO  L278                IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions.
[2025-04-28 21:21:35,036 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 18
[2025-04-28 21:21:35,036 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:35,036 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:35,043 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,241 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,241 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:35,242 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:35,242 INFO  L85        PathProgramCache]: Analyzing trace with hash -1649658231, now seen corresponding path program 2 times
[2025-04-28 21:21:35,243 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:35,243 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712457928]
[2025-04-28 21:21:35,243 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:21:35,244 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:35,262 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes.
[2025-04-28 21:21:35,274 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,275 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:21:35,275 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:35,275 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-04-28 21:21:35,283 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes.
[2025-04-28 21:21:35,292 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements.
[2025-04-28 21:21:35,292 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:35,293 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:35,323 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-04-28 21:21:35,323 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-04-28 21:21:35,325 INFO  L790   garLoopResultBuilder]: Registering result UNSAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:35,328 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:35,332 INFO  L422         BasicCegarLoop]: Path program histogram: [2, 1]
[2025-04-28 21:21:35,362 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:35,372 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:35 BoogieIcfgContainer
[2025-04-28 21:21:35,372 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:35,373 INFO  L158              Benchmark]: Toolchain (without parser) took 7757.09ms. Allocated memory was 234.9MB in the beginning and 201.3MB in the end (delta: -33.6MB). Free memory was 162.9MB in the beginning and 127.4MB in the end (delta: 35.5MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:35,373 INFO  L158              Benchmark]: SmtParser took 0.76ms. Allocated memory is still 234.9MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:35,373 INFO  L158              Benchmark]: ChcToBoogie took 48.77ms. Allocated memory is still 234.9MB. Free memory was 162.9MB in the beginning and 162.0MB in the end (delta: 838.9kB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:35,374 INFO  L158              Benchmark]: Boogie Preprocessor took 86.60ms. Allocated memory is still 234.9MB. Free memory was 162.0MB in the beginning and 159.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:35,374 INFO  L158              Benchmark]: RCFGBuilder took 317.20ms. Allocated memory is still 234.9MB. Free memory was 159.5MB in the beginning and 149.0MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-04-28 21:21:35,375 INFO  L158              Benchmark]: TraceAbstraction took 7297.41ms. Allocated memory was 234.9MB in the beginning and 201.3MB in the end (delta: -33.6MB). Free memory was 148.1MB in the beginning and 127.4MB in the end (delta: 20.8MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:35,378 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 0.76ms. Allocated memory is still 234.9MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 48.77ms. Allocated memory is still 234.9MB. Free memory was 162.9MB in the beginning and 162.0MB in the end (delta: 838.9kB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 86.60ms. Allocated memory is still 234.9MB. Free memory was 162.0MB in the beginning and 159.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 317.20ms. Allocated memory is still 234.9MB. Free memory was 159.5MB in the beginning and 149.0MB in the end (delta: 10.5MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 7297.41ms. Allocated memory was 234.9MB in the beginning and 201.3MB in the end (delta: -33.6MB). Free memory was 148.1MB in the beginning and 127.4MB in the end (delta: 20.8MB). 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_E_1;
      VAL   [hbv_False_E_1=false]
[L0]  CALL  call state(hbv_False_M_2, hbv_False_F_3, hbv_False_L_4, hbv_False_D_5, hbv_False_B_6, hbv_False_G_7, hbv_False_H_8, hbv_False_I_9, hbv_False_C_10, hbv_False_O_11, hbv_False_E_1, hbv_False_N_12, hbv_False_K_13, hbv_False_J_14, hbv_False_A_15);
      VAL   [hhv_state_A_14=false, hhv_state_B_4=false, hhv_state_C_8=false, hhv_state_D_3=false, hhv_state_E_10=false, hhv_state_F_1=true, hhv_state_G_5=true, hhv_state_H_6=true, hhv_state_I_7=false, hhv_state_J_13=false, hhv_state_K_12=true, hhv_state_L_2=false, hhv_state_M_0=true, hhv_state_N_11=false, hhv_state_O_9=true]
[L0]        assume ((((((((((((((((((((((((!((!hhv_state_M_0 || !hhv_state_G_5) && (hhv_state_G_5 || hhv_state_M_0)) && !((hhv_state_C_8 || hhv_state_E_10) && (!hhv_state_C_8 || !hhv_state_E_10))) && !((hbv_state_D1_6 || hbv_state_G_5) && (!hbv_state_G_5 || !hbv_state_D1_6))) && !(((((!hbv_state_C1_12 || !hbv_state_D1_6) && (hbv_state_C1_12 || hbv_state_D1_6)) || !hbv_state_C_3) && (((hbv_state_C1_12 && hbv_state_D1_6) || hbv_state_C_3) || (!hbv_state_C1_12 && !hbv_state_D1_6))) && (!hbv_state_B_7 || !hbv_state_X_8))) && !((!hhv_state_C_8 && hhv_state_I_7) && hhv_state_B_4)) && !(!hhv_state_G_5 && hhv_state_B_4)) && !((hbv_state_B1_4 || hbv_state_G_5) && (!hbv_state_G_5 || !hbv_state_B1_4))) && !((!hhv_state_A_14 || !hhv_state_L_2) && (hhv_state_L_2 || hhv_state_A_14))) && !((!hbv_state_B_7 && (hbv_state_H_9 || hbv_state_W_10)) && (!hbv_state_W_10 || !hbv_state_H_9))) && !((hhv_state_M_0 || hhv_state_F_1) && (!hhv_state_M_0 || !hhv_state_F_1))) && !(((hhv_state_J_13 || hhv_state_A_14) && (!hhv_state_B_4 || hbv_state_E_1)) && (!hhv_state_A_14 || !hhv_state_J_13))) && !((!hhv_state_I_7 && (!hhv_state_J_13 || !hbv_state_E_1)) && (hhv_state_J_13 || hbv_state_E_1))) && !((hbv_state_A1_11 || hbv_state_E_1) && (!hbv_state_A1_11 || !hbv_state_E_1))) && !((!hhv_state_D_3 || !hhv_state_N_11) && (hhv_state_N_11 || hhv_state_D_3))) && !((!hhv_state_O_9 || !hhv_state_F_1) && (hhv_state_O_9 || hhv_state_F_1))) && !((!hhv_state_A_14 && hhv_state_B_4) && !hbv_state_E_1)) && !((!hhv_state_I_7 && (!hhv_state_H_6 || !hbv_state_G_5)) && (hhv_state_H_6 || hbv_state_G_5))) && !((!hhv_state_B_4 && (hhv_state_H_6 || hhv_state_G_5)) && (!hhv_state_G_5 || !hhv_state_H_6))) && !((!hbv_state_F_2 || !hbv_state_C_3) && (hbv_state_C_3 || hbv_state_F_2))) && !(hhv_state_I_7 && hhv_state_J_13)) && !((!hhv_state_D_3 || !hhv_state_L_2) && (hhv_state_L_2 || hhv_state_D_3))) && !(((((!hhv_state_O_9 || !hhv_state_N_11) && (hhv_state_O_9 || hhv_state_N_11)) || !hhv_state_C_8) && (((hhv_state_O_9 && hhv_state_N_11) || (!hhv_state_O_9 && !hhv_state_N_11)) || hhv_state_C_8)) && (!hhv_state_I_7 || !hhv_state_B_4))) && !((hbv_state_C1_12 || hbv_state_E_1) && (!hbv_state_C1_12 || !hbv_state_E_1))) && !(hhv_state_I_7 && hhv_state_H_6)) && !((hbv_state_B_7 && hbv_state_X_8) && !hbv_state_C_3)) && !(!hbv_state_H_9 && hbv_state_B_7);
      VAL   [hbv_state_A1_11=false, hbv_state_B1_4=true, hbv_state_B_7=true, hbv_state_C1_12=false, hbv_state_C_3=true, hbv_state_D1_6=true, hbv_state_E_1=false, hbv_state_F_2=true, hbv_state_G_5=true, hbv_state_H_9=true, hbv_state_W_10=false, hbv_state_X_8=true, hhv_state_A_14=false, hhv_state_B_4=false, hhv_state_C_8=false, hhv_state_D_3=false, hhv_state_E_10=false, hhv_state_F_1=true, hhv_state_G_5=true, hhv_state_H_6=true, hhv_state_I_7=false, hhv_state_J_13=false, hhv_state_K_12=true, hhv_state_L_2=false, hhv_state_M_0=true, hhv_state_N_11=false, hhv_state_O_9=true]
[L0]  CALL  call state(hbv_state_B1_4, hbv_state_G_5, hbv_state_A1_11, hbv_state_E_1, hbv_state_B_7, hbv_state_H_9, hbv_state_W_10, hbv_state_X_8, hbv_state_C_3, hbv_state_D1_6, hbv_state_F_2, hbv_state_C1_12, hbv_state_Z_13, hbv_state_Y_14, hbv_state_A_15);
      VAL   [hhv_state_A_14=false, hhv_state_B_4=true, hhv_state_C_8=true, hhv_state_D_3=false, hhv_state_E_10=true, hhv_state_F_1=true, hhv_state_G_5=true, hhv_state_H_6=false, hhv_state_I_7=true, hhv_state_J_13=false, hhv_state_K_12=false, hhv_state_L_2=false, hhv_state_M_0=true, hhv_state_N_11=false, hhv_state_O_9=true]
[L0]        assume ((((((((((((((((((((((((!((!hhv_state_M_0 || !hhv_state_G_5) && (hhv_state_G_5 || hhv_state_M_0)) && !((hhv_state_C_8 || hhv_state_E_10) && (!hhv_state_C_8 || !hhv_state_E_10))) && !((hbv_state_D1_6 || hbv_state_G_5) && (!hbv_state_G_5 || !hbv_state_D1_6))) && !(((((!hbv_state_C1_12 || !hbv_state_D1_6) && (hbv_state_C1_12 || hbv_state_D1_6)) || !hbv_state_C_3) && (((hbv_state_C1_12 && hbv_state_D1_6) || hbv_state_C_3) || (!hbv_state_C1_12 && !hbv_state_D1_6))) && (!hbv_state_B_7 || !hbv_state_X_8))) && !((!hhv_state_C_8 && hhv_state_I_7) && hhv_state_B_4)) && !(!hhv_state_G_5 && hhv_state_B_4)) && !((hbv_state_B1_4 || hbv_state_G_5) && (!hbv_state_G_5 || !hbv_state_B1_4))) && !((!hhv_state_A_14 || !hhv_state_L_2) && (hhv_state_L_2 || hhv_state_A_14))) && !((!hbv_state_B_7 && (hbv_state_H_9 || hbv_state_W_10)) && (!hbv_state_W_10 || !hbv_state_H_9))) && !((hhv_state_M_0 || hhv_state_F_1) && (!hhv_state_M_0 || !hhv_state_F_1))) && !(((hhv_state_J_13 || hhv_state_A_14) && (!hhv_state_B_4 || hbv_state_E_1)) && (!hhv_state_A_14 || !hhv_state_J_13))) && !((!hhv_state_I_7 && (!hhv_state_J_13 || !hbv_state_E_1)) && (hhv_state_J_13 || hbv_state_E_1))) && !((hbv_state_A1_11 || hbv_state_E_1) && (!hbv_state_A1_11 || !hbv_state_E_1))) && !((!hhv_state_D_3 || !hhv_state_N_11) && (hhv_state_N_11 || hhv_state_D_3))) && !((!hhv_state_O_9 || !hhv_state_F_1) && (hhv_state_O_9 || hhv_state_F_1))) && !((!hhv_state_A_14 && hhv_state_B_4) && !hbv_state_E_1)) && !((!hhv_state_I_7 && (!hhv_state_H_6 || !hbv_state_G_5)) && (hhv_state_H_6 || hbv_state_G_5))) && !((!hhv_state_B_4 && (hhv_state_H_6 || hhv_state_G_5)) && (!hhv_state_G_5 || !hhv_state_H_6))) && !((!hbv_state_F_2 || !hbv_state_C_3) && (hbv_state_C_3 || hbv_state_F_2))) && !(hhv_state_I_7 && hhv_state_J_13)) && !((!hhv_state_D_3 || !hhv_state_L_2) && (hhv_state_L_2 || hhv_state_D_3))) && !(((((!hhv_state_O_9 || !hhv_state_N_11) && (hhv_state_O_9 || hhv_state_N_11)) || !hhv_state_C_8) && (((hhv_state_O_9 && hhv_state_N_11) || (!hhv_state_O_9 && !hhv_state_N_11)) || hhv_state_C_8)) && (!hhv_state_I_7 || !hhv_state_B_4))) && !((hbv_state_C1_12 || hbv_state_E_1) && (!hbv_state_C1_12 || !hbv_state_E_1))) && !(hhv_state_I_7 && hhv_state_H_6)) && !((hbv_state_B_7 && hbv_state_X_8) && !hbv_state_C_3)) && !(!hbv_state_H_9 && hbv_state_B_7);
      VAL   [hbv_state_A1_11=true, hbv_state_B1_4=true, hbv_state_B_7=true, hbv_state_C1_12=true, hbv_state_C_3=true, hbv_state_D1_6=true, hbv_state_E_1=true, hbv_state_F_2=true, hbv_state_G_5=true, hbv_state_H_9=true, hbv_state_W_10=false, hbv_state_X_8=true, hhv_state_A_14=false, hhv_state_B_4=true, hhv_state_C_8=true, hhv_state_D_3=false, hhv_state_E_10=true, hhv_state_F_1=true, hhv_state_G_5=true, hhv_state_H_6=false, hhv_state_I_7=true, hhv_state_J_13=false, hhv_state_K_12=false, hhv_state_L_2=false, hhv_state_M_0=true, hhv_state_N_11=false, hhv_state_O_9=true]
[L0]  CALL  call state(hbv_state_B1_4, hbv_state_G_5, hbv_state_A1_11, hbv_state_E_1, hbv_state_B_7, hbv_state_H_9, hbv_state_W_10, hbv_state_X_8, hbv_state_C_3, hbv_state_D1_6, hbv_state_F_2, hbv_state_C1_12, hbv_state_Z_13, hbv_state_Y_14, hbv_state_A_15);
      VAL   [hhv_state_A_14=false, hhv_state_B_4=true, hhv_state_C_8=true, hhv_state_D_3=true, hhv_state_E_10=true, hhv_state_F_1=true, hhv_state_G_5=true, hhv_state_H_6=false, hhv_state_I_7=true, hhv_state_J_13=false, hhv_state_K_12=true, hhv_state_L_2=true, hhv_state_M_0=true, hhv_state_N_11=true, hhv_state_O_9=true]
[L0]        assume (((((((((((!(!hhv_state_G_5 && hhv_state_B_4) && !((!hhv_state_C_8 || !hhv_state_E_10) && (hhv_state_C_8 || hhv_state_E_10))) && !((hhv_state_N_11 || hhv_state_D_3) && (!hhv_state_D_3 || !hhv_state_N_11))) && !((!hhv_state_K_12 || !hhv_state_M_0) && (hhv_state_K_12 || hhv_state_M_0))) && !(hhv_state_J_13 && hhv_state_I_7)) && !((hhv_state_M_0 || hhv_state_F_1) && (!hhv_state_F_1 || !hhv_state_M_0))) && !((hhv_state_I_7 && hhv_state_B_4) && !hhv_state_C_8)) && !((!hhv_state_B_4 && (hhv_state_H_6 || hhv_state_G_5)) && (!hhv_state_H_6 || !hhv_state_G_5))) && !(hhv_state_H_6 && hhv_state_I_7)) && !((!hhv_state_L_2 || !hhv_state_D_3) && (hhv_state_L_2 || hhv_state_D_3))) && !(((!hhv_state_B_4 || !hhv_state_I_7) && (((hhv_state_N_11 || hhv_state_O_9) && (!hhv_state_O_9 || !hhv_state_N_11)) || !hhv_state_C_8)) && ((hhv_state_C_8 || (!hhv_state_O_9 && !hhv_state_N_11)) || (hhv_state_N_11 && hhv_state_O_9)))) && !((hhv_state_O_9 || hhv_state_F_1) && (!hhv_state_O_9 || !hhv_state_F_1))) && !((hhv_state_K_12 || hhv_state_L_2) && (!hhv_state_L_2 || !hhv_state_K_12));
      VAL   [hhv_state_A_14=false, hhv_state_B_4=true, hhv_state_C_8=true, hhv_state_D_3=true, hhv_state_E_10=true, hhv_state_F_1=true, hhv_state_G_5=true, hhv_state_H_6=false, hhv_state_I_7=true, hhv_state_J_13=false, hhv_state_K_12=true, hhv_state_L_2=true, hhv_state_M_0=true, hhv_state_N_11=true, hhv_state_O_9=true]
[L0]  RET   call state(hbv_state_B1_4, hbv_state_G_5, hbv_state_A1_11, hbv_state_E_1, hbv_state_B_7, hbv_state_H_9, hbv_state_W_10, hbv_state_X_8, hbv_state_C_3, hbv_state_D1_6, hbv_state_F_2, hbv_state_C1_12, hbv_state_Z_13, hbv_state_Y_14, hbv_state_A_15);
      VAL   [hbv_state_A1_11=true, hbv_state_A_15=false, hbv_state_B1_4=true, hbv_state_B_7=true, hbv_state_C1_12=true, hbv_state_C_3=true, hbv_state_D1_6=true, hbv_state_E_1=true, hbv_state_F_2=true, hbv_state_G_5=true, hbv_state_H_9=true, hbv_state_W_10=false, hbv_state_X_8=true, hbv_state_Y_14=false, hbv_state_Z_13=true, hhv_state_A_14=false, hhv_state_B_4=true, hhv_state_C_8=true, hhv_state_D_3=false, hhv_state_E_10=true, hhv_state_F_1=true, hhv_state_G_5=true, hhv_state_H_6=false, hhv_state_I_7=true, hhv_state_J_13=false, hhv_state_K_12=false, hhv_state_L_2=false, hhv_state_M_0=true, hhv_state_N_11=false, hhv_state_O_9=true]
[L0]  RET   call state(hbv_state_B1_4, hbv_state_G_5, hbv_state_A1_11, hbv_state_E_1, hbv_state_B_7, hbv_state_H_9, hbv_state_W_10, hbv_state_X_8, hbv_state_C_3, hbv_state_D1_6, hbv_state_F_2, hbv_state_C1_12, hbv_state_Z_13, hbv_state_Y_14, hbv_state_A_15);
      VAL   [hbv_state_A1_11=false, hbv_state_A_15=false, hbv_state_B1_4=true, hbv_state_B_7=true, hbv_state_C1_12=false, hbv_state_C_3=true, hbv_state_D1_6=true, hbv_state_E_1=false, hbv_state_F_2=true, hbv_state_G_5=true, hbv_state_H_9=true, hbv_state_W_10=false, hbv_state_X_8=true, hbv_state_Y_14=false, hbv_state_Z_13=false, hhv_state_A_14=false, hhv_state_B_4=false, hhv_state_C_8=false, hhv_state_D_3=false, hhv_state_E_10=false, hhv_state_F_1=true, hhv_state_G_5=true, hhv_state_H_6=true, hhv_state_I_7=false, hhv_state_J_13=false, hhv_state_K_12=true, hhv_state_L_2=false, hhv_state_M_0=true, hhv_state_N_11=false, hhv_state_O_9=true]
[L0]  RET   call state(hbv_False_M_2, hbv_False_F_3, hbv_False_L_4, hbv_False_D_5, hbv_False_B_6, hbv_False_G_7, hbv_False_H_8, hbv_False_I_9, hbv_False_C_10, hbv_False_O_11, hbv_False_E_1, hbv_False_N_12, hbv_False_K_13, hbv_False_J_14, hbv_False_A_15);
      VAL   [hbv_False_A_15=false, hbv_False_B_6=false, hbv_False_C_10=false, hbv_False_D_5=false, hbv_False_E_1=false, hbv_False_F_3=true, hbv_False_G_7=true, hbv_False_H_8=true, hbv_False_I_9=false, hbv_False_J_14=false, hbv_False_K_13=true, hbv_False_L_4=false, hbv_False_M_2=true, hbv_False_N_12=false, hbv_False_O_11=true]
[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: 7.2s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 21 mSDtfsCounter, 23 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 52 NumberOfCodeBlocks, 52 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 123 SizeOfPredicates, 36 NumberOfNonLiveVariables, 86 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 3/9 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:35,395 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
unsat
