./chc-comp-wrapper.sh ../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-204.smt2 .


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:48,087 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:48,175 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5446ded1-1430-4f73-8a0d-99ec7332e62e/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:48,180 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:48,180 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:48,206 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:48,206 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:48,207 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:48,207 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:48,207 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:48,207 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:48,207 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:48,208 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:48,208 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:48,208 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:48,208 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:48,208 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:48,209 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:48,210 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:48,210 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:48,210 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:48,210 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:48,211 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:48,211 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:48,211 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:48,212 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:48,212 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:48,567 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:48,580 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:48,583 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:48,585 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:48,586 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:48,587 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5446ded1-1430-4f73-8a0d-99ec7332e62e/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-204.smt2
[2025-04-28 21:21:48,590 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:48,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:49,117 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5446ded1-1430-4f73-8a0d-99ec7332e62e/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-204.smt2
[2025-04-28 21:21:49,122 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:49,123 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:49,124 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:49,124 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:49,125 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:49,128 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,174 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49 Unit
[2025-04-28 21:21:49,174 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:49,177 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:49,177 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:49,177 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:49,195 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,195 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,234 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,235 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,250 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,252 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,258 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,264 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,265 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,293 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:49,294 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:49,294 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:49,294 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:49,298 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (1/1) ...
[2025-04-28 21:21:49,301 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:49,320 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:49,333 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:49,343 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:49,355 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:49,355 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:49,355 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:49,355 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure CHC_COMP_FALSE given in one single declaration
[2025-04-28 21:21:49,355 INFO  L130     BoogieDeclarations]: Found specification of procedure CHC_COMP_FALSE
[2025-04-28 21:21:49,355 INFO  L138     BoogieDeclarations]: Found implementation of procedure CHC_COMP_FALSE
[2025-04-28 21:21:49,355 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure combined_lturn__bar given in one single declaration
[2025-04-28 21:21:49,355 INFO  L130     BoogieDeclarations]: Found specification of procedure combined_lturn__bar
[2025-04-28 21:21:49,356 INFO  L138     BoogieDeclarations]: Found implementation of procedure combined_lturn__bar
[2025-04-28 21:21:49,356 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure step_lturn__bar given in one single declaration
[2025-04-28 21:21:49,356 INFO  L130     BoogieDeclarations]: Found specification of procedure step_lturn__bar
[2025-04-28 21:21:49,356 INFO  L138     BoogieDeclarations]: Found implementation of procedure step_lturn__bar
[2025-04-28 21:21:49,356 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure step_lturn given in one single declaration
[2025-04-28 21:21:49,356 INFO  L130     BoogieDeclarations]: Found specification of procedure step_lturn
[2025-04-28 21:21:49,356 INFO  L138     BoogieDeclarations]: Found implementation of procedure step_lturn
[2025-04-28 21:21:49,356 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure combined_lturn given in one single declaration
[2025-04-28 21:21:49,356 INFO  L130     BoogieDeclarations]: Found specification of procedure combined_lturn
[2025-04-28 21:21:49,356 INFO  L138     BoogieDeclarations]: Found implementation of procedure combined_lturn
[2025-04-28 21:21:49,356 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure lturn given in one single declaration
[2025-04-28 21:21:49,356 INFO  L130     BoogieDeclarations]: Found specification of procedure lturn
[2025-04-28 21:21:49,356 INFO  L138     BoogieDeclarations]: Found implementation of procedure lturn
[2025-04-28 21:21:49,357 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:49,357 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:49,357 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:49,439 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:49,443 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:50,086 INFO  L?                        ?]: Removed 4 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:50,086 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:50,113 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:50,113 INFO  L312             CfgBuilder]: Removed 12 assume(true) statements.
[2025-04-28 21:21:50,116 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:50 BoogieIcfgContainer
[2025-04-28 21:21:50,116 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:50,119 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:50,119 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:50,125 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:50,126 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:49" (1/3) ...
[2025-04-28 21:21:50,126 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d16009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:50, skipping insertion in model container
[2025-04-28 21:21:50,126 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:49" (2/3) ...
[2025-04-28 21:21:50,127 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d16009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:50, skipping insertion in model container
[2025-04-28 21:21:50,127 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:50" (3/3) ...
[2025-04-28 21:21:50,128 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:50,146 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:50,149 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 8 procedures, 150 locations, 455 edges, 8 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:50,241 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:50,267 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;@4fc94f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:50,267 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:50,273 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 150 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 38 states have internal predecessors, (44), 131 states have call successors, (137), 7 states have call predecessors, (137), 7 states have return successors, (137), 105 states have call predecessors, (137), 131 states have call successors, (137)
[2025-04-28 21:21:50,309 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2025-04-28 21:21:50,310 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:50,310 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:50,311 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:50,316 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:50,317 INFO  L85        PathProgramCache]: Analyzing trace with hash -156055436, now seen corresponding path program 1 times
[2025-04-28 21:21:50,325 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:50,325 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108141846]
[2025-04-28 21:21:50,325 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:50,326 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:50,364 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-04-28 21:21:50,430 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:50,434 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:50,435 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,021 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:51,023 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:51,023 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108141846]
[2025-04-28 21:21:51,024 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108141846] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:51,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:51,029 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:51,030 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943545581]
[2025-04-28 21:21:51,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:51,037 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:51,037 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:51,134 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:51,136 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:51,146 INFO  L87              Difference]: Start difference. First operand  has 150 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 38 states have internal predecessors, (44), 131 states have call successors, (137), 7 states have call predecessors, (137), 7 states have return successors, (137), 105 states have call predecessors, (137), 131 states have call successors, (137) Second operand  has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6)
[2025-04-28 21:21:53,193 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:53,193 INFO  L93              Difference]: Finished difference Result 201 states and 592 transitions.
[2025-04-28 21:21:53,194 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:53,195 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 21
[2025-04-28 21:21:53,196 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:53,216 INFO  L225             Difference]: With dead ends: 201
[2025-04-28 21:21:53,217 INFO  L226             Difference]: Without dead ends: 201
[2025-04-28 21:21:53,221 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:53,224 INFO  L437           NwaCegarLoop]: 258 mSDtfsCounter, 9 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:53,225 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1376 Invalid, 1169 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-04-28 21:21:53,242 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 201 states.
[2025-04-28 21:21:53,491 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199.
[2025-04-28 21:21:53,496 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 199 states, 16 states have (on average 3.75) internal successors, (60), 47 states have internal predecessors, (60), 176 states have call successors, (184), 9 states have call predecessors, (184), 10 states have return successors, (346), 143 states have call predecessors, (346), 176 states have call successors, (346)
[2025-04-28 21:21:53,513 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 590 transitions.
[2025-04-28 21:21:53,515 INFO  L79                 Accepts]: Start accepts. Automaton has 199 states and 590 transitions. Word has length 21
[2025-04-28 21:21:53,518 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:53,518 INFO  L485      AbstractCegarLoop]: Abstraction has 199 states and 590 transitions.
[2025-04-28 21:21:53,519 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6)
[2025-04-28 21:21:53,519 INFO  L278                IsEmpty]: Start isEmpty. Operand 199 states and 590 transitions.
[2025-04-28 21:21:53,534 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2025-04-28 21:21:53,534 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:53,535 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:53,535 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:53,535 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:53,536 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:53,536 INFO  L85        PathProgramCache]: Analyzing trace with hash -1106839192, now seen corresponding path program 1 times
[2025-04-28 21:21:53,536 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:53,536 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423300914]
[2025-04-28 21:21:53,537 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:53,537 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:53,552 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-04-28 21:21:53,601 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:53,601 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:53,602 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:53,817 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:53,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:53,818 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423300914]
[2025-04-28 21:21:53,818 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423300914] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:53,818 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:53,818 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-04-28 21:21:53,818 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974395727]
[2025-04-28 21:21:53,818 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:53,819 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-28 21:21:53,819 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:53,820 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-28 21:21:53,820 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:53,820 INFO  L87              Difference]: Start difference. First operand 199 states and 590 transitions. Second operand  has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6)
[2025-04-28 21:21:55,433 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:55,433 INFO  L93              Difference]: Finished difference Result 256 states and 939 transitions.
[2025-04-28 21:21:55,435 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-04-28 21:21:55,435 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 21
[2025-04-28 21:21:55,435 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:55,448 INFO  L225             Difference]: With dead ends: 256
[2025-04-28 21:21:55,448 INFO  L226             Difference]: Without dead ends: 255
[2025-04-28 21:21:55,449 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:55,450 INFO  L437           NwaCegarLoop]: 326 mSDtfsCounter, 10 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1730 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:55,452 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1730 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-04-28 21:21:55,454 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 255 states.
[2025-04-28 21:21:55,607 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253.
[2025-04-28 21:21:55,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 253 states, 20 states have (on average 3.65) internal successors, (73), 59 states have internal predecessors, (73), 224 states have call successors, (234), 11 states have call predecessors, (234), 13 states have return successors, (628), 184 states have call predecessors, (628), 224 states have call successors, (628)
[2025-04-28 21:21:55,618 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 935 transitions.
[2025-04-28 21:21:55,618 INFO  L79                 Accepts]: Start accepts. Automaton has 253 states and 935 transitions. Word has length 21
[2025-04-28 21:21:55,618 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:55,618 INFO  L485      AbstractCegarLoop]: Abstraction has 253 states and 935 transitions.
[2025-04-28 21:21:55,621 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (6), 1 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6)
[2025-04-28 21:21:55,621 INFO  L278                IsEmpty]: Start isEmpty. Operand 253 states and 935 transitions.
[2025-04-28 21:21:55,633 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:21:55,633 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:55,633 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:55,634 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:55,634 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:55,635 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:55,635 INFO  L85        PathProgramCache]: Analyzing trace with hash 1745452566, now seen corresponding path program 1 times
[2025-04-28 21:21:55,636 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:55,636 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841749166]
[2025-04-28 21:21:55,636 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:55,636 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:55,648 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:55,662 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:55,662 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:55,662 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:56,013 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:56,014 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:56,014 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841749166]
[2025-04-28 21:21:56,014 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841749166] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:56,014 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144745458]
[2025-04-28 21:21:56,014 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:56,015 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:56,017 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:56,022 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:56,028 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:56,078 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:21:56,110 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:21:56,110 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:56,110 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:56,117 INFO  L256         TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 24 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:56,129 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:56,405 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:56,405 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:58,299 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:58,300 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144745458] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:58,300 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:58,300 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17
[2025-04-28 21:21:58,300 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047623729]
[2025-04-28 21:21:58,300 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:58,300 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2025-04-28 21:21:58,300 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:58,301 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2025-04-28 21:21:58,301 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:21:58,301 INFO  L87              Difference]: Start difference. First operand 253 states and 935 transitions. Second operand  has 17 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 4 states have call successors, (9), 1 states have call predecessors, (9), 13 states have return successors, (15), 11 states have call predecessors, (15), 4 states have call successors, (15)
[2025-04-28 21:22:02,694 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:02,694 INFO  L93              Difference]: Finished difference Result 303 states and 1886 transitions.
[2025-04-28 21:22:02,695 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-28 21:22:02,695 INFO  L79                 Accepts]: Start accepts. Automaton has  has 17 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 4 states have call successors, (9), 1 states have call predecessors, (9), 13 states have return successors, (15), 11 states have call predecessors, (15), 4 states have call successors, (15) Word has length 24
[2025-04-28 21:22:02,695 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:02,715 INFO  L225             Difference]: With dead ends: 303
[2025-04-28 21:22:02,715 INFO  L226             Difference]: Without dead ends: 303
[2025-04-28 21:22:02,715 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272
[2025-04-28 21:22:02,716 INFO  L437           NwaCegarLoop]: 258 mSDtfsCounter, 2 mSDsluCounter, 2896 mSDsCounter, 0 mSdLazyCounter, 3959 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3154 SdHoareTripleChecker+Invalid, 3967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:02,716 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3154 Invalid, 3967 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 3959 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time]
[2025-04-28 21:22:02,718 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 303 states.
[2025-04-28 21:22:03,156 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 298.
[2025-04-28 21:22:03,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 298 states, 31 states have (on average 2.7096774193548385) internal successors, (84), 71 states have internal predecessors, (84), 247 states have call successors, (257), 11 states have call predecessors, (257), 24 states have return successors, (1539), 217 states have call predecessors, (1539), 247 states have call successors, (1539)
[2025-04-28 21:22:03,173 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 1880 transitions.
[2025-04-28 21:22:03,173 INFO  L79                 Accepts]: Start accepts. Automaton has 298 states and 1880 transitions. Word has length 24
[2025-04-28 21:22:03,173 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:03,173 INFO  L485      AbstractCegarLoop]: Abstraction has 298 states and 1880 transitions.
[2025-04-28 21:22:03,174 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 4 states have call successors, (9), 1 states have call predecessors, (9), 13 states have return successors, (15), 11 states have call predecessors, (15), 4 states have call successors, (15)
[2025-04-28 21:22:03,174 INFO  L278                IsEmpty]: Start isEmpty. Operand 298 states and 1880 transitions.
[2025-04-28 21:22:03,188 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 25
[2025-04-28 21:22:03,189 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:03,189 INFO  L218           NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:22:03,195 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:22:03,393 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:22:03,393 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:03,396 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:03,396 INFO  L85        PathProgramCache]: Analyzing trace with hash -1341545523, now seen corresponding path program 1 times
[2025-04-28 21:22:03,396 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:03,396 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14833763]
[2025-04-28 21:22:03,396 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:03,396 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:03,408 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:22:03,426 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:22:03,426 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:03,426 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:22:03,426 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-04-28 21:22:03,430 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes.
[2025-04-28 21:22:03,442 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements.
[2025-04-28 21:22:03,443 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:03,443 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:22:03,467 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-04-28 21:22:03,467 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-04-28 21:22:03,469 INFO  L790   garLoopResultBuilder]: Registering result UNSAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:22:03,471 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:22:03,477 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2025-04-28 21:22:03,501 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:22:03,504 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:22:03 BoogieIcfgContainer
[2025-04-28 21:22:03,507 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:22:03,508 INFO  L158              Benchmark]: Toolchain (without parser) took 14385.34ms. Allocated memory is still 234.9MB. Free memory was 145.3MB in the beginning and 150.6MB in the end (delta: -5.2MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:22:03,509 INFO  L158              Benchmark]: SmtParser took 0.40ms. Allocated memory is still 234.9MB. Free memory is still 170.9MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:22:03,509 INFO  L158              Benchmark]: ChcToBoogie took 51.46ms. Allocated memory is still 234.9MB. Free memory was 145.3MB in the beginning and 143.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:22:03,509 INFO  L158              Benchmark]: Boogie Preprocessor took 116.05ms. Allocated memory is still 234.9MB. Free memory was 143.8MB in the beginning and 140.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:22:03,510 INFO  L158              Benchmark]: RCFGBuilder took 822.08ms. Allocated memory is still 234.9MB. Free memory was 140.8MB in the beginning and 88.2MB in the end (delta: 52.6MB). Peak memory consumption was 50.3MB. Max. memory is 33.6GB.
[2025-04-28 21:22:03,510 INFO  L158              Benchmark]: TraceAbstraction took 13388.57ms. Allocated memory is still 234.9MB. Free memory was 88.2MB in the beginning and 150.6MB in the end (delta: -62.3MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:22:03,512 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.40ms. Allocated memory is still 234.9MB. Free memory is still 170.9MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 51.46ms. Allocated memory is still 234.9MB. Free memory was 145.3MB in the beginning and 143.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 116.05ms. Allocated memory is still 234.9MB. Free memory was 143.8MB in the beginning and 140.8MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 822.08ms. Allocated memory is still 234.9MB. Free memory was 140.8MB in the beginning and 88.2MB in the end (delta: 52.6MB). Peak memory consumption was 50.3MB. Max. memory is 33.6GB.
 * TraceAbstraction took 13388.57ms. Allocated memory is still 234.9MB. Free memory was 88.2MB in the beginning and 150.6MB in the end (delta: -62.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 CHC_COMP_FALSE();
[L0]  CALL  call combined_lturn(hbv_CHC_COMP_FALSE_J_1, hbv_CHC_COMP_FALSE_v_14_2, hbv_CHC_COMP_FALSE_v_15_3, hbv_CHC_COMP_FALSE_v_13_4, hbv_CHC_COMP_FALSE_A_5, hbv_CHC_COMP_FALSE_B_6, hbv_CHC_COMP_FALSE_C_7, hbv_CHC_COMP_FALSE_D_8, hbv_CHC_COMP_FALSE_E_9, hbv_CHC_COMP_FALSE_F_10, hbv_CHC_COMP_FALSE_G_11, hbv_CHC_COMP_FALSE_M_12);
      VAL   [hhv_combined_lturn_A_1=1, hhv_combined_lturn_B_2=2, hhv_combined_lturn_C_3=0, hhv_combined_lturn_D_4=0, hhv_combined_lturn_E_5=0, hhv_combined_lturn_F_6=-1, hhv_combined_lturn_G_7=3, hhv_combined_lturn_H_8=0, hhv_combined_lturn_I_9=2, hhv_combined_lturn_J_10=0, hhv_combined_lturn_K_11=4, hhv_combined_lturn_L_0=0]
[L0]  CALL  call lturn(hhv_combined_lturn_L_0, hhv_combined_lturn_A_1, hhv_combined_lturn_B_2, hhv_combined_lturn_C_3, hhv_combined_lturn_D_4, hhv_combined_lturn_E_5, hhv_combined_lturn_F_6, hhv_combined_lturn_G_7, hhv_combined_lturn_H_8, hhv_combined_lturn_I_9, hhv_combined_lturn_J_10, hhv_combined_lturn_K_11);
      VAL   [hhv_lturn_A_1=1, hhv_lturn_B_2=2, hhv_lturn_C_3=0, hhv_lturn_D_4=0, hhv_lturn_E_5=0, hhv_lturn_F_6=-1, hhv_lturn_G_7=3, hhv_lturn_H_8=0, hhv_lturn_I_9=2, hhv_lturn_J_10=0, hhv_lturn_K_11=4, hhv_lturn_L_0=0]
[L0]        assume ((((((((((((((((!(hhv_lturn_B_2 < 2 + hhv_lturn_L_0) && !(hhv_lturn_I_9 < 2 + hhv_lturn_F_6)) && !(hhv_lturn_A_1 < hhv_lturn_L_0 + 1)) && !(hhv_lturn_G_7 < hhv_lturn_A_1 + 1)) && !(hhv_lturn_J_10 < hhv_lturn_F_6 + 1)) && !(hhv_lturn_B_2 < 3 + hhv_lturn_F_6)) && !(hhv_lturn_I_9 < hhv_lturn_J_10 + 1)) && !(hhv_lturn_G_7 < 2 + hhv_lturn_L_0)) && !(hhv_lturn_G_7 < hhv_lturn_I_9)) && !(hhv_lturn_G_7 < 3 + hhv_lturn_F_6)) && !(hhv_lturn_G_7 < hhv_lturn_J_10 + 1)) && !(hhv_lturn_A_1 < 2 + hhv_lturn_F_6)) && !(hhv_lturn_G_7 < hhv_lturn_B_2)) && !(hhv_lturn_H_8 < hhv_lturn_C_3)) && !(hhv_lturn_B_2 < hhv_lturn_A_1 + 1)) && !(hhv_lturn_L_0 < hhv_lturn_F_6 + 1)) && !(hhv_lturn_E_5 < hhv_lturn_D_4)) && !(hhv_lturn_C_3 < hhv_lturn_H_8);
      VAL   [hhv_lturn_A_1=1, hhv_lturn_B_2=2, hhv_lturn_C_3=0, hhv_lturn_D_4=0, hhv_lturn_E_5=0, hhv_lturn_F_6=-1, hhv_lturn_G_7=3, hhv_lturn_H_8=0, hhv_lturn_I_9=2, hhv_lturn_J_10=0, hhv_lturn_K_11=4, hhv_lturn_L_0=0]
[L0]  RET   call lturn(hhv_combined_lturn_L_0, hhv_combined_lturn_A_1, hhv_combined_lturn_B_2, hhv_combined_lturn_C_3, hhv_combined_lturn_D_4, hhv_combined_lturn_E_5, hhv_combined_lturn_F_6, hhv_combined_lturn_G_7, hhv_combined_lturn_H_8, hhv_combined_lturn_I_9, hhv_combined_lturn_J_10, hhv_combined_lturn_K_11);
      VAL   [hhv_combined_lturn_A_1=1, hhv_combined_lturn_B_2=2, hhv_combined_lturn_C_3=0, hhv_combined_lturn_D_4=0, hhv_combined_lturn_E_5=0, hhv_combined_lturn_F_6=-1, hhv_combined_lturn_G_7=3, hhv_combined_lturn_H_8=0, hhv_combined_lturn_I_9=2, hhv_combined_lturn_J_10=0, hhv_combined_lturn_K_11=4, hhv_combined_lturn_L_0=0]
[L0]  RET   call combined_lturn(hbv_CHC_COMP_FALSE_J_1, hbv_CHC_COMP_FALSE_v_14_2, hbv_CHC_COMP_FALSE_v_15_3, hbv_CHC_COMP_FALSE_v_13_4, hbv_CHC_COMP_FALSE_A_5, hbv_CHC_COMP_FALSE_B_6, hbv_CHC_COMP_FALSE_C_7, hbv_CHC_COMP_FALSE_D_8, hbv_CHC_COMP_FALSE_E_9, hbv_CHC_COMP_FALSE_F_10, hbv_CHC_COMP_FALSE_G_11, hbv_CHC_COMP_FALSE_M_12);
      VAL   [hbv_CHC_COMP_FALSE_A_5=0, hbv_CHC_COMP_FALSE_B_6=0, hbv_CHC_COMP_FALSE_C_7=-1, hbv_CHC_COMP_FALSE_D_8=3, hbv_CHC_COMP_FALSE_E_9=0, hbv_CHC_COMP_FALSE_F_10=2, hbv_CHC_COMP_FALSE_G_11=0, hbv_CHC_COMP_FALSE_J_1=0, hbv_CHC_COMP_FALSE_M_12=4, hbv_CHC_COMP_FALSE_v_13_4=0, hbv_CHC_COMP_FALSE_v_14_2=1, hbv_CHC_COMP_FALSE_v_15_3=2]
[L0]  CALL  call step_lturn(hbv_CHC_COMP_FALSE_J_1, hbv_CHC_COMP_FALSE_v_14_2, hbv_CHC_COMP_FALSE_v_15_3, hbv_CHC_COMP_FALSE_v_13_4, hbv_CHC_COMP_FALSE_A_5, hbv_CHC_COMP_FALSE_B_6, hbv_CHC_COMP_FALSE_C_7, hbv_CHC_COMP_FALSE_D_8, hbv_CHC_COMP_FALSE_E_9, hbv_CHC_COMP_FALSE_G_11, hbv_CHC_COMP_FALSE_F_10, hbv_CHC_COMP_FALSE_M_12);
      VAL   [hhv_step_lturn_A_1=1, hhv_step_lturn_B_2=2, hhv_step_lturn_C_3=0, hhv_step_lturn_D_4=0, hhv_step_lturn_E_5=0, hhv_step_lturn_F_6=-1, hhv_step_lturn_G_7=3, hhv_step_lturn_H_11=4, hhv_step_lturn_I_0=0, hhv_step_lturn_J_10=2, hhv_step_lturn_K_9=0, hhv_step_lturn_L_8=0]
[L0]  CALL  call step_lturn(hhv_step_lturn_I_0, hhv_step_lturn_A_1, hhv_step_lturn_B_2, hhv_step_lturn_C_3, hhv_step_lturn_D_4, hhv_step_lturn_E_5, hhv_step_lturn_F_6, hhv_step_lturn_G_7, hhv_step_lturn_K_9, hhv_step_lturn_J_10, hhv_step_lturn_L_8, hhv_step_lturn_H_11);
      VAL   [hhv_step_lturn_A_1=1, hhv_step_lturn_B_2=2, hhv_step_lturn_C_3=0, hhv_step_lturn_D_4=0, hhv_step_lturn_E_5=0, hhv_step_lturn_F_6=-1, hhv_step_lturn_G_7=3, hhv_step_lturn_H_11=4, hhv_step_lturn_I_0=0, hhv_step_lturn_J_10=0, hhv_step_lturn_K_9=2, hhv_step_lturn_L_8=0]
[L0]  CALL  call step_lturn__bar(hhv_step_lturn_I_0, hhv_step_lturn_A_1, hhv_step_lturn_B_2, hhv_step_lturn_C_3, hhv_step_lturn_D_4, hhv_step_lturn_E_5, hhv_step_lturn_F_6, hhv_step_lturn_G_7, hhv_step_lturn_L_8, hhv_step_lturn_J_10, hhv_step_lturn_K_9, hhv_step_lturn_H_11);
      VAL   [hhv_step_lturn__bar_A_1=1, hhv_step_lturn__bar_B_2=2, hhv_step_lturn__bar_C_3=0, hhv_step_lturn__bar_D_4=0, hhv_step_lturn__bar_E_5=0, hhv_step_lturn__bar_F_6=-1, hhv_step_lturn__bar_G_7=3, hhv_step_lturn__bar_H_8=0, hhv_step_lturn__bar_I_9=0, hhv_step_lturn__bar_J_10=2, hhv_step_lturn__bar_L_0=0]
[L0]        assume ((((((((((((((((((((((((!(hhv_step_lturn__bar_I_9 < hhv_step_lturn__bar_F_6) && !(hhv_step_lturn__bar_I_9 < hhv_step_lturn__bar_L_0)) && !(hhv_step_lturn__bar_G_7 < hhv_step_lturn__bar_J_10)) && !(hhv_step_lturn__bar_E_5 < hhv_step_lturn__bar_D_4)) && !(hhv_step_lturn__bar_L_0 < hhv_step_lturn__bar_F_6)) && !(hhv_step_lturn__bar_A_1 < hhv_step_lturn__bar_L_0 + 1)) && !(hhv_step_lturn__bar_J_10 < 2 + hhv_step_lturn__bar_L_0)) && !(hhv_step_lturn__bar_H_8 < hhv_step_lturn__bar_C_3)) && !(hhv_step_lturn__bar_B_2 < 2 + hhv_step_lturn__bar_L_0)) && !(hhv_step_lturn__bar_B_2 < hhv_step_lturn__bar_J_10)) && !(hhv_step_lturn__bar_G_7 < 2 + hhv_step_lturn__bar_F_6)) && !(hhv_step_lturn__bar_G_7 < hhv_step_lturn__bar_B_2)) && !(hhv_step_lturn__bar_A_1 < hhv_step_lturn__bar_F_6 + 1)) && !(hhv_step_lturn__bar_G_7 < hhv_step_lturn__bar_A_1 + 1)) && !(hhv_step_lturn__bar_J_10 < hhv_step_lturn__bar_A_1 + 1)) && !(hhv_step_lturn__bar_J_10 < 2 + hhv_step_lturn__bar_F_6)) && !(hhv_step_lturn__bar_B_2 < 2 + hhv_step_lturn__bar_F_6)) && !(hhv_step_lturn__bar_A_1 < hhv_step_lturn__bar_I_9 + 1)) && !(hhv_step_lturn__bar_J_10 < 2 + hhv_step_lturn__bar_I_9)) && !(hhv_step_lturn__bar_B_2 < hhv_step_lturn__bar_A_1 + 1)) && !(hhv_step_lturn__bar_C_3 < hhv_step_lturn__bar_H_8)) && !(hhv_step_lturn__bar_G_7 < 2 + hhv_step_lturn__bar_L_0)) && !(hhv_step_lturn__bar_G_7 < 2 + hhv_step_lturn__bar_I_9)) && !(hhv_step_lturn__bar_B_2 < 2 + hhv_step_lturn__bar_I_9)) && !(hhv_step_lturn__bar_L_0 < hhv_step_lturn__bar_I_9)) && !(hhv_step_lturn__bar_J_10 < hhv_step_lturn__bar_B_2);
      VAL   [hhv_step_lturn__bar_A_1=1, hhv_step_lturn__bar_B_2=2, hhv_step_lturn__bar_C_3=0, hhv_step_lturn__bar_D_4=0, hhv_step_lturn__bar_E_5=0, hhv_step_lturn__bar_F_6=-1, hhv_step_lturn__bar_G_7=3, hhv_step_lturn__bar_H_8=0, hhv_step_lturn__bar_I_9=0, hhv_step_lturn__bar_J_10=2, hhv_step_lturn__bar_L_0=0]
[L0]  RET   call step_lturn__bar(hhv_step_lturn_I_0, hhv_step_lturn_A_1, hhv_step_lturn_B_2, hhv_step_lturn_C_3, hhv_step_lturn_D_4, hhv_step_lturn_E_5, hhv_step_lturn_F_6, hhv_step_lturn_G_7, hhv_step_lturn_L_8, hhv_step_lturn_J_10, hhv_step_lturn_K_9, hhv_step_lturn_H_11);
      VAL   [hhv_step_lturn_A_1=1, hhv_step_lturn_B_2=2, hhv_step_lturn_C_3=0, hhv_step_lturn_D_4=0, hhv_step_lturn_E_5=0, hhv_step_lturn_F_6=-1, hhv_step_lturn_G_7=3, hhv_step_lturn_H_11=4, hhv_step_lturn_I_0=0, hhv_step_lturn_J_10=0, hhv_step_lturn_K_9=2, hhv_step_lturn_L_8=0]
[L0]  RET   call step_lturn(hhv_step_lturn_I_0, hhv_step_lturn_A_1, hhv_step_lturn_B_2, hhv_step_lturn_C_3, hhv_step_lturn_D_4, hhv_step_lturn_E_5, hhv_step_lturn_F_6, hhv_step_lturn_G_7, hhv_step_lturn_K_9, hhv_step_lturn_J_10, hhv_step_lturn_L_8, hhv_step_lturn_H_11);
      VAL   [hhv_step_lturn_A_1=1, hhv_step_lturn_B_2=2, hhv_step_lturn_C_3=0, hhv_step_lturn_D_4=0, hhv_step_lturn_E_5=0, hhv_step_lturn_F_6=-1, hhv_step_lturn_G_7=3, hhv_step_lturn_H_11=4, hhv_step_lturn_I_0=0, hhv_step_lturn_J_10=2, hhv_step_lturn_K_9=0, hhv_step_lturn_L_8=0]
[L0]  RET   call step_lturn(hbv_CHC_COMP_FALSE_J_1, hbv_CHC_COMP_FALSE_v_14_2, hbv_CHC_COMP_FALSE_v_15_3, hbv_CHC_COMP_FALSE_v_13_4, hbv_CHC_COMP_FALSE_A_5, hbv_CHC_COMP_FALSE_B_6, hbv_CHC_COMP_FALSE_C_7, hbv_CHC_COMP_FALSE_D_8, hbv_CHC_COMP_FALSE_E_9, hbv_CHC_COMP_FALSE_G_11, hbv_CHC_COMP_FALSE_F_10, hbv_CHC_COMP_FALSE_M_12);
      VAL   [hbv_CHC_COMP_FALSE_A_5=0, hbv_CHC_COMP_FALSE_B_6=0, hbv_CHC_COMP_FALSE_C_7=-1, hbv_CHC_COMP_FALSE_D_8=3, hbv_CHC_COMP_FALSE_E_9=0, hbv_CHC_COMP_FALSE_F_10=2, hbv_CHC_COMP_FALSE_G_11=0, hbv_CHC_COMP_FALSE_J_1=0, hbv_CHC_COMP_FALSE_M_12=4, hbv_CHC_COMP_FALSE_v_13_4=0, hbv_CHC_COMP_FALSE_v_14_2=1, hbv_CHC_COMP_FALSE_v_15_3=2]
[L0]  RET   call CHC_COMP_FALSE();
[L0]  RET   call False();
[L0]        assert false;

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 8 procedures, 150 locations, 455 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 6260 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5418 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6283 IncrementalHoareTripleChecker+Invalid, 6370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 842 mSDtfsCounter, 6283 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298occurred in iteration=3, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 3 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 114 NumberOfCodeBlocks, 114 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 394 SizeOfPredicates, 8 NumberOfNonLiveVariables, 200 ConjunctsInSsa, 24 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:22:03,532 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
unsat
