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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:46,475 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:46,600 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4825d65c-24f0-4508-8959-87f9934344dc/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:46,610 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:46,610 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:46,653 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:46,654 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:46,654 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:46,655 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:46,655 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:46,656 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:46,656 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:46,656 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:46,656 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:46,658 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:46,658 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:46,658 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:46,658 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:46,659 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:46,659 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:46,659 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:46,659 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:46,660 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:46,660 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:46,660 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:46,661 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:46,661 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:47,029 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:47,040 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:47,043 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:47,044 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:47,045 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:47,046 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4825d65c-24f0-4508-8959-87f9934344dc/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-009.smt2
[2025-04-28 21:21:47,048 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:47,053 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:47,520 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4825d65c-24f0-4508-8959-87f9934344dc/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-009.smt2
[2025-04-28 21:21:47,526 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:47,530 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:47,531 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:47,531 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:47,532 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:47,535 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,593 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47 Unit
[2025-04-28 21:21:47,594 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:47,595 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:47,595 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:47,595 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:47,618 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,618 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,671 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,671 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,684 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,686 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,692 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,694 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,699 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,730 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:47,730 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:47,731 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:47,731 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:47,732 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (1/1) ...
[2025-04-28 21:21:47,739 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:47,755 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:47,772 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:47,778 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:47,788 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:47,788 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:47,789 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:47,789 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATverifier.error.split given in one single declaration
[2025-04-28 21:21:47,789 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATverifier.error.split
[2025-04-28 21:21:47,789 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATverifier.error.split
[2025-04-28 21:21:47,789 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb8 given in one single declaration
[2025-04-28 21:21:47,789 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb8
[2025-04-28 21:21:47,789 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb8
[2025-04-28 21:21:47,789 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure __VERIFIER_assert given in one single declaration
[2025-04-28 21:21:47,789 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2025-04-28 21:21:47,790 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2025-04-28 21:21:47,790 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure __VERIFIER_assert.AT_ret given in one single declaration
[2025-04-28 21:21:47,790 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert.AT_ret
[2025-04-28 21:21:47,790 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert.AT_ret
[2025-04-28 21:21:47,790 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure __VERIFIER_assert.AT_call given in one single declaration
[2025-04-28 21:21:47,790 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert.AT_call
[2025-04-28 21:21:47,790 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert.AT_call
[2025-04-28 21:21:47,790 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb6 given in one single declaration
[2025-04-28 21:21:47,790 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb6
[2025-04-28 21:21:47,790 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb6
[2025-04-28 21:21:47,791 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb4 given in one single declaration
[2025-04-28 21:21:47,791 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb4
[2025-04-28 21:21:47,791 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb4
[2025-04-28 21:21:47,791 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb given in one single declaration
[2025-04-28 21:21:47,791 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb
[2025-04-28 21:21:47,791 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb
[2025-04-28 21:21:47,791 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATentry given in one single declaration
[2025-04-28 21:21:47,791 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATentry
[2025-04-28 21:21:47,791 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATentry
[2025-04-28 21:21:47,791 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:47,791 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:47,792 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:47,931 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:47,934 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:48,278 INFO  L?                        ?]: Removed 93 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:48,278 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:48,296 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:48,296 INFO  L312             CfgBuilder]: Removed 3 assume(true) statements.
[2025-04-28 21:21:48,297 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:48 BoogieIcfgContainer
[2025-04-28 21:21:48,297 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:48,301 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:48,303 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:48,308 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:48,308 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:47" (1/3) ...
[2025-04-28 21:21:48,310 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e385dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:48, skipping insertion in model container
[2025-04-28 21:21:48,310 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:47" (2/3) ...
[2025-04-28 21:21:48,310 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e385dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:48, skipping insertion in model container
[2025-04-28 21:21:48,311 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:48" (3/3) ...
[2025-04-28 21:21:48,313 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:48,332 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:48,335 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 11 procedures, 45 locations, 69 edges, 11 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:48,406 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:48,429 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;@462990e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:48,429 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:48,436 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 45 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 25 states have internal predecessors, (27), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (14), 10 states have call predecessors, (14), 14 states have call successors, (14)
[2025-04-28 21:21:48,448 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-04-28 21:21:48,448 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:48,449 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, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:48,449 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:48,456 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:48,457 INFO  L85        PathProgramCache]: Analyzing trace with hash -352789791, now seen corresponding path program 1 times
[2025-04-28 21:21:48,466 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:48,468 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510813027]
[2025-04-28 21:21:48,469 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:48,470 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:48,521 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-04-28 21:21:48,605 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-04-28 21:21:48,609 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:48,609 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:49,425 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:49,426 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:49,426 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510813027]
[2025-04-28 21:21:49,427 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510813027] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:49,427 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:49,434 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:49,436 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081764392]
[2025-04-28 21:21:49,437 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:49,442 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:49,442 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:49,476 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:49,477 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:49,479 INFO  L87              Difference]: Start difference. First operand  has 45 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 25 states have internal predecessors, (27), 14 states have call successors, (14), 10 states have call predecessors, (14), 10 states have return successors, (14), 10 states have call predecessors, (14), 14 states have call successors, (14) Second operand  has 6 states, 4 states have (on average 3.25) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:49,644 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:49,644 INFO  L93              Difference]: Finished difference Result 49 states and 61 transitions.
[2025-04-28 21:21:49,645 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:49,647 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 3.25) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 27
[2025-04-28 21:21:49,647 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:49,656 INFO  L225             Difference]: With dead ends: 49
[2025-04-28 21:21:49,657 INFO  L226             Difference]: Without dead ends: 49
[2025-04-28 21:21:49,659 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:49,662 INFO  L437           NwaCegarLoop]: 49 mSDtfsCounter, 2 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:49,663 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 186 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:49,698 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2025-04-28 21:21:49,753 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47.
[2025-04-28 21:21:49,755 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 47 states, 20 states have (on average 1.35) internal successors, (27), 25 states have internal predecessors, (27), 14 states have call successors, (14), 10 states have call predecessors, (14), 12 states have return successors, (17), 12 states have call predecessors, (17), 14 states have call successors, (17)
[2025-04-28 21:21:49,764 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions.
[2025-04-28 21:21:49,765 INFO  L79                 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 27
[2025-04-28 21:21:49,768 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:49,768 INFO  L485      AbstractCegarLoop]: Abstraction has 47 states and 58 transitions.
[2025-04-28 21:21:49,772 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 3.25) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7)
[2025-04-28 21:21:49,772 INFO  L278                IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions.
[2025-04-28 21:21:49,774 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2025-04-28 21:21:49,774 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:49,775 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, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:49,777 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:49,781 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:49,782 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:49,783 INFO  L85        PathProgramCache]: Analyzing trace with hash 1265593561, now seen corresponding path program 1 times
[2025-04-28 21:21:49,783 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:49,783 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755966277]
[2025-04-28 21:21:49,783 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:49,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:49,802 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-04-28 21:21:49,836 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-04-28 21:21:49,837 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:49,837 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:50,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:50,506 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:50,506 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755966277]
[2025-04-28 21:21:50,506 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755966277] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:50,506 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:50,506 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:50,506 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487187178]
[2025-04-28 21:21:50,507 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:50,509 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:50,510 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:50,510 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:50,511 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:50,511 INFO  L87              Difference]: Start difference. First operand 47 states and 58 transitions. Second operand  has 8 states, 5 states have (on average 2.8) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8)
[2025-04-28 21:21:50,676 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:50,677 INFO  L93              Difference]: Finished difference Result 59 states and 74 transitions.
[2025-04-28 21:21:50,677 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-04-28 21:21:50,678 INFO  L79                 Accepts]: Start accepts. Automaton has  has 8 states, 5 states have (on average 2.8) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 31
[2025-04-28 21:21:50,678 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:50,679 INFO  L225             Difference]: With dead ends: 59
[2025-04-28 21:21:50,680 INFO  L226             Difference]: Without dead ends: 59
[2025-04-28 21:21:50,680 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:50,681 INFO  L437           NwaCegarLoop]: 48 mSDtfsCounter, 3 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:50,682 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 270 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:50,683 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59 states.
[2025-04-28 21:21:50,690 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51.
[2025-04-28 21:21:50,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 27 states have internal predecessors, (29), 14 states have call successors, (14), 10 states have call predecessors, (14), 14 states have return successors, (21), 14 states have call predecessors, (21), 14 states have call successors, (21)
[2025-04-28 21:21:50,692 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions.
[2025-04-28 21:21:50,692 INFO  L79                 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 31
[2025-04-28 21:21:50,692 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:50,693 INFO  L485      AbstractCegarLoop]: Abstraction has 51 states and 64 transitions.
[2025-04-28 21:21:50,693 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 5 states have (on average 2.8) internal successors, (14), 8 states have internal predecessors, (14), 5 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8)
[2025-04-28 21:21:50,693 INFO  L278                IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions.
[2025-04-28 21:21:50,694 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2025-04-28 21:21:50,694 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:50,695 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:50,695 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:50,695 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:50,696 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:50,696 INFO  L85        PathProgramCache]: Analyzing trace with hash 194191234, now seen corresponding path program 1 times
[2025-04-28 21:21:50,696 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:50,696 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967576805]
[2025-04-28 21:21:50,696 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:50,696 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:50,725 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-04-28 21:21:50,732 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-04-28 21:21:50,733 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:50,733 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:50,828 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:50,828 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:50,828 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967576805]
[2025-04-28 21:21:50,828 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967576805] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:50,828 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:50,828 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:50,829 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107502572]
[2025-04-28 21:21:50,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:50,829 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:50,829 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:50,830 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:50,830 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:50,830 INFO  L87              Difference]: Start difference. First operand 51 states and 64 transitions. Second operand  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9)
[2025-04-28 21:21:50,854 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:50,857 INFO  L93              Difference]: Finished difference Result 55 states and 68 transitions.
[2025-04-28 21:21:50,857 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:50,858 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 35
[2025-04-28 21:21:50,858 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:50,859 INFO  L225             Difference]: With dead ends: 55
[2025-04-28 21:21:50,859 INFO  L226             Difference]: Without dead ends: 53
[2025-04-28 21:21:50,859 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:50,861 INFO  L437           NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:50,863 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 155 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:50,864 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2025-04-28 21:21:50,876 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51.
[2025-04-28 21:21:50,879 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 27 states have internal predecessors, (27), 14 states have call successors, (14), 10 states have call predecessors, (14), 14 states have return successors, (21), 14 states have call predecessors, (21), 14 states have call successors, (21)
[2025-04-28 21:21:50,881 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions.
[2025-04-28 21:21:50,881 INFO  L79                 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 35
[2025-04-28 21:21:50,881 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:50,884 INFO  L485      AbstractCegarLoop]: Abstraction has 51 states and 62 transitions.
[2025-04-28 21:21:50,884 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9)
[2025-04-28 21:21:50,884 INFO  L278                IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions.
[2025-04-28 21:21:50,885 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2025-04-28 21:21:50,885 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:50,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:50,886 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:50,886 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:50,887 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:50,887 INFO  L85        PathProgramCache]: Analyzing trace with hash 330548348, now seen corresponding path program 1 times
[2025-04-28 21:21:50,887 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:50,887 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751426129]
[2025-04-28 21:21:50,887 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:50,887 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:50,900 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-04-28 21:21:50,907 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-04-28 21:21:50,907 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:50,907 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,014 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:51,014 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:51,014 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751426129]
[2025-04-28 21:21:51,014 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751426129] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:51,014 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:51,014 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:51,015 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189393429]
[2025-04-28 21:21:51,015 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:51,015 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:51,015 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:51,016 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:51,016 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:51,016 INFO  L87              Difference]: Start difference. First operand 51 states and 62 transitions. Second operand  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9)
[2025-04-28 21:21:51,027 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:51,027 INFO  L93              Difference]: Finished difference Result 55 states and 66 transitions.
[2025-04-28 21:21:51,028 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:51,028 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 35
[2025-04-28 21:21:51,029 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:51,030 INFO  L225             Difference]: With dead ends: 55
[2025-04-28 21:21:51,030 INFO  L226             Difference]: Without dead ends: 53
[2025-04-28 21:21:51,030 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:51,031 INFO  L437           NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:51,031 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 154 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:51,033 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 53 states.
[2025-04-28 21:21:51,039 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51.
[2025-04-28 21:21:51,039 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 26 states have internal predecessors, (26), 14 states have call successors, (14), 10 states have call predecessors, (14), 14 states have return successors, (21), 14 states have call predecessors, (21), 14 states have call successors, (21)
[2025-04-28 21:21:51,040 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions.
[2025-04-28 21:21:51,041 INFO  L79                 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 35
[2025-04-28 21:21:51,041 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:51,041 INFO  L485      AbstractCegarLoop]: Abstraction has 51 states and 61 transitions.
[2025-04-28 21:21:51,041 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9)
[2025-04-28 21:21:51,041 INFO  L278                IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions.
[2025-04-28 21:21:51,042 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2025-04-28 21:21:51,043 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:51,043 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:51,043 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:21:51,043 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:51,044 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:51,044 INFO  L85        PathProgramCache]: Analyzing trace with hash -950000473, now seen corresponding path program 1 times
[2025-04-28 21:21:51,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:51,044 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861433498]
[2025-04-28 21:21:51,044 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,044 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:51,058 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes.
[2025-04-28 21:21:51,084 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements.
[2025-04-28 21:21:51,084 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,084 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,795 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:51,796 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:51,796 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861433498]
[2025-04-28 21:21:51,796 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861433498] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:51,796 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770589661]
[2025-04-28 21:21:51,796 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,797 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:51,801 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:51,806 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:51,808 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:51,908 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes.
[2025-04-28 21:21:51,970 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements.
[2025-04-28 21:21:51,971 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,971 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,974 INFO  L256         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:51,984 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:52,423 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2025-04-28 21:21:52,423 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:52,423 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770589661] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:52,424 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:52,424 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 14
[2025-04-28 21:21:52,424 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706800917]
[2025-04-28 21:21:52,424 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:52,425 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:52,425 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:52,425 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:52,426 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:52,427 INFO  L87              Difference]: Start difference. First operand 51 states and 61 transitions. Second operand  has 6 states, 4 states have (on average 5.0) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11)
[2025-04-28 21:21:52,552 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:52,552 INFO  L93              Difference]: Finished difference Result 57 states and 68 transitions.
[2025-04-28 21:21:52,553 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:52,553 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 5.0) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) Word has length 42
[2025-04-28 21:21:52,553 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:52,554 INFO  L225             Difference]: With dead ends: 57
[2025-04-28 21:21:52,554 INFO  L226             Difference]: Without dead ends: 55
[2025-04-28 21:21:52,555 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182
[2025-04-28 21:21:52,555 INFO  L437           NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:52,556 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 212 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:52,560 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 55 states.
[2025-04-28 21:21:52,572 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53.
[2025-04-28 21:21:52,572 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 53 states, 23 states have (on average 1.173913043478261) internal successors, (27), 27 states have internal predecessors, (27), 14 states have call successors, (14), 10 states have call predecessors, (14), 15 states have return successors, (21), 15 states have call predecessors, (21), 14 states have call successors, (21)
[2025-04-28 21:21:52,574 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions.
[2025-04-28 21:21:52,575 INFO  L79                 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 42
[2025-04-28 21:21:52,576 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:52,576 INFO  L485      AbstractCegarLoop]: Abstraction has 53 states and 62 transitions.
[2025-04-28 21:21:52,576 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 5.0) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11)
[2025-04-28 21:21:52,576 INFO  L278                IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions.
[2025-04-28 21:21:52,577 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2025-04-28 21:21:52,578 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:52,578 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,586 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:52,778 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2025-04-28 21:21:52,779 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:52,779 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:52,780 INFO  L85        PathProgramCache]: Analyzing trace with hash -1021339745, now seen corresponding path program 1 times
[2025-04-28 21:21:52,780 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:52,780 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806673603]
[2025-04-28 21:21:52,780 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:52,780 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:52,804 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes.
[2025-04-28 21:21:52,836 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements.
[2025-04-28 21:21:52,838 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:52,839 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:53,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:53,536 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:53,536 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806673603]
[2025-04-28 21:21:53,536 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806673603] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:53,536 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738633652]
[2025-04-28 21:21:53,536 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:53,536 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:53,540 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:53,542 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:53,546 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:21:53,641 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes.
[2025-04-28 21:21:53,704 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements.
[2025-04-28 21:21:53,704 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:53,704 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:53,707 INFO  L256         TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 20 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:53,710 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:54,026 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:54,026 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:54,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [738633652] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:54,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:54,026 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15
[2025-04-28 21:21:54,026 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674623141]
[2025-04-28 21:21:54,027 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:54,027 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:54,027 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:54,028 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:54,028 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:54,028 INFO  L87              Difference]: Start difference. First operand 53 states and 62 transitions. Second operand  has 6 states, 4 states have (on average 5.25) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12)
[2025-04-28 21:21:54,123 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:54,123 INFO  L93              Difference]: Finished difference Result 49 states and 56 transitions.
[2025-04-28 21:21:54,124 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:54,124 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 5.25) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 46
[2025-04-28 21:21:54,124 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:54,125 INFO  L225             Difference]: With dead ends: 49
[2025-04-28 21:21:54,125 INFO  L226             Difference]: Without dead ends: 47
[2025-04-28 21:21:54,125 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:54,126 INFO  L437           NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:54,126 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 215 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:54,127 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2025-04-28 21:21:54,131 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47.
[2025-04-28 21:21:54,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 47 states, 20 states have (on average 1.2) internal successors, (24), 24 states have internal predecessors, (24), 14 states have call successors, (14), 10 states have call predecessors, (14), 12 states have return successors, (16), 12 states have call predecessors, (16), 14 states have call successors, (16)
[2025-04-28 21:21:54,132 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions.
[2025-04-28 21:21:54,133 INFO  L79                 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 46
[2025-04-28 21:21:54,133 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:54,133 INFO  L485      AbstractCegarLoop]: Abstraction has 47 states and 54 transitions.
[2025-04-28 21:21:54,133 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 5.25) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12)
[2025-04-28 21:21:54,133 INFO  L278                IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions.
[2025-04-28 21:21:54,135 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2025-04-28 21:21:54,135 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:54,135 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,142 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:21:54,339 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:54,340 INFO  L403      AbstractCegarLoop]: === Iteration 7 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:54,340 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:54,340 INFO  L85        PathProgramCache]: Analyzing trace with hash -1340078851, now seen corresponding path program 1 times
[2025-04-28 21:21:54,340 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:54,340 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994007676]
[2025-04-28 21:21:54,340 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:54,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:54,354 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-04-28 21:21:54,375 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-04-28 21:21:54,375 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:54,376 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:55,063 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:55,063 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:55,064 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994007676]
[2025-04-28 21:21:55,064 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994007676] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:55,064 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141441640]
[2025-04-28 21:21:55,064 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:55,065 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:55,068 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:55,071 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-04-28 21:21:55,076 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:21:55,168 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-04-28 21:21:55,220 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-04-28 21:21:55,220 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:55,220 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:55,222 INFO  L256         TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 20 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:55,224 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:55,485 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:21:55,485 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-04-28 21:21:55,485 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [141441640] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:55,485 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-04-28 21:21:55,485 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 15
[2025-04-28 21:21:55,486 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107797914]
[2025-04-28 21:21:55,486 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:55,486 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:55,486 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:55,487 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:55,487 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:55,487 INFO  L87              Difference]: Start difference. First operand 47 states and 54 transitions. Second operand  has 6 states, 4 states have (on average 4.0) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9)
[2025-04-28 21:21:55,567 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:55,567 INFO  L93              Difference]: Finished difference Result 51 states and 58 transitions.
[2025-04-28 21:21:55,568 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:55,568 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 4.0) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 35
[2025-04-28 21:21:55,569 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:55,569 INFO  L225             Difference]: With dead ends: 51
[2025-04-28 21:21:55,570 INFO  L226             Difference]: Without dead ends: 49
[2025-04-28 21:21:55,570 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210
[2025-04-28 21:21:55,571 INFO  L437           NwaCegarLoop]: 47 mSDtfsCounter, 2 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:55,571 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 215 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:55,572 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 49 states.
[2025-04-28 21:21:55,576 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49.
[2025-04-28 21:21:55,576 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 49 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 25 states have internal predecessors, (25), 14 states have call successors, (14), 10 states have call predecessors, (14), 13 states have return successors, (17), 13 states have call predecessors, (17), 14 states have call successors, (17)
[2025-04-28 21:21:55,577 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions.
[2025-04-28 21:21:55,577 INFO  L79                 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 35
[2025-04-28 21:21:55,577 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:55,577 INFO  L485      AbstractCegarLoop]: Abstraction has 49 states and 56 transitions.
[2025-04-28 21:21:55,578 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 4.0) internal successors, (16), 6 states have internal predecessors, (16), 4 states have call successors, (9), 1 states have call predecessors, (9), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9)
[2025-04-28 21:21:55,578 INFO  L278                IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions.
[2025-04-28 21:21:55,579 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2025-04-28 21:21:55,579 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:55,579 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,587 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-04-28 21:21:55,783 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:55,784 INFO  L403      AbstractCegarLoop]: === Iteration 8 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:55,784 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:55,784 INFO  L85        PathProgramCache]: Analyzing trace with hash -1387274644, now seen corresponding path program 1 times
[2025-04-28 21:21:55,784 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:55,784 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867698034]
[2025-04-28 21:21:55,785 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:55,785 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:55,799 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-04-28 21:21:55,844 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-04-28 21:21:55,844 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:55,845 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:55,846 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-04-28 21:21:55,856 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes.
[2025-04-28 21:21:55,895 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements.
[2025-04-28 21:21:55,895 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:55,895 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:55,934 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-04-28 21:21:55,934 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-04-28 21:21:55,935 INFO  L790   garLoopResultBuilder]: Registering result UNSAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:55,938 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-04-28 21:21:55,942 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:55,966 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:55,973 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:55 BoogieIcfgContainer
[2025-04-28 21:21:55,973 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:55,974 INFO  L158              Benchmark]: Toolchain (without parser) took 8445.45ms. Allocated memory was 234.9MB in the beginning and 251.7MB in the end (delta: 16.8MB). Free memory was 154.0MB in the beginning and 181.9MB in the end (delta: -27.9MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:55,978 INFO  L158              Benchmark]: SmtParser took 0.45ms. Allocated memory is still 234.9MB. Free memory is still 169.5MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:55,978 INFO  L158              Benchmark]: ChcToBoogie took 63.71ms. Allocated memory is still 234.9MB. Free memory was 154.0MB in the beginning and 151.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:55,979 INFO  L158              Benchmark]: Boogie Preprocessor took 134.95ms. Allocated memory is still 234.9MB. Free memory was 151.9MB in the beginning and 148.9MB in the end (delta: 3.0MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-04-28 21:21:55,979 INFO  L158              Benchmark]: RCFGBuilder took 566.84ms. Allocated memory is still 234.9MB. Free memory was 148.9MB in the beginning and 129.4MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-04-28 21:21:55,979 INFO  L158              Benchmark]: TraceAbstraction took 7672.37ms. Allocated memory was 234.9MB in the beginning and 251.7MB in the end (delta: 16.8MB). Free memory was 128.8MB in the beginning and 181.9MB in the end (delta: -53.1MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:55,981 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.45ms. Allocated memory is still 234.9MB. Free memory is still 169.5MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 63.71ms. Allocated memory is still 234.9MB. Free memory was 154.0MB in the beginning and 151.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 134.95ms. Allocated memory is still 234.9MB. Free memory was 151.9MB in the beginning and 148.9MB in the end (delta: 3.0MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * RCFGBuilder took 566.84ms. Allocated memory is still 234.9MB. Free memory was 148.9MB in the beginning and 129.4MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 7672.37ms. Allocated memory was 234.9MB in the beginning and 251.7MB in the end (delta: 16.8MB). Free memory was 128.8MB in the beginning and 181.9MB in the end (delta: -53.1MB). 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 main.ATverifier.error.split();
[L0]        assume (((((((((((((((((((((((((!(hbv_main.ATverifier.error.split_S_3 && hbv_main.ATverifier.error.split_V_17 != (if hbv_main.ATverifier.error.split_R_25 then 1 else 0)) && !((!hbv_main.ATverifier.error.split_X_2 || !hbv_main.ATverifier.error.split_U_5) && hbv_main.ATverifier.error.split_X_2)) && !((!hbv_main.ATverifier.error.split_Y_1 || !hbv_main.ATverifier.error.split_X_2) && hbv_main.ATverifier.error.split_Y_1)) && !(hbv_main.ATverifier.error.split_Z_8 && (!hbv_main.ATverifier.error.split_Z_8 || !hbv_main.ATverifier.error.split_Y_1))) && !(hbv_main.ATverifier.error.split_S_3 && hbv_main.ATverifier.error.split_K_10 + hbv_main.ATverifier.error.split_J_16 * 4 != hbv_main.ATverifier.error.split_M_11)) && !(hbv_main.ATverifier.error.split_G_14 <= 0 && hbv_main.ATverifier.error.split_S_3)) && !(hbv_main.ATverifier.error.split_S_3 && hbv_main.ATverifier.error.split_L_26[hbv_main.ATverifier.error.split_M_11] != hbv_main.ATverifier.error.split_O_22)) && !(hbv_main.ATverifier.error.split_G_14 + hbv_main.ATverifier.error.split_J_16 * 4 != hbv_main.ATverifier.error.split_I_19 && hbv_main.ATverifier.error.split_S_3)) && !(hbv_main.ATverifier.error.split_U_5 && (!hbv_main.ATverifier.error.split_S_3 || !hbv_main.ATverifier.error.split_U_5))) && !(((hbv_main.ATverifier.error.split_R_25 || hbv_main.ATverifier.error.split_Q_23 == hbv_main.ATverifier.error.split_P_13) && hbv_main.ATverifier.error.split_S_3) && (hbv_main.ATverifier.error.split_Q_23 != hbv_main.ATverifier.error.split_P_13 || !hbv_main.ATverifier.error.split_R_25))) && !(!hbv_main.ATverifier.error.split_W_15 && hbv_main.ATverifier.error.split_X_2)) && !((hbv_main.ATverifier.error.split_S_3 && hbv_main.ATverifier.error.split_T_4) && hbv_main.ATverifier.error.split_U_5)) && !(hbv_main.ATverifier.error.split_S_3 && hbv_main.ATverifier.error.split_D_6 + hbv_main.ATverifier.error.split_J_16 * 4 != hbv_main.ATverifier.error.split_F_7)) && !(hbv_main.ATverifier.error.split_N_24 != hbv_main.ATverifier.error.split_O_22 + hbv_main.ATverifier.error.split_Q_23 && hbv_main.ATverifier.error.split_S_3)) && !(hbv_main.ATverifier.error.split_D_6 <= 0 && hbv_main.ATverifier.error.split_S_3)) && !((0 < hbv_main.ATverifier.error.split_K_10 && hbv_main.ATverifier.error.split_S_3) && hbv_main.ATverifier.error.split_M_11 <= 0)) && !(hbv_main.ATverifier.error.split_S_3 && hbv_main.ATverifier.error.split_P_13 != hbv_main.ATverifier.error.split_E_12[hbv_main.ATverifier.error.split_F_7])) && !((hbv_main.ATverifier.error.split_S_3 && 0 < hbv_main.ATverifier.error.split_D_6) && hbv_main.ATverifier.error.split_F_7 <= 0)) && !!hbv_main.ATverifier.error.split_B_21) && !((0 < hbv_main.ATverifier.error.split_G_14 && hbv_main.ATverifier.error.split_S_3) && hbv_main.ATverifier.error.split_I_19 <= 0)) && !(((((hbv_main.ATverifier.error.split_J_16 < hbv_main.ATverifier.error.split_A_20 && hbv_main.ATverifier.error.split_A_20 < 0) || 0 <= hbv_main.ATverifier.error.split_J_16) && ((hbv_main.ATverifier.error.split_J_16 < 0 || hbv_main.ATverifier.error.split_J_16 < hbv_main.ATverifier.error.split_A_20) || hbv_main.ATverifier.error.split_A_20 < 0)) || hbv_main.ATverifier.error.split_B_21) && ((!hbv_main.ATverifier.error.split_B_21 || ((0 <= hbv_main.ATverifier.error.split_A_20 && 0 <= hbv_main.ATverifier.error.split_J_16) && hbv_main.ATverifier.error.split_A_20 <= hbv_main.ATverifier.error.split_J_16)) || (hbv_main.ATverifier.error.split_J_16 < 0 && (0 <= hbv_main.ATverifier.error.split_A_20 || hbv_main.ATverifier.error.split_A_20 <= hbv_main.ATverifier.error.split_J_16))))) && !(hbv_main.ATverifier.error.split_S_3 && hbv_main.ATverifier.error.split_N_24 != hbv_main.ATverifier.error.split_H_27[hbv_main.ATverifier.error.split_I_19])) && !(((hbv_main.ATverifier.error.split_V_17 != 0 || !hbv_main.ATverifier.error.split_W_15) && hbv_main.ATverifier.error.split_X_2) && (hbv_main.ATverifier.error.split_W_15 || hbv_main.ATverifier.error.split_V_17 == 0))) && !((!hbv_main.ATverifier.error.split_S_3 || !hbv_main.ATverifier.error.split_C_18) && hbv_main.ATverifier.error.split_S_3)) && !((!hbv_main.ATverifier.error.split_Z_8 || !hbv_main.ATverifier.error.split_A1_9) && hbv_main.ATverifier.error.split_A1_9)) && !!hbv_main.ATverifier.error.split_A1_9) && !(hbv_main.ATverifier.error.split_S_3 && hbv_main.ATverifier.error.split_K_10 <= 0);
      VAL   [hbv_main.ATverifier.error.split_A_20=1, hbv_main.ATverifier.error.split_D_6=1, hbv_main.ATverifier.error.split_G_14=1, hbv_main.ATverifier.error.split_J_16=0, hbv_main.ATverifier.error.split_K_10=1]
[L0]  CALL  call main.AT_bb8(hbv_main.ATverifier.error.split_G_14, hbv_main.ATverifier.error.split_H_27, hbv_main.ATverifier.error.split_K_10, hbv_main.ATverifier.error.split_L_26, hbv_main.ATverifier.error.split_D_6, hbv_main.ATverifier.error.split_E_12, hbv_main.ATverifier.error.split_J_16, hbv_main.ATverifier.error.split_A_20);
      VAL   [hhv_main.AT_bb8_F_0=1, hhv_main.AT_bb8_H_2=1, hhv_main.AT_bb8_J_4=1, hhv_main.AT_bb8_L_6=0, hhv_main.AT_bb8_M_7=1]
[L0]        assume ((((!((hbv_main.AT_bb8_C_2 && hbv_main.AT_bb8_D_1) && hbv_main.AT_bb8_E_3 != 0) && !((!hbv_main.AT_bb8_D_1 || !hbv_main.AT_bb8_C_2) && hbv_main.AT_bb8_C_2)) && !((hhv_main.AT_bb8_L_6 != hbv_main.AT_bb8_E_3 && hbv_main.AT_bb8_C_2) && hbv_main.AT_bb8_D_1)) && !((hbv_main.AT_bb8_B_5 && hbv_main.AT_bb8_C_2) && hbv_main.AT_bb8_D_1)) && !!hbv_main.AT_bb8_C_2) && !(((!hbv_main.AT_bb8_B_5 || ((0 <= hhv_main.AT_bb8_M_7 && 0 <= hbv_main.AT_bb8_A_4) && hhv_main.AT_bb8_M_7 <= hbv_main.AT_bb8_A_4)) || ((0 <= hhv_main.AT_bb8_M_7 || hhv_main.AT_bb8_M_7 <= hbv_main.AT_bb8_A_4) && hbv_main.AT_bb8_A_4 < 0)) && ((((hbv_main.AT_bb8_A_4 < hhv_main.AT_bb8_M_7 || hhv_main.AT_bb8_M_7 < 0) || hbv_main.AT_bb8_A_4 < 0) && (0 <= hbv_main.AT_bb8_A_4 || (hbv_main.AT_bb8_A_4 < hhv_main.AT_bb8_M_7 && hhv_main.AT_bb8_M_7 < 0))) || hbv_main.AT_bb8_B_5));
      VAL   [hbv_main.AT_bb8_A_4=1, hhv_main.AT_bb8_F_0=1, hhv_main.AT_bb8_H_2=1, hhv_main.AT_bb8_J_4=1, hhv_main.AT_bb8_L_6=0, hhv_main.AT_bb8_M_7=1]
[L0]  CALL  call main.AT_bb6(hhv_main.AT_bb8_F_0, hhv_main.AT_bb8_G_1, hhv_main.AT_bb8_H_2, hhv_main.AT_bb8_I_3, hbv_main.AT_bb8_A_4, hhv_main.AT_bb8_J_4, hhv_main.AT_bb8_K_5, hhv_main.AT_bb8_M_7);
      VAL   [hhv_main.AT_bb6_H_0=1, hhv_main.AT_bb6_J_2=1, hhv_main.AT_bb6_L_4=1, hhv_main.AT_bb6_M_5=1, hhv_main.AT_bb6_O_7=1]
[L0]        assume (((((((((((((((((((((!((((0 <= hbv_main.AT_bb6_J_9 || (hbv_main.AT_bb6_J_9 < hhv_main.AT_bb6_O_7 && hhv_main.AT_bb6_O_7 < 0)) && ((hbv_main.AT_bb6_J_9 < hhv_main.AT_bb6_O_7 || hbv_main.AT_bb6_J_9 < 0) || hhv_main.AT_bb6_O_7 < 0)) || hbv_main.AT_bb6_B_7) && ((!hbv_main.AT_bb6_B_7 || ((hhv_main.AT_bb6_O_7 <= hbv_main.AT_bb6_J_9 && 0 <= hbv_main.AT_bb6_J_9) && 0 <= hhv_main.AT_bb6_O_7)) || ((hhv_main.AT_bb6_O_7 <= hbv_main.AT_bb6_J_9 || 0 <= hhv_main.AT_bb6_O_7) && hbv_main.AT_bb6_J_9 < 0))) && !((hbv_main.AT_bb6_F_3 && hbv_main.AT_bb6_E_4) && hbv_main.AT_bb6_C_1 != hbv_main.AT_bb6_D_2)) && !((0 < hhv_main.AT_bb6_H_0 && hbv_main.AT_bb6_E_4) && hbv_main.AT_bb6_C_14 <= 0)) && !((!hbv_main.AT_bb6_E_4 || !hbv_main.AT_bb6_F_3) && hbv_main.AT_bb6_F_3)) && !(hhv_main.AT_bb6_I_1[hbv_main.AT_bb6_C_14] != hbv_main.AT_bb6_E_15 && hbv_main.AT_bb6_E_4)) && !((!hbv_main.AT_bb6_E_4 || !hbv_main.AT_bb6_A_6) && hbv_main.AT_bb6_E_4)) && !(hhv_main.AT_bb6_M_5 <= 0 && hbv_main.AT_bb6_E_4)) && !((hbv_main.AT_bb6_F_3 && hbv_main.AT_bb6_E_4) && hhv_main.AT_bb6_L_4 != hbv_main.AT_bb6_P_5)) && !(hbv_main.AT_bb6_J_9 + 1 != hbv_main.AT_bb6_L_13 && hbv_main.AT_bb6_E_4)) && !((0 < hhv_main.AT_bb6_M_5 && hbv_main.AT_bb6_H_8 <= 0) && hbv_main.AT_bb6_E_4)) && !((!hbv_main.AT_bb6_B_7 && hbv_main.AT_bb6_E_4) && hbv_main.AT_bb6_A_6)) && !!hbv_main.AT_bb6_F_3) && !(hbv_main.AT_bb6_E_4 && hbv_main.AT_bb6_F_16 != hhv_main.AT_bb6_K_3[hbv_main.AT_bb6_D_10])) && !(hbv_main.AT_bb6_D_10 != hhv_main.AT_bb6_J_2 + hbv_main.AT_bb6_J_9 * 4 && hbv_main.AT_bb6_E_4)) && !((hbv_main.AT_bb6_F_3 && hbv_main.AT_bb6_E_4) && hhv_main.AT_bb6_N_6 != hbv_main.AT_bb6_D_2)) && !(hbv_main.AT_bb6_E_4 && hhv_main.AT_bb6_M_5 + hbv_main.AT_bb6_J_9 * 4 != hbv_main.AT_bb6_H_8)) && !((hbv_main.AT_bb6_D_10 <= 0 && 0 < hhv_main.AT_bb6_J_2) && hbv_main.AT_bb6_E_4)) && !(hbv_main.AT_bb6_F_16 + hbv_main.AT_bb6_E_15 != hbv_main.AT_bb6_I_12 && hbv_main.AT_bb6_E_4)) && !((hbv_main.AT_bb6_F_3 && hbv_main.AT_bb6_E_4) && hbv_main.AT_bb6_L_13 != hbv_main.AT_bb6_P_5)) && !(hbv_main.AT_bb6_E_4 && hbv_main.AT_bb6_C_14 != hhv_main.AT_bb6_H_0 + hbv_main.AT_bb6_J_9 * 4)) && !(hhv_main.AT_bb6_H_0 <= 0 && hbv_main.AT_bb6_E_4)) && !(hhv_main.AT_bb6_J_2 <= 0 && hbv_main.AT_bb6_E_4)) && !(hbv_main.AT_bb6_E_4 && hbv_main.AT_bb6_G_11[hbv_main.AT_bb6_H_8 := hbv_main.AT_bb6_I_12] != hbv_main.AT_bb6_C_1);
      VAL   [hbv_main.AT_bb6_J_9=0, hhv_main.AT_bb6_H_0=1, hhv_main.AT_bb6_J_2=1, hhv_main.AT_bb6_L_4=1, hhv_main.AT_bb6_M_5=1, hhv_main.AT_bb6_O_7=1]
[L0]  CALL  call main.AT_bb6(hhv_main.AT_bb6_H_0, hhv_main.AT_bb6_I_1, hhv_main.AT_bb6_J_2, hhv_main.AT_bb6_K_3, hbv_main.AT_bb6_J_9, hhv_main.AT_bb6_M_5, hbv_main.AT_bb6_G_11, hhv_main.AT_bb6_O_7);
      VAL   [hhv_main.AT_bb6_H_0=1, hhv_main.AT_bb6_J_2=1, hhv_main.AT_bb6_L_4=0, hhv_main.AT_bb6_M_5=1, hhv_main.AT_bb6_O_7=1]
[L0]        assume ((((((!((hbv_main.AT_bb6_C_1 != hbv_main.AT_bb6_D_2 && hbv_main.AT_bb6_F_3) && hbv_main.AT_bb6_E_4) && !((hbv_main.AT_bb6_B_5 && hbv_main.AT_bb6_F_3) && hbv_main.AT_bb6_E_4)) && !((hhv_main.AT_bb6_L_4 != hbv_main.AT_bb6_G_6 && hbv_main.AT_bb6_F_3) && hbv_main.AT_bb6_E_4)) && !(hbv_main.AT_bb6_E_4 && (!hbv_main.AT_bb6_F_3 || !hbv_main.AT_bb6_E_4))) && !(((!hbv_main.AT_bb6_B_5 || ((hhv_main.AT_bb6_O_7 <= hbv_main.AT_bb6_A_7 || 0 <= hhv_main.AT_bb6_O_7) && hbv_main.AT_bb6_A_7 < 0)) || ((0 <= hbv_main.AT_bb6_A_7 && hhv_main.AT_bb6_O_7 <= hbv_main.AT_bb6_A_7) && 0 <= hhv_main.AT_bb6_O_7)) && (hbv_main.AT_bb6_B_5 || (((hhv_main.AT_bb6_O_7 < 0 || hbv_main.AT_bb6_A_7 < hhv_main.AT_bb6_O_7) || hbv_main.AT_bb6_A_7 < 0) && ((hhv_main.AT_bb6_O_7 < 0 && hbv_main.AT_bb6_A_7 < hhv_main.AT_bb6_O_7) || 0 <= hbv_main.AT_bb6_A_7))))) && !((hbv_main.AT_bb6_G_6 != 0 && hbv_main.AT_bb6_F_3) && hbv_main.AT_bb6_E_4)) && !((hhv_main.AT_bb6_N_6 != hbv_main.AT_bb6_D_2 && hbv_main.AT_bb6_F_3) && hbv_main.AT_bb6_E_4)) && !!hbv_main.AT_bb6_E_4;
      VAL   [hbv_main.AT_bb6_A_7=1, hhv_main.AT_bb6_H_0=1, hhv_main.AT_bb6_J_2=1, hhv_main.AT_bb6_L_4=0, hhv_main.AT_bb6_M_5=1, hhv_main.AT_bb6_O_7=1]
[L0]  CALL  call main.AT_bb4(hhv_main.AT_bb6_H_0, hhv_main.AT_bb6_I_1, hhv_main.AT_bb6_J_2, hbv_main.AT_bb6_A_7, hhv_main.AT_bb6_K_3, hhv_main.AT_bb6_M_5, hhv_main.AT_bb6_O_7, hbv_main.AT_bb6_C_1);
      VAL   [hhv_main.AT_bb4_H_0=1, hhv_main.AT_bb4_J_2=1, hhv_main.AT_bb4_K_3=1, hhv_main.AT_bb4_M_5=1, hhv_main.AT_bb4_N_6=1]
[L0]        assume ((((((((((((!(hbv_main.AT_bb4_F_5 + 1 != hbv_main.AT_bb4_H_2 && hbv_main.AT_bb4_B_4) && !((hbv_main.AT_bb4_E_3 && hbv_main.AT_bb4_B_4) && hbv_main.AT_bb4_G_1 != hhv_main.AT_bb4_K_3)) && !((hbv_main.AT_bb4_G_1 != hbv_main.AT_bb4_H_2 && hbv_main.AT_bb4_E_3) && hbv_main.AT_bb4_B_4)) && !((hbv_main.AT_bb4_B_6 || (((hbv_main.AT_bb4_F_5 < 0 || hbv_main.AT_bb4_F_5 < hhv_main.AT_bb4_N_6) || hhv_main.AT_bb4_N_6 < 0) && (0 <= hbv_main.AT_bb4_F_5 || (hbv_main.AT_bb4_F_5 < hhv_main.AT_bb4_N_6 && hhv_main.AT_bb4_N_6 < 0)))) && ((!hbv_main.AT_bb4_B_6 || ((0 <= hbv_main.AT_bb4_F_5 && hhv_main.AT_bb4_N_6 <= hbv_main.AT_bb4_F_5) && 0 <= hhv_main.AT_bb4_N_6)) || (hbv_main.AT_bb4_F_5 < 0 && (hhv_main.AT_bb4_N_6 <= hbv_main.AT_bb4_F_5 || 0 <= hhv_main.AT_bb4_N_6))))) && !((hbv_main.AT_bb4_E_3 && hbv_main.AT_bb4_B_4) && hbv_main.AT_bb4_I_8 != hbv_main.AT_bb4_G_12)) && !((hbv_main.AT_bb4_E_3 && hbv_main.AT_bb4_B_4) && hhv_main.AT_bb4_L_4 != hbv_main.AT_bb4_I_8)) && !(hbv_main.AT_bb4_B_4 && hbv_main.AT_bb4_C_10[hbv_main.AT_bb4_A_7 := hbv_main.AT_bb4_E_11] != hbv_main.AT_bb4_G_12)) && !(hbv_main.AT_bb4_A_7 != hbv_main.AT_bb4_F_5 * 4 + hhv_main.AT_bb4_J_2 && hbv_main.AT_bb4_B_4)) && !((!hbv_main.AT_bb4_B_6 && hbv_main.AT_bb4_B_4) && hbv_main.AT_bb4_A_9)) && !((hbv_main.AT_bb4_A_7 <= 0 && 0 < hhv_main.AT_bb4_J_2) && hbv_main.AT_bb4_B_4)) && !(hbv_main.AT_bb4_B_4 && hhv_main.AT_bb4_J_2 <= 0)) && !!hbv_main.AT_bb4_E_3) && !((!hbv_main.AT_bb4_E_3 || !hbv_main.AT_bb4_B_4) && hbv_main.AT_bb4_E_3)) && !(hbv_main.AT_bb4_B_4 && (!hbv_main.AT_bb4_B_4 || !hbv_main.AT_bb4_A_9));
      VAL   [hbv_main.AT_bb4_F_5=0, hhv_main.AT_bb4_H_0=1, hhv_main.AT_bb4_J_2=1, hhv_main.AT_bb4_K_3=1, hhv_main.AT_bb4_M_5=1, hhv_main.AT_bb4_N_6=1]
[L0]  CALL  call main.AT_bb4(hhv_main.AT_bb4_H_0, hhv_main.AT_bb4_I_1, hhv_main.AT_bb4_J_2, hbv_main.AT_bb4_F_5, hbv_main.AT_bb4_C_10, hhv_main.AT_bb4_M_5, hhv_main.AT_bb4_N_6, hhv_main.AT_bb4_O_7);
      VAL   [hhv_main.AT_bb4_H_0=1, hhv_main.AT_bb4_J_2=1, hhv_main.AT_bb4_K_3=0, hhv_main.AT_bb4_M_5=1, hhv_main.AT_bb4_N_6=1]
[L0]        assume ((((((!((hhv_main.AT_bb4_L_4 != hbv_main.AT_bb4_D_6 && hbv_main.AT_bb4_F_2) && hbv_main.AT_bb4_E_3) && !((hbv_main.AT_bb4_B_4 && hbv_main.AT_bb4_F_2) && hbv_main.AT_bb4_E_3)) && !(hbv_main.AT_bb4_E_3 && (!hbv_main.AT_bb4_F_2 || !hbv_main.AT_bb4_E_3))) && !(((((hhv_main.AT_bb4_N_6 < 0 || hbv_main.AT_bb4_A_7 < 0) || hbv_main.AT_bb4_A_7 < hhv_main.AT_bb4_N_6) && (0 <= hbv_main.AT_bb4_A_7 || (hhv_main.AT_bb4_N_6 < 0 && hbv_main.AT_bb4_A_7 < hhv_main.AT_bb4_N_6))) || hbv_main.AT_bb4_B_4) && ((!hbv_main.AT_bb4_B_4 || ((0 <= hbv_main.AT_bb4_A_7 && hhv_main.AT_bb4_N_6 <= hbv_main.AT_bb4_A_7) && 0 <= hhv_main.AT_bb4_N_6)) || ((hhv_main.AT_bb4_N_6 <= hbv_main.AT_bb4_A_7 || 0 <= hhv_main.AT_bb4_N_6) && hbv_main.AT_bb4_A_7 < 0)))) && !((hhv_main.AT_bb4_K_3 != hbv_main.AT_bb4_G_1 && hbv_main.AT_bb4_F_2) && hbv_main.AT_bb4_E_3)) && !((hbv_main.AT_bb4_G_1 != 0 && hbv_main.AT_bb4_F_2) && hbv_main.AT_bb4_E_3)) && !!hbv_main.AT_bb4_E_3) && !((hbv_main.AT_bb4_C_5 != hbv_main.AT_bb4_D_6 && hbv_main.AT_bb4_F_2) && hbv_main.AT_bb4_E_3);
      VAL   [hbv_main.AT_bb4_A_7=1, hhv_main.AT_bb4_H_0=1, hhv_main.AT_bb4_J_2=1, hhv_main.AT_bb4_K_3=0, hhv_main.AT_bb4_M_5=1, hhv_main.AT_bb4_N_6=1]
[L0]  CALL  call main.AT_bb(hhv_main.AT_bb4_H_0, hbv_main.AT_bb4_A_7, hhv_main.AT_bb4_I_1, hhv_main.AT_bb4_J_2, hhv_main.AT_bb4_M_5, hhv_main.AT_bb4_N_6, hhv_main.AT_bb4_O_7, hbv_main.AT_bb4_C_5);
      VAL   [hhv_main.AT_bb_H_0=1, hhv_main.AT_bb_I_1=1, hhv_main.AT_bb_K_3=1, hhv_main.AT_bb_L_4=1, hhv_main.AT_bb_M_5=1]
[L0]        assume ((((((((((((!(hbv_main.AT_bb_B_5 + 1 != hbv_main.AT_bb_H_3 && hbv_main.AT_bb_K_1) && !(hbv_main.AT_bb_K_1 && hbv_main.AT_bb_C_10[hbv_main.AT_bb_A_6 := hbv_main.AT_bb_E_11] != hbv_main.AT_bb_G_12)) && !((hbv_main.AT_bb_L_2 != hbv_main.AT_bb_H_3 && hbv_main.AT_bb_E_4) && hbv_main.AT_bb_K_1)) && !((!hbv_main.AT_bb_B_8 && hbv_main.AT_bb_K_1) && hbv_main.AT_bb_A_9)) && !(((((hbv_main.AT_bb_B_5 < hhv_main.AT_bb_M_5 || hhv_main.AT_bb_M_5 < 0) || hbv_main.AT_bb_B_5 < 0) && (0 <= hbv_main.AT_bb_B_5 || (hbv_main.AT_bb_B_5 < hhv_main.AT_bb_M_5 && hhv_main.AT_bb_M_5 < 0))) || hbv_main.AT_bb_B_8) && ((!hbv_main.AT_bb_B_8 || (hbv_main.AT_bb_B_5 < 0 && (0 <= hhv_main.AT_bb_M_5 || hhv_main.AT_bb_M_5 <= hbv_main.AT_bb_B_5))) || ((0 <= hhv_main.AT_bb_M_5 && 0 <= hbv_main.AT_bb_B_5) && hhv_main.AT_bb_M_5 <= hbv_main.AT_bb_B_5)))) && !((hbv_main.AT_bb_I_7 != hhv_main.AT_bb_J_2 && hbv_main.AT_bb_E_4) && hbv_main.AT_bb_K_1)) && !(hbv_main.AT_bb_A_6 != hbv_main.AT_bb_B_5 * 4 + hhv_main.AT_bb_H_0 && hbv_main.AT_bb_K_1)) && !(hbv_main.AT_bb_K_1 && (!hbv_main.AT_bb_K_1 || !hbv_main.AT_bb_A_9))) && !(hbv_main.AT_bb_K_1 && hhv_main.AT_bb_H_0 <= 0)) && !((hbv_main.AT_bb_E_4 && hbv_main.AT_bb_K_1) && hbv_main.AT_bb_I_7 != hbv_main.AT_bb_G_12)) && !((hbv_main.AT_bb_E_4 && hbv_main.AT_bb_K_1) && hhv_main.AT_bb_I_1 != hbv_main.AT_bb_L_2)) && !!hbv_main.AT_bb_E_4) && !((!hbv_main.AT_bb_E_4 || !hbv_main.AT_bb_K_1) && hbv_main.AT_bb_E_4)) && !((hbv_main.AT_bb_A_6 <= 0 && hbv_main.AT_bb_K_1) && 0 < hhv_main.AT_bb_H_0);
      VAL   [hbv_main.AT_bb_B_5=0, hhv_main.AT_bb_H_0=1, hhv_main.AT_bb_I_1=1, hhv_main.AT_bb_K_3=1, hhv_main.AT_bb_L_4=1, hhv_main.AT_bb_M_5=1]
[L0]  CALL  call main.AT_bb(hhv_main.AT_bb_H_0, hbv_main.AT_bb_B_5, hbv_main.AT_bb_C_10, hhv_main.AT_bb_K_3, hhv_main.AT_bb_L_4, hhv_main.AT_bb_M_5, hhv_main.AT_bb_N_6, hhv_main.AT_bb_O_7);
      VAL   [hhv_main.AT_bb_H_0=1, hhv_main.AT_bb_I_1=0, hhv_main.AT_bb_K_3=1, hhv_main.AT_bb_L_4=1, hhv_main.AT_bb_M_5=1]
[L0]        assume ((((((((hbv_main.AT_bb_B_5 == hbv_main.AT_bb_A_6 && !((hhv_main.AT_bb_J_2 != hbv_main.AT_bb_D_2 && hbv_main.AT_bb_F_3) && hbv_main.AT_bb_E_4)) && !(hbv_main.AT_bb_E_4 && (!hbv_main.AT_bb_F_3 || !hbv_main.AT_bb_E_4))) && !((hbv_main.AT_bb_C_1 != hbv_main.AT_bb_D_2 && hbv_main.AT_bb_F_3) && hbv_main.AT_bb_E_4)) && !(hhv_main.AT_bb_L_4 <= 0)) && !((hbv_main.AT_bb_G_7 != 0 && hbv_main.AT_bb_F_3) && hbv_main.AT_bb_E_4)) && !(hhv_main.AT_bb_H_0 <= 0)) && !(hhv_main.AT_bb_K_3 <= 0)) && !((hhv_main.AT_bb_I_1 != hbv_main.AT_bb_G_7 && hbv_main.AT_bb_F_3) && hbv_main.AT_bb_E_4)) && !!hbv_main.AT_bb_E_4;
      VAL   [hbv_main.AT_bb_B_5=2, hhv_main.AT_bb_H_0=1, hhv_main.AT_bb_I_1=0, hhv_main.AT_bb_K_3=1, hhv_main.AT_bb_L_4=1, hhv_main.AT_bb_M_5=1]
[L0]  CALL  call main.ATentry(hbv_main.AT_bb_B_5);
[L0]  RET   call main.ATentry(hbv_main.AT_bb_B_5);
      VAL   [hbv_main.AT_bb_B_5=2, hhv_main.AT_bb_H_0=1, hhv_main.AT_bb_I_1=0, hhv_main.AT_bb_K_3=1, hhv_main.AT_bb_L_4=1, hhv_main.AT_bb_M_5=1]
[L0]  RET   call main.AT_bb(hhv_main.AT_bb_H_0, hbv_main.AT_bb_B_5, hbv_main.AT_bb_C_10, hhv_main.AT_bb_K_3, hhv_main.AT_bb_L_4, hhv_main.AT_bb_M_5, hhv_main.AT_bb_N_6, hhv_main.AT_bb_O_7);
      VAL   [hbv_main.AT_bb_B_5=0, hhv_main.AT_bb_H_0=1, hhv_main.AT_bb_I_1=1, hhv_main.AT_bb_K_3=1, hhv_main.AT_bb_L_4=1, hhv_main.AT_bb_M_5=1]
[L0]  RET   call main.AT_bb(hhv_main.AT_bb4_H_0, hbv_main.AT_bb4_A_7, hhv_main.AT_bb4_I_1, hhv_main.AT_bb4_J_2, hhv_main.AT_bb4_M_5, hhv_main.AT_bb4_N_6, hhv_main.AT_bb4_O_7, hbv_main.AT_bb4_C_5);
      VAL   [hbv_main.AT_bb4_A_7=1, hhv_main.AT_bb4_H_0=1, hhv_main.AT_bb4_J_2=1, hhv_main.AT_bb4_K_3=0, hhv_main.AT_bb4_M_5=1, hhv_main.AT_bb4_N_6=1]
[L0]  RET   call main.AT_bb4(hhv_main.AT_bb4_H_0, hhv_main.AT_bb4_I_1, hhv_main.AT_bb4_J_2, hbv_main.AT_bb4_F_5, hbv_main.AT_bb4_C_10, hhv_main.AT_bb4_M_5, hhv_main.AT_bb4_N_6, hhv_main.AT_bb4_O_7);
      VAL   [hbv_main.AT_bb4_F_5=0, hhv_main.AT_bb4_H_0=1, hhv_main.AT_bb4_J_2=1, hhv_main.AT_bb4_K_3=1, hhv_main.AT_bb4_M_5=1, hhv_main.AT_bb4_N_6=1]
[L0]  RET   call main.AT_bb4(hhv_main.AT_bb6_H_0, hhv_main.AT_bb6_I_1, hhv_main.AT_bb6_J_2, hbv_main.AT_bb6_A_7, hhv_main.AT_bb6_K_3, hhv_main.AT_bb6_M_5, hhv_main.AT_bb6_O_7, hbv_main.AT_bb6_C_1);
      VAL   [hbv_main.AT_bb6_A_7=1, hhv_main.AT_bb6_H_0=1, hhv_main.AT_bb6_J_2=1, hhv_main.AT_bb6_L_4=0, hhv_main.AT_bb6_M_5=1, hhv_main.AT_bb6_O_7=1]
[L0]  RET   call main.AT_bb6(hhv_main.AT_bb6_H_0, hhv_main.AT_bb6_I_1, hhv_main.AT_bb6_J_2, hhv_main.AT_bb6_K_3, hbv_main.AT_bb6_J_9, hhv_main.AT_bb6_M_5, hbv_main.AT_bb6_G_11, hhv_main.AT_bb6_O_7);
      VAL   [hbv_main.AT_bb6_J_9=0, hhv_main.AT_bb6_H_0=1, hhv_main.AT_bb6_J_2=1, hhv_main.AT_bb6_L_4=1, hhv_main.AT_bb6_M_5=1, hhv_main.AT_bb6_O_7=1]
[L0]  RET   call main.AT_bb6(hhv_main.AT_bb8_F_0, hhv_main.AT_bb8_G_1, hhv_main.AT_bb8_H_2, hhv_main.AT_bb8_I_3, hbv_main.AT_bb8_A_4, hhv_main.AT_bb8_J_4, hhv_main.AT_bb8_K_5, hhv_main.AT_bb8_M_7);
      VAL   [hbv_main.AT_bb8_A_4=1, hhv_main.AT_bb8_F_0=1, hhv_main.AT_bb8_H_2=1, hhv_main.AT_bb8_J_4=1, hhv_main.AT_bb8_L_6=0, hhv_main.AT_bb8_M_7=1]
[L0]  RET   call main.AT_bb8(hbv_main.ATverifier.error.split_G_14, hbv_main.ATverifier.error.split_H_27, hbv_main.ATverifier.error.split_K_10, hbv_main.ATverifier.error.split_L_26, hbv_main.ATverifier.error.split_D_6, hbv_main.ATverifier.error.split_E_12, hbv_main.ATverifier.error.split_J_16, hbv_main.ATverifier.error.split_A_20);
      VAL   [hbv_main.ATverifier.error.split_A_20=1, hbv_main.ATverifier.error.split_D_6=1, hbv_main.ATverifier.error.split_G_14=1, hbv_main.ATverifier.error.split_J_16=0, hbv_main.ATverifier.error.split_K_10=1]
[L0]  RET   call main.ATverifier.error.split();
[L0]  RET   call False();
[L0]        assert false;

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 11 procedures, 45 locations, 69 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 1407 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1060 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 194 IncrementalHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 347 mSDtfsCounter, 194 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 179 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=5, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 907 SizeOfPredicates, 3 NumberOfNonLiveVariables, 702 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 33/39 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:56,004 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
