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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:12,909 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:13,005 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a632830-db33-488f-92f3-23f2c17f0959/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:13,012 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:13,013 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:13,047 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:13,048 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:13,048 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:13,050 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:13,050 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:13,051 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:13,052 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:13,052 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:13,052 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:13,052 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:13,053 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:13,053 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:13,053 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:13,053 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:13,053 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:13,053 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:13,054 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:13,054 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:13,054 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:13,054 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:13,055 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:13,055 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:13,395 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:13,406 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:13,409 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:13,412 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:13,412 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:13,414 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a632830-db33-488f-92f3-23f2c17f0959/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-103.smt2
[2025-04-28 21:21:13,416 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:13,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:13,674 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2a632830-db33-488f-92f3-23f2c17f0959/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-103.smt2
[2025-04-28 21:21:13,677 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:13,678 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:13,679 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:13,679 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:13,680 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:13,682 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:13" (1/1) ...
[2025-04-28 21:21:13,726 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:13 Unit
[2025-04-28 21:21:13,730 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:13,731 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:13,731 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:13,732 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:13,755 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:13" (1/1) ...
[2025-04-28 21:21:13,756 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:13" (1/1) ...
[2025-04-28 21:21:13,788 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:13" (1/1) ...
[2025-04-28 21:21:13,792 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:13" (1/1) ...
[2025-04-28 21:21:13,795 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:13" (1/1) ...
[2025-04-28 21:21:13,800 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:13" (1/1) ...
[2025-04-28 21:21:13,802 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:13" (1/1) ...
[2025-04-28 21:21:13,806 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:13" (1/1) ...
[2025-04-28 21:21:13,807 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:13" (1/1) ...
[2025-04-28 21:21:13,833 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:13,834 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:13,834 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:13,834 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:13,835 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:13" (1/1) ...
[2025-04-28 21:21:13,838 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:13,856 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:13,870 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:13,874 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:13,888 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:13,888 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:13,888 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:13,888 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure realizable given in one single declaration
[2025-04-28 21:21:13,888 INFO  L130     BoogieDeclarations]: Found specification of procedure realizable
[2025-04-28 21:21:13,888 INFO  L138     BoogieDeclarations]: Found implementation of procedure realizable
[2025-04-28 21:21:13,889 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure funcStart__syn given in one single declaration
[2025-04-28 21:21:13,889 INFO  L130     BoogieDeclarations]: Found specification of procedure funcStart__syn
[2025-04-28 21:21:13,889 INFO  L138     BoogieDeclarations]: Found implementation of procedure funcStart__syn
[2025-04-28 21:21:13,889 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure funcE__syn given in one single declaration
[2025-04-28 21:21:13,889 INFO  L130     BoogieDeclarations]: Found specification of procedure funcE__syn
[2025-04-28 21:21:13,889 INFO  L138     BoogieDeclarations]: Found implementation of procedure funcE__syn
[2025-04-28 21:21:13,889 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:13,889 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:13,889 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:13,982 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:13,985 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:14,204 INFO  L?                        ?]: Removed 6 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:14,204 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:14,218 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:14,221 INFO  L312             CfgBuilder]: Removed 1 assume(true) statements.
[2025-04-28 21:21:14,222 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:14 BoogieIcfgContainer
[2025-04-28 21:21:14,222 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:14,229 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:14,229 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:14,235 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:14,239 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:13" (1/3) ...
[2025-04-28 21:21:14,240 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220ef506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:14, skipping insertion in model container
[2025-04-28 21:21:14,241 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:13" (2/3) ...
[2025-04-28 21:21:14,241 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@220ef506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:14, skipping insertion in model container
[2025-04-28 21:21:14,241 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:14" (3/3) ...
[2025-04-28 21:21:14,242 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:14,261 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:14,265 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 5 procedures, 24 locations, 41 edges, 5 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:14,325 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:14,339 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;@4e7c856d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:14,339 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:14,346 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 24 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 13 states have internal predecessors, (14), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9)
[2025-04-28 21:21:14,358 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:14,360 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:14,361 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:14,362 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:14,369 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:14,370 INFO  L85        PathProgramCache]: Analyzing trace with hash -1111796859, now seen corresponding path program 1 times
[2025-04-28 21:21:14,378 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:14,379 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49626602]
[2025-04-28 21:21:14,379 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:14,380 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:14,430 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:14,461 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:14,461 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:14,461 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:15,417 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:15,418 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:15,418 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49626602]
[2025-04-28 21:21:15,419 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49626602] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:15,419 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:15,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:15,424 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902229510]
[2025-04-28 21:21:15,425 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:15,429 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:15,429 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:15,459 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:15,460 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:15,462 INFO  L87              Difference]: Start difference. First operand  has 24 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 13 states have internal predecessors, (14), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:15,717 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:15,718 INFO  L93              Difference]: Finished difference Result 26 states and 38 transitions.
[2025-04-28 21:21:15,719 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:15,721 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-04-28 21:21:15,721 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:15,730 INFO  L225             Difference]: With dead ends: 26
[2025-04-28 21:21:15,730 INFO  L226             Difference]: Without dead ends: 24
[2025-04-28 21:21:15,732 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:15,735 INFO  L437           NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:15,736 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 97 Invalid, 46 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:15,770 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2025-04-28 21:21:15,808 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24.
[2025-04-28 21:21:15,809 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 13 states have internal predecessors, (13), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14)
[2025-04-28 21:21:15,815 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions.
[2025-04-28 21:21:15,816 INFO  L79                 Accepts]: Start accepts. Automaton has 24 states and 36 transitions. Word has length 16
[2025-04-28 21:21:15,817 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:15,821 INFO  L485      AbstractCegarLoop]: Abstraction has 24 states and 36 transitions.
[2025-04-28 21:21:15,822 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:15,822 INFO  L278                IsEmpty]: Start isEmpty. Operand 24 states and 36 transitions.
[2025-04-28 21:21:15,823 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2025-04-28 21:21:15,824 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:15,824 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:15,825 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:15,825 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:15,828 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:15,828 INFO  L85        PathProgramCache]: Analyzing trace with hash 1639392211, now seen corresponding path program 1 times
[2025-04-28 21:21:15,828 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:15,828 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326241617]
[2025-04-28 21:21:15,828 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:15,828 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:15,855 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes.
[2025-04-28 21:21:15,863 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements.
[2025-04-28 21:21:15,863 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:15,864 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:16,266 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:16,266 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:16,266 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326241617]
[2025-04-28 21:21:16,266 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326241617] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:16,266 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:16,266 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:16,267 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991572390]
[2025-04-28 21:21:16,267 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:16,268 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:16,268 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:16,269 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:16,269 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:16,269 INFO  L87              Difference]: Start difference. First operand 24 states and 36 transitions. Second operand  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:16,450 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:16,450 INFO  L93              Difference]: Finished difference Result 28 states and 44 transitions.
[2025-04-28 21:21:16,451 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:16,451 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 16
[2025-04-28 21:21:16,451 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:16,452 INFO  L225             Difference]: With dead ends: 28
[2025-04-28 21:21:16,452 INFO  L226             Difference]: Without dead ends: 26
[2025-04-28 21:21:16,452 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:16,453 INFO  L437           NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:16,453 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 126 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:16,454 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2025-04-28 21:21:16,462 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24.
[2025-04-28 21:21:16,463 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (14), 7 states have call predecessors, (14), 9 states have call successors, (14)
[2025-04-28 21:21:16,463 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 36 transitions.
[2025-04-28 21:21:16,464 INFO  L79                 Accepts]: Start accepts. Automaton has 24 states and 36 transitions. Word has length 16
[2025-04-28 21:21:16,465 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:16,465 INFO  L485      AbstractCegarLoop]: Abstraction has 24 states and 36 transitions.
[2025-04-28 21:21:16,466 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 3 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4)
[2025-04-28 21:21:16,466 INFO  L278                IsEmpty]: Start isEmpty. Operand 24 states and 36 transitions.
[2025-04-28 21:21:16,467 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:16,468 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:16,468 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:16,468 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:16,469 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:16,469 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:16,469 INFO  L85        PathProgramCache]: Analyzing trace with hash 2113020537, now seen corresponding path program 1 times
[2025-04-28 21:21:16,469 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:16,469 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659904466]
[2025-04-28 21:21:16,469 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:16,470 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:16,489 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:16,496 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:16,497 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:16,497 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:17,096 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:17,097 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:17,097 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659904466]
[2025-04-28 21:21:17,097 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659904466] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:17,097 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426907219]
[2025-04-28 21:21:17,097 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:17,097 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:17,102 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:17,107 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:17,110 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:17,188 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:17,226 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:17,227 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:17,227 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:17,234 INFO  L256         TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 22 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:17,246 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:17,997 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:17,998 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:24,167 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:24,167 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [426907219] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:24,167 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:24,168 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17
[2025-04-28 21:21:24,168 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935400587]
[2025-04-28 21:21:24,168 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:24,168 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-04-28 21:21:24,168 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:24,169 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-04-28 21:21:24,169 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:24,170 INFO  L87              Difference]: Start difference. First operand 24 states and 36 transitions. Second operand  has 17 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (11), 5 states have call predecessors, (11), 9 states have call successors, (11)
[2025-04-28 21:21:24,582 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:24,583 INFO  L93              Difference]: Finished difference Result 32 states and 57 transitions.
[2025-04-28 21:21:24,584 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:24,584 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (11), 5 states have call predecessors, (11), 9 states have call successors, (11) Word has length 20
[2025-04-28 21:21:24,584 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:24,585 INFO  L225             Difference]: With dead ends: 32
[2025-04-28 21:21:24,585 INFO  L226             Difference]: Without dead ends: 30
[2025-04-28 21:21:24,586 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342
[2025-04-28 21:21:24,587 INFO  L437           NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:24,587 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 179 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:21:24,591 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2025-04-28 21:21:24,602 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26.
[2025-04-28 21:21:24,606 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26 states, 10 states have (on average 1.4) internal successors, (14), 14 states have internal predecessors, (14), 9 states have call successors, (9), 4 states have call predecessors, (9), 6 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19)
[2025-04-28 21:21:24,607 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 42 transitions.
[2025-04-28 21:21:24,608 INFO  L79                 Accepts]: Start accepts. Automaton has 26 states and 42 transitions. Word has length 20
[2025-04-28 21:21:24,609 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:24,609 INFO  L485      AbstractCegarLoop]: Abstraction has 26 states and 42 transitions.
[2025-04-28 21:21:24,609 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 16 states have internal predecessors, (21), 9 states have call successors, (10), 1 states have call predecessors, (10), 8 states have return successors, (11), 5 states have call predecessors, (11), 9 states have call successors, (11)
[2025-04-28 21:21:24,609 INFO  L278                IsEmpty]: Start isEmpty. Operand 26 states and 42 transitions.
[2025-04-28 21:21:24,612 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2025-04-28 21:21:24,613 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:24,613 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:24,622 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:24,813 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:24,814 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:24,814 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:24,814 INFO  L85        PathProgramCache]: Analyzing trace with hash 305862471, now seen corresponding path program 1 times
[2025-04-28 21:21:24,815 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:24,815 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754829598]
[2025-04-28 21:21:24,815 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:24,815 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:24,824 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:24,833 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:24,833 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:24,833 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:24,833 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-04-28 21:21:24,837 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes.
[2025-04-28 21:21:24,843 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements.
[2025-04-28 21:21:24,843 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:24,843 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:24,860 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-04-28 21:21:24,860 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-04-28 21:21:24,862 INFO  L790   garLoopResultBuilder]: Registering result UNSAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:24,864 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:21:24,867 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2025-04-28 21:21:24,883 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:24,886 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:24 BoogieIcfgContainer
[2025-04-28 21:21:24,886 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:24,887 INFO  L158              Benchmark]: Toolchain (without parser) took 11208.51ms. Allocated memory is still 234.9MB. Free memory was 160.3MB in the beginning and 182.7MB in the end (delta: -22.3MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:24,887 INFO  L158              Benchmark]: SmtParser took 1.12ms. 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:24,887 INFO  L158              Benchmark]: ChcToBoogie took 51.76ms. Allocated memory is still 234.9MB. Free memory was 160.3MB in the beginning and 159.5MB in the end (delta: 838.9kB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:24,888 INFO  L158              Benchmark]: Boogie Preprocessor took 102.09ms. Allocated memory is still 234.9MB. Free memory was 159.5MB in the beginning and 157.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:24,888 INFO  L158              Benchmark]: RCFGBuilder took 392.12ms. Allocated memory is still 234.9MB. Free memory was 157.0MB in the beginning and 141.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-04-28 21:21:24,888 INFO  L158              Benchmark]: TraceAbstraction took 10657.41ms. Allocated memory is still 234.9MB. Free memory was 140.4MB in the beginning and 182.7MB in the end (delta: -42.3MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:24,890 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.12ms. Allocated memory is still 234.9MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 51.76ms. Allocated memory is still 234.9MB. Free memory was 160.3MB in the beginning and 159.5MB in the end (delta: 838.9kB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 102.09ms. Allocated memory is still 234.9MB. Free memory was 159.5MB in the beginning and 157.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 392.12ms. Allocated memory is still 234.9MB. Free memory was 157.0MB in the beginning and 141.3MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 10657.41ms. Allocated memory is still 234.9MB. Free memory was 140.4MB in the beginning and 182.7MB in the end (delta: -42.3MB). 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]  CALL  call realizable();
[L0]        assume (((((((((((((!!hbv_realizable_v_26_5 && !!hbv_realizable_v_19_19) && !hbv_realizable_v_27_11) && !!hbv_realizable_v_22_24) && !hbv_realizable_v_21_16) && !!hbv_realizable_v_24_15) && !((((hbv_realizable_P_20 || hbv_realizable_Q_21) && (hbv_realizable_O_22 || !hbv_realizable_Q_21)) || hbv_realizable_A_23) && (((!hbv_realizable_O_22 && hbv_realizable_Q_21) || !hbv_realizable_A_23) || (!hbv_realizable_P_20 && !hbv_realizable_Q_21)))) && hbv_realizable_v_17_1 == 0) && !hbv_realizable_v_23_10) && !((((!hbv_realizable_L_6 && !hbv_realizable_K_7) || !hbv_realizable_C_8) || (!hbv_realizable_J_9 && hbv_realizable_L_6)) && (((hbv_realizable_K_7 || hbv_realizable_L_6) && (!hbv_realizable_L_6 || hbv_realizable_J_9)) || hbv_realizable_C_8))) && !!hbv_realizable_v_18_25) && !(((!hbv_realizable_H_12 && hbv_realizable_I_13) || !hbv_realizable_D_14) && ((hbv_realizable_H_12 || hbv_realizable_D_14) || !hbv_realizable_I_13))) && !hbv_realizable_v_25_17) && !(((hbv_realizable_N_2 && hbv_realizable_M_3) || hbv_realizable_B_4) && ((!hbv_realizable_B_4 || !hbv_realizable_M_3) || !hbv_realizable_N_2))) && !hbv_realizable_v_20_18;
      VAL   [hbv_realizable_A_23=true, hbv_realizable_B_4=false, hbv_realizable_C_8=true, hbv_realizable_D_14=true, hbv_realizable_I_13=false, hbv_realizable_L_6=false, hbv_realizable_N_2=false, hbv_realizable_Q_21=false, hbv_realizable_v_17_1=0, hbv_realizable_v_18_25=true, hbv_realizable_v_19_19=true, hbv_realizable_v_20_18=false, hbv_realizable_v_21_16=false, hbv_realizable_v_22_24=true, hbv_realizable_v_23_10=false, hbv_realizable_v_24_15=true, hbv_realizable_v_25_17=false, hbv_realizable_v_26_5=true, hbv_realizable_v_27_11=false]
[L0]  CALL  call funcStart__syn(hbv_realizable_E_26, hbv_realizable_v_17_1, hbv_realizable_v_18_25, hbv_realizable_v_19_19, hbv_realizable_v_20_18, hbv_realizable_v_21_16, hbv_realizable_v_22_24, hbv_realizable_v_23_10, hbv_realizable_v_24_15, hbv_realizable_v_25_17, hbv_realizable_v_26_5, hbv_realizable_v_27_11, hbv_realizable_F_27, hbv_realizable_G_28, hbv_realizable_D_14, hbv_realizable_I_13, hbv_realizable_C_8, hbv_realizable_L_6, hbv_realizable_B_4, hbv_realizable_N_2, hbv_realizable_A_23, hbv_realizable_Q_21);
      VAL   [hhv_funcStart__syn_C_19=false, hhv_funcStart__syn_D_18=false, hhv_funcStart__syn_E_15=false, hhv_funcStart__syn_F_14=true, hhv_funcStart__syn_H_1=0, hhv_funcStart__syn_J_13=3, hhv_funcStart__syn_L_4=false, hhv_funcStart__syn_M_2=true, hhv_funcStart__syn_O_5=false, hhv_funcStart__syn_P_6=true, hhv_funcStart__syn_Q_7=false, hhv_funcStart__syn_S_8=true, hhv_funcStart__syn_T_3=true, hhv_funcStart__syn_V_9=false, hhv_funcStart__syn_W_10=true, hhv_funcStart__syn_X_11=false, hhv_funcStart__syn_v_24_16=true, hhv_funcStart__syn_v_25_17=false, hhv_funcStart__syn_v_26_20=true, hhv_funcStart__syn_v_27_21=false]
[L0]        assume ((((((((!((((!hhv_funcStart__syn_O_5 && !hhv_funcStart__syn_M_2) || (hhv_funcStart__syn_M_2 && !hbv_funcStart__syn_N_5)) || !hhv_funcStart__syn_E_15) && (((!hhv_funcStart__syn_M_2 || hbv_funcStart__syn_N_5) && (hhv_funcStart__syn_O_5 || hhv_funcStart__syn_M_2)) || hhv_funcStart__syn_E_15)) && !((hhv_funcStart__syn_Q_7 || hhv_funcStart__syn_v_25_17) && (!hhv_funcStart__syn_v_25_17 || !hhv_funcStart__syn_Q_7))) && !((!hhv_funcStart__syn_v_27_21 || !hhv_funcStart__syn_X_11) && (hhv_funcStart__syn_X_11 || hhv_funcStart__syn_v_27_21))) && !((hhv_funcStart__syn_W_10 || hhv_funcStart__syn_v_26_20) && (!hhv_funcStart__syn_v_26_20 || !hhv_funcStart__syn_W_10))) && !((((hhv_funcStart__syn_S_8 || hhv_funcStart__syn_T_3) && (!hhv_funcStart__syn_T_3 || hbv_funcStart__syn_R_6)) || hhv_funcStart__syn_D_18) && (((!hbv_funcStart__syn_R_6 && hhv_funcStart__syn_T_3) || !hhv_funcStart__syn_D_18) || (!hhv_funcStart__syn_T_3 && !hhv_funcStart__syn_S_8)))) && hhv_funcStart__syn_G_0[hhv_funcStart__syn_H_1 := 0] == hbv_funcStart__syn_B_4) && !((hhv_funcStart__syn_F_14 || ((!hhv_funcStart__syn_M_2 || hbv_funcStart__syn_K_3) && (hhv_funcStart__syn_L_4 || hhv_funcStart__syn_M_2))) && ((!hhv_funcStart__syn_F_14 || (!hhv_funcStart__syn_L_4 && !hhv_funcStart__syn_M_2)) || (!hbv_funcStart__syn_K_3 && hhv_funcStart__syn_M_2)))) && !((!hhv_funcStart__syn_P_6 || !hhv_funcStart__syn_v_24_16) && (hhv_funcStart__syn_P_6 || hhv_funcStart__syn_v_24_16))) && !((((hhv_funcStart__syn_T_3 && !hbv_funcStart__syn_U_1) || !hhv_funcStart__syn_C_19) || (!hhv_funcStart__syn_T_3 && !hhv_funcStart__syn_V_9)) && (((!hhv_funcStart__syn_T_3 || hbv_funcStart__syn_U_1) && (hhv_funcStart__syn_V_9 || hhv_funcStart__syn_T_3)) || hhv_funcStart__syn_C_19))) && hbv_funcStart__syn_A_2 == hhv_funcStart__syn_H_1 + 1;
      VAL   [hbv_funcStart__syn_A_2=1, hbv_funcStart__syn_K_3=true, hbv_funcStart__syn_N_5=false, hbv_funcStart__syn_R_6=false, hbv_funcStart__syn_U_1=false, hhv_funcStart__syn_C_19=false, hhv_funcStart__syn_D_18=false, hhv_funcStart__syn_E_15=false, hhv_funcStart__syn_F_14=true, hhv_funcStart__syn_H_1=0, hhv_funcStart__syn_J_13=3, hhv_funcStart__syn_L_4=false, hhv_funcStart__syn_M_2=true, hhv_funcStart__syn_O_5=false, hhv_funcStart__syn_P_6=true, hhv_funcStart__syn_Q_7=false, hhv_funcStart__syn_S_8=true, hhv_funcStart__syn_T_3=true, hhv_funcStart__syn_V_9=false, hhv_funcStart__syn_W_10=true, hhv_funcStart__syn_X_11=false, hhv_funcStart__syn_v_24_16=true, hhv_funcStart__syn_v_25_17=false, hhv_funcStart__syn_v_26_20=true, hhv_funcStart__syn_v_27_21=false]
[L0]  CALL  call funcE__syn(hbv_funcStart__syn_B_4, hbv_funcStart__syn_A_2, hhv_funcStart__syn_M_2, hhv_funcStart__syn_T_3, hhv_funcStart__syn_L_4, hhv_funcStart__syn_O_5, hhv_funcStart__syn_P_6, hhv_funcStart__syn_Q_7, hhv_funcStart__syn_S_8, hhv_funcStart__syn_V_9, hhv_funcStart__syn_W_10, hhv_funcStart__syn_X_11, hhv_funcStart__syn_I_12, hhv_funcStart__syn_J_13, hbv_funcStart__syn_K_3, hbv_funcStart__syn_N_5, hbv_funcStart__syn_R_6, hbv_funcStart__syn_U_1);
      VAL   [hhv_funcE__syn_B_1=1, hhv_funcE__syn_C_2=true, hhv_funcE__syn_D_3=true, hhv_funcE__syn_E_6=true, hhv_funcE__syn_F_7=false, hhv_funcE__syn_G_10=true, hhv_funcE__syn_H_11=false, hhv_funcE__syn_J_13=3, hhv_funcE__syn_K_4=false, hhv_funcE__syn_L_5=false, hhv_funcE__syn_M_8=true, hhv_funcE__syn_N_9=false, hhv_funcE__syn_v_14_14=true, hhv_funcE__syn_v_15_15=false, hhv_funcE__syn_v_16_16=false, hhv_funcE__syn_v_17_17=false]
[L0]        assume ((((!(!hhv_funcE__syn_v_16_16 && !hbv_funcE__syn_U_2) && hhv_funcE__syn_B_1 + 1 == hbv_funcE__syn_A_3) && !(hhv_funcE__syn_v_14_14 && hbv_funcE__syn_S_4)) && !(hhv_funcE__syn_v_16_16 && hbv_funcE__syn_U_2)) && hhv_funcE__syn_A_0[hhv_funcE__syn_B_1 := 8] == hbv_funcE__syn_B_1) && !(!hbv_funcE__syn_S_4 && !hhv_funcE__syn_v_14_14);
      VAL   [hbv_funcE__syn_A_3=2, hbv_funcE__syn_S_4=false, hbv_funcE__syn_U_2=true, hhv_funcE__syn_B_1=1, hhv_funcE__syn_C_2=true, hhv_funcE__syn_D_3=true, hhv_funcE__syn_E_6=true, hhv_funcE__syn_F_7=false, hhv_funcE__syn_G_10=true, hhv_funcE__syn_H_11=false, hhv_funcE__syn_J_13=3, hhv_funcE__syn_K_4=false, hhv_funcE__syn_L_5=false, hhv_funcE__syn_M_8=true, hhv_funcE__syn_N_9=false, hhv_funcE__syn_v_14_14=true, hhv_funcE__syn_v_15_15=false, hhv_funcE__syn_v_16_16=false, hhv_funcE__syn_v_17_17=false]
[L0]  CALL  call funcE__syn(hbv_funcE__syn_B_1, hbv_funcE__syn_A_3, hhv_funcE__syn_C_2, hhv_funcE__syn_D_3, hhv_funcE__syn_K_4, hhv_funcE__syn_L_5, hhv_funcE__syn_E_6, hhv_funcE__syn_F_7, hhv_funcE__syn_M_8, hhv_funcE__syn_N_9, hhv_funcE__syn_G_10, hhv_funcE__syn_H_11, hhv_funcE__syn_I_12, hhv_funcE__syn_J_13, hbv_funcE__syn_S_4, hhv_funcE__syn_v_15_15, hbv_funcE__syn_U_2, hhv_funcE__syn_v_17_17);
      VAL   [hhv_funcE__syn_B_1=2, hhv_funcE__syn_C_2=true, hhv_funcE__syn_D_3=true, hhv_funcE__syn_E_6=true, hhv_funcE__syn_F_7=false, hhv_funcE__syn_G_10=true, hhv_funcE__syn_H_11=false, hhv_funcE__syn_J_13=3, hhv_funcE__syn_K_4=false, hhv_funcE__syn_L_5=false, hhv_funcE__syn_M_8=true, hhv_funcE__syn_N_9=false, hhv_funcE__syn_v_14_14=false, hhv_funcE__syn_v_15_15=false, hhv_funcE__syn_v_16_16=true, hhv_funcE__syn_v_17_17=false]
[L0]        assume ((((hhv_funcE__syn_A_0[hhv_funcE__syn_B_1 := 6] == hhv_funcE__syn_I_12 && !((hhv_funcE__syn_M_8 || hhv_funcE__syn_v_16_16) && (!hhv_funcE__syn_v_16_16 || !hhv_funcE__syn_M_8))) && hhv_funcE__syn_B_1 + 1 == hhv_funcE__syn_J_13) && !((hhv_funcE__syn_N_9 || hhv_funcE__syn_v_17_17) && (!hhv_funcE__syn_v_17_17 || !hhv_funcE__syn_N_9))) && !((hhv_funcE__syn_L_5 || hhv_funcE__syn_v_15_15) && (!hhv_funcE__syn_L_5 || !hhv_funcE__syn_v_15_15))) && !((hhv_funcE__syn_K_4 || hhv_funcE__syn_v_14_14) && (!hhv_funcE__syn_K_4 || !hhv_funcE__syn_v_14_14));
      VAL   [hhv_funcE__syn_B_1=2, hhv_funcE__syn_C_2=true, hhv_funcE__syn_D_3=true, hhv_funcE__syn_E_6=true, hhv_funcE__syn_F_7=false, hhv_funcE__syn_G_10=true, hhv_funcE__syn_H_11=false, hhv_funcE__syn_J_13=3, hhv_funcE__syn_K_4=false, hhv_funcE__syn_L_5=false, hhv_funcE__syn_M_8=true, hhv_funcE__syn_N_9=false, hhv_funcE__syn_v_14_14=false, hhv_funcE__syn_v_15_15=false, hhv_funcE__syn_v_16_16=true, hhv_funcE__syn_v_17_17=false]
[L0]  RET   call funcE__syn(hbv_funcE__syn_B_1, hbv_funcE__syn_A_3, hhv_funcE__syn_C_2, hhv_funcE__syn_D_3, hhv_funcE__syn_K_4, hhv_funcE__syn_L_5, hhv_funcE__syn_E_6, hhv_funcE__syn_F_7, hhv_funcE__syn_M_8, hhv_funcE__syn_N_9, hhv_funcE__syn_G_10, hhv_funcE__syn_H_11, hhv_funcE__syn_I_12, hhv_funcE__syn_J_13, hbv_funcE__syn_S_4, hhv_funcE__syn_v_15_15, hbv_funcE__syn_U_2, hhv_funcE__syn_v_17_17);
      VAL   [hbv_funcE__syn_A_3=2, hbv_funcE__syn_S_4=false, hbv_funcE__syn_U_2=true, hhv_funcE__syn_B_1=1, hhv_funcE__syn_C_2=true, hhv_funcE__syn_D_3=true, hhv_funcE__syn_E_6=true, hhv_funcE__syn_F_7=false, hhv_funcE__syn_G_10=true, hhv_funcE__syn_H_11=false, hhv_funcE__syn_J_13=3, hhv_funcE__syn_K_4=false, hhv_funcE__syn_L_5=false, hhv_funcE__syn_M_8=true, hhv_funcE__syn_N_9=false, hhv_funcE__syn_v_14_14=true, hhv_funcE__syn_v_15_15=false, hhv_funcE__syn_v_16_16=false, hhv_funcE__syn_v_17_17=false]
[L0]  RET   call funcE__syn(hbv_funcStart__syn_B_4, hbv_funcStart__syn_A_2, hhv_funcStart__syn_M_2, hhv_funcStart__syn_T_3, hhv_funcStart__syn_L_4, hhv_funcStart__syn_O_5, hhv_funcStart__syn_P_6, hhv_funcStart__syn_Q_7, hhv_funcStart__syn_S_8, hhv_funcStart__syn_V_9, hhv_funcStart__syn_W_10, hhv_funcStart__syn_X_11, hhv_funcStart__syn_I_12, hhv_funcStart__syn_J_13, hbv_funcStart__syn_K_3, hbv_funcStart__syn_N_5, hbv_funcStart__syn_R_6, hbv_funcStart__syn_U_1);
      VAL   [hbv_funcStart__syn_A_2=1, hbv_funcStart__syn_K_3=true, hbv_funcStart__syn_N_5=false, hbv_funcStart__syn_R_6=false, hbv_funcStart__syn_U_1=false, hhv_funcStart__syn_C_19=false, hhv_funcStart__syn_D_18=false, hhv_funcStart__syn_E_15=false, hhv_funcStart__syn_F_14=true, hhv_funcStart__syn_H_1=0, hhv_funcStart__syn_J_13=3, hhv_funcStart__syn_L_4=false, hhv_funcStart__syn_M_2=true, hhv_funcStart__syn_O_5=false, hhv_funcStart__syn_P_6=true, hhv_funcStart__syn_Q_7=false, hhv_funcStart__syn_S_8=true, hhv_funcStart__syn_T_3=true, hhv_funcStart__syn_V_9=false, hhv_funcStart__syn_W_10=true, hhv_funcStart__syn_X_11=false, hhv_funcStart__syn_v_24_16=true, hhv_funcStart__syn_v_25_17=false, hhv_funcStart__syn_v_26_20=true, hhv_funcStart__syn_v_27_21=false]
[L0]  RET   call funcStart__syn(hbv_realizable_E_26, hbv_realizable_v_17_1, hbv_realizable_v_18_25, hbv_realizable_v_19_19, hbv_realizable_v_20_18, hbv_realizable_v_21_16, hbv_realizable_v_22_24, hbv_realizable_v_23_10, hbv_realizable_v_24_15, hbv_realizable_v_25_17, hbv_realizable_v_26_5, hbv_realizable_v_27_11, hbv_realizable_F_27, hbv_realizable_G_28, hbv_realizable_D_14, hbv_realizable_I_13, hbv_realizable_C_8, hbv_realizable_L_6, hbv_realizable_B_4, hbv_realizable_N_2, hbv_realizable_A_23, hbv_realizable_Q_21);
      VAL   [hbv_realizable_A_23=true, hbv_realizable_B_4=false, hbv_realizable_C_8=true, hbv_realizable_D_14=true, hbv_realizable_G_28=3, hbv_realizable_I_13=false, hbv_realizable_L_6=false, hbv_realizable_N_2=false, hbv_realizable_Q_21=false, hbv_realizable_v_17_1=0, hbv_realizable_v_18_25=true, hbv_realizable_v_19_19=true, hbv_realizable_v_20_18=false, hbv_realizable_v_21_16=false, hbv_realizable_v_22_24=true, hbv_realizable_v_23_10=false, hbv_realizable_v_24_15=true, hbv_realizable_v_25_17=false, hbv_realizable_v_26_5=true, hbv_realizable_v_27_11=false]
[L0]  RET   call realizable();
[L0]  RET   call False();
[L0]        assert false;

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 5 procedures, 24 locations, 41 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 402 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 326 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 277 IncrementalHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 76 mSDtfsCounter, 277 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=3, InterpolantAutomatonStates: 20, 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, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 622 SizeOfPredicates, 9 NumberOfNonLiveVariables, 136 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 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:24,905 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
