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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:24,304 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:24,364 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb641345-61d2-4e37-825c-7b04e4815880/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:24,368 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:24,369 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:24,391 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:24,392 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:24,392 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:24,393 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:24,393 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:24,393 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:24,393 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:24,393 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:24,394 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:24,394 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:24,394 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:24,394 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:24,394 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:24,394 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:24,394 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:24,395 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:24,395 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:24,395 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:24,395 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:24,395 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:24,396 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:24,396 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:24,708 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:24,721 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:24,723 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:24,727 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:24,727 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:24,729 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb641345-61d2-4e37-825c-7b04e4815880/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-003.smt2
[2025-04-28 21:21:24,731 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:24,736 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:25,002 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fb641345-61d2-4e37-825c-7b04e4815880/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Arrays/chc-comp24-LIA-Arrays-003.smt2
[2025-04-28 21:21:25,005 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:25,007 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:25,008 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:25,008 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:25,008 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:25,011 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:25" (1/1) ...
[2025-04-28 21:21:25,046 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:25 Unit
[2025-04-28 21:21:25,046 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:25,049 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:25,049 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:25,049 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:25,063 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:25" (1/1) ...
[2025-04-28 21:21:25,063 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:25" (1/1) ...
[2025-04-28 21:21:25,089 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:25" (1/1) ...
[2025-04-28 21:21:25,089 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:25" (1/1) ...
[2025-04-28 21:21:25,092 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:25" (1/1) ...
[2025-04-28 21:21:25,092 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:25" (1/1) ...
[2025-04-28 21:21:25,095 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:25" (1/1) ...
[2025-04-28 21:21:25,096 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:25" (1/1) ...
[2025-04-28 21:21:25,096 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:25" (1/1) ...
[2025-04-28 21:21:25,108 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:25,109 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:25,109 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:25,109 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:25,110 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:25" (1/1) ...
[2025-04-28 21:21:25,114 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:25,126 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:25,141 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:25,145 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:25,159 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:25,159 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:25,159 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:25,159 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATverifier.error.split given in one single declaration
[2025-04-28 21:21:25,160 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATverifier.error.split
[2025-04-28 21:21:25,160 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATverifier.error.split
[2025-04-28 21:21:25,160 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure eval given in one single declaration
[2025-04-28 21:21:25,160 INFO  L130     BoogieDeclarations]: Found specification of procedure eval
[2025-04-28 21:21:25,160 INFO  L138     BoogieDeclarations]: Found implementation of procedure eval
[2025-04-28 21:21:25,160 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure eval.AT.split given in one single declaration
[2025-04-28 21:21:25,160 INFO  L130     BoogieDeclarations]: Found specification of procedure eval.AT.split
[2025-04-28 21:21:25,160 INFO  L138     BoogieDeclarations]: Found implementation of procedure eval.AT.split
[2025-04-28 21:21:25,160 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure eval.AT_1 given in one single declaration
[2025-04-28 21:21:25,160 INFO  L130     BoogieDeclarations]: Found specification of procedure eval.AT_1
[2025-04-28 21:21:25,161 INFO  L138     BoogieDeclarations]: Found implementation of procedure eval.AT_1
[2025-04-28 21:21:25,161 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.AT_bb given in one single declaration
[2025-04-28 21:21:25,161 INFO  L130     BoogieDeclarations]: Found specification of procedure main.AT_bb
[2025-04-28 21:21:25,161 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.AT_bb
[2025-04-28 21:21:25,161 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATentry given in one single declaration
[2025-04-28 21:21:25,161 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATentry
[2025-04-28 21:21:25,161 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATentry
[2025-04-28 21:21:25,161 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure __VERIFIER_assert given in one single declaration
[2025-04-28 21:21:25,161 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2025-04-28 21:21:25,161 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2025-04-28 21:21:25,161 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure __VERIFIER_assert.AT_call2 given in one single declaration
[2025-04-28 21:21:25,161 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert.AT_call2
[2025-04-28 21:21:25,162 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert.AT_call2
[2025-04-28 21:21:25,162 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure __VERIFIER_assert.AT_1 given in one single declaration
[2025-04-28 21:21:25,162 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert.AT_1
[2025-04-28 21:21:25,162 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert.AT_1
[2025-04-28 21:21:25,162 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:25,162 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:25,162 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:25,238 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:25,241 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:25,443 INFO  L?                        ?]: Removed 31 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:25,443 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:25,459 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:25,460 INFO  L312             CfgBuilder]: Removed 4 assume(true) statements.
[2025-04-28 21:21:25,460 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:25 BoogieIcfgContainer
[2025-04-28 21:21:25,460 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:25,462 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:25,466 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:25,470 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:25,471 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:25" (1/3) ...
[2025-04-28 21:21:25,474 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fb1e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:25, skipping insertion in model container
[2025-04-28 21:21:25,474 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:25" (2/3) ...
[2025-04-28 21:21:25,474 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fb1e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:25, skipping insertion in model container
[2025-04-28 21:21:25,475 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:25" (3/3) ...
[2025-04-28 21:21:25,478 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:25,497 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:25,500 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 11 procedures, 42 locations, 62 edges, 11 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:25,552 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:25,578 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;@32b4ad17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:25,578 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:25,583 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 42 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 10 states have call predecessors, (12), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12)
[2025-04-28 21:21:25,593 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-04-28 21:21:25,593 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:25,595 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:25,595 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:25,601 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:25,602 INFO  L85        PathProgramCache]: Analyzing trace with hash -1089740061, now seen corresponding path program 1 times
[2025-04-28 21:21:25,610 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:25,611 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258709372]
[2025-04-28 21:21:25,611 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:25,612 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:25,645 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-28 21:21:25,671 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-28 21:21:25,672 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:25,672 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:25,851 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:25,851 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:25,852 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258709372]
[2025-04-28 21:21:25,852 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258709372] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:25,853 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:25,858 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:25,860 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639298146]
[2025-04-28 21:21:25,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:25,865 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:25,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:25,904 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:25,904 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:25,907 INFO  L87              Difference]: Start difference. First operand  has 42 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 10 states have call predecessors, (12), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:25,984 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:25,986 INFO  L93              Difference]: Finished difference Result 42 states and 50 transitions.
[2025-04-28 21:21:25,988 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:25,990 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 19
[2025-04-28 21:21:25,990 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:25,999 INFO  L225             Difference]: With dead ends: 42
[2025-04-28 21:21:26,000 INFO  L226             Difference]: Without dead ends: 42
[2025-04-28 21:21:26,002 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:26,006 INFO  L437           NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:26,009 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 131 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:26,027 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 42 states.
[2025-04-28 21:21:26,057 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42.
[2025-04-28 21:21:26,060 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 22 states have internal predecessors, (25), 12 states have call successors, (12), 10 states have call predecessors, (12), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13)
[2025-04-28 21:21:26,067 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions.
[2025-04-28 21:21:26,068 INFO  L79                 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 19
[2025-04-28 21:21:26,069 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:26,070 INFO  L485      AbstractCegarLoop]: Abstraction has 42 states and 50 transitions.
[2025-04-28 21:21:26,070 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:26,071 INFO  L278                IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions.
[2025-04-28 21:21:26,072 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-04-28 21:21:26,073 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:26,073 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:26,074 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:26,074 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:26,075 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:26,075 INFO  L85        PathProgramCache]: Analyzing trace with hash 777187357, now seen corresponding path program 1 times
[2025-04-28 21:21:26,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:26,076 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365792270]
[2025-04-28 21:21:26,076 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:26,076 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:26,135 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-28 21:21:26,152 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-28 21:21:26,153 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:26,154 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:26,235 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:26,235 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:26,236 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365792270]
[2025-04-28 21:21:26,236 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365792270] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:26,236 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:26,236 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:26,236 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723577713]
[2025-04-28 21:21:26,236 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:26,238 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:26,238 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:26,239 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:26,239 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:26,239 INFO  L87              Difference]: Start difference. First operand 42 states and 50 transitions. Second operand  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:26,274 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:26,274 INFO  L93              Difference]: Finished difference Result 46 states and 54 transitions.
[2025-04-28 21:21:26,277 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:26,277 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 19
[2025-04-28 21:21:26,277 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:26,278 INFO  L225             Difference]: With dead ends: 46
[2025-04-28 21:21:26,278 INFO  L226             Difference]: Without dead ends: 46
[2025-04-28 21:21:26,278 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:26,281 INFO  L437           NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:26,281 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 136 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-28 21:21:26,282 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 46 states.
[2025-04-28 21:21:26,291 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42.
[2025-04-28 21:21:26,291 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 42 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 10 states have call predecessors, (12), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13)
[2025-04-28 21:21:26,294 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions.
[2025-04-28 21:21:26,295 INFO  L79                 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 19
[2025-04-28 21:21:26,295 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:26,295 INFO  L485      AbstractCegarLoop]: Abstraction has 42 states and 50 transitions.
[2025-04-28 21:21:26,296 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:26,296 INFO  L278                IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions.
[2025-04-28 21:21:26,298 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 27
[2025-04-28 21:21:26,299 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:26,299 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]
[2025-04-28 21:21:26,300 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:26,300 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:26,300 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:26,301 INFO  L85        PathProgramCache]: Analyzing trace with hash 1229130473, now seen corresponding path program 1 times
[2025-04-28 21:21:26,301 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:26,301 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47581182]
[2025-04-28 21:21:26,301 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:26,301 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:26,318 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-04-28 21:21:26,327 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-04-28 21:21:26,330 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:26,331 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:26,331 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-04-28 21:21:26,336 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes.
[2025-04-28 21:21:26,351 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements.
[2025-04-28 21:21:26,351 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:26,351 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-28 21:21:26,405 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-04-28 21:21:26,406 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-04-28 21:21:26,407 INFO  L790   garLoopResultBuilder]: Registering result UNSAFE for location Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY (0 of 1 remaining)
[2025-04-28 21:21:26,410 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:26,413 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2025-04-28 21:21:26,427 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-28 21:21:26,431 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:21:26 BoogieIcfgContainer
[2025-04-28 21:21:26,431 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-28 21:21:26,432 INFO  L158              Benchmark]: Toolchain (without parser) took 1425.55ms. Allocated memory is still 234.9MB. Free memory was 163.3MB in the beginning and 197.8MB in the end (delta: -34.5MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:26,433 INFO  L158              Benchmark]: SmtParser took 1.71ms. Allocated memory is still 234.9MB. Free memory is still 172.5MB. There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:26,433 INFO  L158              Benchmark]: ChcToBoogie took 39.58ms. Allocated memory is still 234.9MB. Free memory was 163.3MB in the beginning and 161.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:26,433 INFO  L158              Benchmark]: Boogie Preprocessor took 59.92ms. Allocated memory is still 234.9MB. Free memory was 161.9MB in the beginning and 159.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:26,434 INFO  L158              Benchmark]: RCFGBuilder took 351.24ms. Allocated memory is still 234.9MB. Free memory was 159.9MB in the beginning and 148.7MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
[2025-04-28 21:21:26,434 INFO  L158              Benchmark]: TraceAbstraction took 969.02ms. Allocated memory is still 234.9MB. Free memory was 148.7MB in the beginning and 197.8MB in the end (delta: -49.1MB). There was no memory consumed. Max. memory is 33.6GB.
[2025-04-28 21:21:26,436 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * SmtParser took 1.71ms. Allocated memory is still 234.9MB. Free memory is still 172.5MB. There was no memory consumed. Max. memory is 33.6GB.
 * ChcToBoogie took 39.58ms. Allocated memory is still 234.9MB. Free memory was 163.3MB in the beginning and 161.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 33.6GB.
 * Boogie Preprocessor took 59.92ms. Allocated memory is still 234.9MB. Free memory was 161.9MB in the beginning and 159.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 33.6GB.
 * RCFGBuilder took 351.24ms. Allocated memory is still 234.9MB. Free memory was 159.9MB in the beginning and 148.7MB in the end (delta: 11.1MB). Peak memory consumption was 16.8MB. Max. memory is 33.6GB.
 * TraceAbstraction took 969.02ms. Allocated memory is still 234.9MB. Free memory was 148.7MB in the beginning and 197.8MB in the end (delta: -49.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_B_13[hbv_main.ATverifier.error.split_C_14] == hbv_main.ATverifier.error.split_D_5 && !(hbv_main.ATverifier.error.split_H_8 && (!hbv_main.ATverifier.error.split_F_7 || !hbv_main.ATverifier.error.split_H_8))) && !(hbv_main.ATverifier.error.split_N_9 && (!hbv_main.ATverifier.error.split_M_4 || !hbv_main.ATverifier.error.split_N_9))) && !(((hbv_main.ATverifier.error.split_J_11 || hbv_main.ATverifier.error.split_I_12 == 0) && hbv_main.ATverifier.error.split_K_3) && (!hbv_main.ATverifier.error.split_J_11 || hbv_main.ATverifier.error.split_I_12 != 0))) && !hbv_main.ATverifier.error.split_v_15_16) && !!hbv_main.ATverifier.error.split_N_9) && !hbv_main.ATverifier.error.split_v_16_1) && !(!hbv_main.ATverifier.error.split_J_11 && hbv_main.ATverifier.error.split_K_3)) && !(hbv_main.ATverifier.error.split_K_3 && (!hbv_main.ATverifier.error.split_K_3 || !hbv_main.ATverifier.error.split_H_8))) && !((hbv_main.ATverifier.error.split_D_5 != 0 || !hbv_main.ATverifier.error.split_E_6) && (hbv_main.ATverifier.error.split_D_5 == 0 || hbv_main.ATverifier.error.split_E_6))) && !((!hbv_main.ATverifier.error.split_L_2 || !hbv_main.ATverifier.error.split_M_4) && hbv_main.ATverifier.error.split_M_4)) && (if hbv_main.ATverifier.error.split_E_6 then 1 else 0) == hbv_main.ATverifier.error.split_I_12) && !(hbv_main.ATverifier.error.split_L_2 && (!hbv_main.ATverifier.error.split_L_2 || !hbv_main.ATverifier.error.split_K_3))) && !!hbv_main.ATverifier.error.split_v_14_10) && !((hbv_main.ATverifier.error.split_H_8 && hbv_main.ATverifier.error.split_F_7) && hbv_main.ATverifier.error.split_G_15);
      VAL   [hbv_main.ATverifier.error.split_C_14=2, hbv_main.ATverifier.error.split_v_14_10=true, hbv_main.ATverifier.error.split_v_15_16=false, hbv_main.ATverifier.error.split_v_16_1=false]
[L0]  CALL  call main.AT_bb(hbv_main.ATverifier.error.split_C_14, hbv_main.ATverifier.error.split_A_17);
      VAL   [hhv_main.AT_bb_F_0=2]
[L0]        assume (((hbv_main.AT_bb_B_5 == hbv_main.AT_bb_A_4[hhv_main.AT_bb_F_0 := 0] && !!hbv_main.AT_bb_C_2) && !((hbv_main.AT_bb_E_1 != hhv_main.AT_bb_G_1 && hbv_main.AT_bb_C_2) && hbv_main.AT_bb_D_3)) && !((hbv_main.AT_bb_B_5 != hbv_main.AT_bb_E_1 && hbv_main.AT_bb_C_2) && hbv_main.AT_bb_D_3)) && !((!hbv_main.AT_bb_D_3 || !hbv_main.AT_bb_C_2) && hbv_main.AT_bb_C_2);
      VAL   [hhv_main.AT_bb_F_0=2]
[L0]  CALL  call main.ATentry(hbv_main.AT_bb_A_4);
[L0]  RET   call main.ATentry(hbv_main.AT_bb_A_4);
      VAL   [hhv_main.AT_bb_F_0=2]
[L0]  RET   call main.AT_bb(hbv_main.ATverifier.error.split_C_14, hbv_main.ATverifier.error.split_A_17);
      VAL   [hbv_main.ATverifier.error.split_C_14=2, hbv_main.ATverifier.error.split_v_14_10=true, hbv_main.ATverifier.error.split_v_15_16=false, hbv_main.ATverifier.error.split_v_16_1=false]
[L0]  CALL  call eval(hbv_main.ATverifier.error.split_v_14_10, hbv_main.ATverifier.error.split_v_15_16, hbv_main.ATverifier.error.split_v_16_1, hbv_main.ATverifier.error.split_A_17, hbv_main.ATverifier.error.split_B_13, hbv_main.ATverifier.error.split_C_14);
      VAL   [hhv_eval_C_5=2, hhv_eval_v_3_0=true, hhv_eval_v_4_1=false, hhv_eval_v_5_2=false]
[L0]        assume (!hhv_eval_v_4_1 && !!hhv_eval_v_3_0) && !hhv_eval_v_5_2;
      VAL   [hhv_eval_C_5=2, hhv_eval_v_3_0=true, hhv_eval_v_4_1=false, hhv_eval_v_5_2=false]
[L0]  CALL  call eval.AT.split(hhv_eval_A_3, hhv_eval_B_4, hhv_eval_C_5);
      VAL   [hhv_eval.AT.split_E_2=2]
[L0]        assume (!!hbv_eval.AT.split_B_1 && hhv_eval.AT.split_C_0[hhv_eval.AT.split_E_2 := 1] == hhv_eval.AT.split_D_1) && !(hbv_eval.AT.split_B_1 && (!hbv_eval.AT.split_B_1 || !hbv_eval.AT.split_A_2));
      VAL   [hhv_eval.AT.split_E_2=2]
[L0]  CALL  call eval.AT_1(hhv_eval.AT.split_C_0, hhv_eval.AT.split_E_2);
[L0]  RET   call eval.AT_1(hhv_eval.AT.split_C_0, hhv_eval.AT.split_E_2);
      VAL   [hhv_eval.AT.split_E_2=2]
[L0]  RET   call eval.AT.split(hhv_eval_A_3, hhv_eval_B_4, hhv_eval_C_5);
      VAL   [hhv_eval_C_5=2, hhv_eval_v_3_0=true, hhv_eval_v_4_1=false, hhv_eval_v_5_2=false]
[L0]  RET   call eval(hbv_main.ATverifier.error.split_v_14_10, hbv_main.ATverifier.error.split_v_15_16, hbv_main.ATverifier.error.split_v_16_1, hbv_main.ATverifier.error.split_A_17, hbv_main.ATverifier.error.split_B_13, hbv_main.ATverifier.error.split_C_14);
      VAL   [hbv_main.ATverifier.error.split_C_14=2, hbv_main.ATverifier.error.split_v_14_10=true, hbv_main.ATverifier.error.split_v_15_16=false, hbv_main.ATverifier.error.split_v_16_1=false]
[L0]  RET   call main.ATverifier.error.split();
[L0]  RET   call False();
[L0]        assert false;

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 11 procedures, 42 locations, 62 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 267 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 171 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 96 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 8, 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, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 64 NumberOfCodeBlocks, 64 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 40 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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:26,476 INFO  L540       MonitoredProcess]: [MP /usr/bin/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...
unsat
