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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:49,733 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:49,818 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935f6f3e-8174-4c64-9dcd-664d2ed0437b/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:49,824 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:49,825 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:49,862 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:49,863 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:49,863 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:49,864 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:49,864 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:49,865 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:49,865 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:49,865 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:49,865 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:49,865 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:49,867 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:49,867 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:49,867 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:49,867 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:49,867 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:49,867 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:49,868 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:49,868 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:49,868 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:49,869 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:49,869 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:49,869 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:50,202 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:50,211 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:50,214 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:50,215 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:50,215 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:50,218 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935f6f3e-8174-4c64-9dcd-664d2ed0437b/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin-Arrays/chc-comp24-LIA-Lin-Arrays-047.smt2
[2025-04-28 21:21:50,220 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:50,226 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
unknown
[2025-04-28 21:21:50,567 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_935f6f3e-8174-4c64-9dcd-664d2ed0437b/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA-Lin-Arrays/chc-comp24-LIA-Lin-Arrays-047.smt2
[2025-04-28 21:21:50,571 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:50,573 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:50,574 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:50,574 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:50,575 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:50,583 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,630 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50 Unit
[2025-04-28 21:21:50,630 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:50,631 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:50,632 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:50,633 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:50,651 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,652 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,691 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,692 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,697 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,698 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,700 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,702 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,703 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,723 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:50,725 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:50,725 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:50,725 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:50,726 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (1/1) ...
[2025-04-28 21:21:50,729 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:50,742 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:50,755 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:50,760 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:50,771 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:50,771 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:50,771 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:50,771 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATverifier.error.split given in one single declaration
[2025-04-28 21:21:50,772 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATverifier.error.split
[2025-04-28 21:21:50,772 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATverifier.error.split
[2025-04-28 21:21:50,772 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATbb41.i given in one single declaration
[2025-04-28 21:21:50,772 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATbb41.i
[2025-04-28 21:21:50,772 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATbb41.i
[2025-04-28 21:21:50,772 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATbb23.i given in one single declaration
[2025-04-28 21:21:50,772 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATbb23.i
[2025-04-28 21:21:50,772 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATbb23.i
[2025-04-28 21:21:50,772 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATbb11.i given in one single declaration
[2025-04-28 21:21:50,772 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATbb11.i
[2025-04-28 21:21:50,773 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATbb11.i
[2025-04-28 21:21:50,773 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure main.ATentry given in one single declaration
[2025-04-28 21:21:50,773 INFO  L130     BoogieDeclarations]: Found specification of procedure main.ATentry
[2025-04-28 21:21:50,773 INFO  L138     BoogieDeclarations]: Found implementation of procedure main.ATentry
[2025-04-28 21:21:50,773 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:50,773 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:50,773 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:50,840 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:50,842 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:51,036 INFO  L?                        ?]: Removed 77 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:51,036 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:51,054 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:51,057 INFO  L312             CfgBuilder]: Removed 2 assume(true) statements.
[2025-04-28 21:21:51,057 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:51 BoogieIcfgContainer
[2025-04-28 21:21:51,058 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:51,060 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:51,061 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:51,065 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:51,066 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:50" (1/3) ...
[2025-04-28 21:21:51,067 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b40f0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction OTHER 28.04 09:21:51, skipping insertion in model container
[2025-04-28 21:21:51,067 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:50" (2/3) ...
[2025-04-28 21:21:51,067 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b40f0d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:21:51, skipping insertion in model container
[2025-04-28 21:21:51,067 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:21:51" (3/3) ...
[2025-04-28 21:21:51,069 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:51,087 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:51,090 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 7 procedures, 29 locations, 43 edges, 7 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:51,141 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:51,156 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;@489145cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:51,156 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:51,161 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 29 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 16 states have internal predecessors, (16), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9)
[2025-04-28 21:21:51,170 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2025-04-28 21:21:51,170 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:51,171 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]
[2025-04-28 21:21:51,171 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:51,177 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:51,178 INFO  L85        PathProgramCache]: Analyzing trace with hash -357641585, now seen corresponding path program 1 times
[2025-04-28 21:21:51,188 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:51,189 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746624421]
[2025-04-28 21:21:51,189 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:51,190 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:51,232 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes.
[2025-04-28 21:21:51,297 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements.
[2025-04-28 21:21:51,299 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:51,300 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:51,733 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-28 21:21:51,733 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:51,733 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746624421]
[2025-04-28 21:21:51,734 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746624421] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:51,734 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:51,737 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-04-28 21:21:51,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248094897]
[2025-04-28 21:21:51,739 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:51,745 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-04-28 21:21:51,745 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:51,778 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-04-28 21:21:51,779 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-04-28 21:21:51,781 INFO  L87              Difference]: Start difference. First operand  has 29 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 16 states have internal predecessors, (16), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) Second operand  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:51,929 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:51,930 INFO  L93              Difference]: Finished difference Result 31 states and 37 transitions.
[2025-04-28 21:21:51,932 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-04-28 21:21:51,933 INFO  L79                 Accepts]: Start accepts. Automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 23
[2025-04-28 21:21:51,934 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:51,943 INFO  L225             Difference]: With dead ends: 31
[2025-04-28 21:21:51,943 INFO  L226             Difference]: Without dead ends: 31
[2025-04-28 21:21:51,946 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,951 INFO  L437           NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:51,954 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 77 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:51,983 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 31 states.
[2025-04-28 21:21:52,008 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29.
[2025-04-28 21:21:52,013 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 29 states, 12 states have (on average 1.25) internal successors, (15), 15 states have internal predecessors, (15), 9 states have call successors, (9), 6 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 9 states have call successors, (10)
[2025-04-28 21:21:52,028 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions.
[2025-04-28 21:21:52,029 INFO  L79                 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 23
[2025-04-28 21:21:52,029 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:52,030 INFO  L485      AbstractCegarLoop]: Abstraction has 29 states and 34 transitions.
[2025-04-28 21:21:52,030 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6)
[2025-04-28 21:21:52,030 INFO  L278                IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions.
[2025-04-28 21:21:52,033 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 28
[2025-04-28 21:21:52,033 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:52,034 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]
[2025-04-28 21:21:52,034 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:52,034 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:52,035 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:52,036 INFO  L85        PathProgramCache]: Analyzing trace with hash 307848890, now seen corresponding path program 1 times
[2025-04-28 21:21:52,036 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:52,036 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631026870]
[2025-04-28 21:21:52,036 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:52,036 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:52,067 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes.
[2025-04-28 21:21:52,122 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements.
[2025-04-28 21:21:52,125 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:52,128 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:52,511 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:52,511 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:52,511 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631026870]
[2025-04-28 21:21:52,511 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631026870] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:52,512 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:52,512 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:52,512 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134575082]
[2025-04-28 21:21:52,512 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:52,513 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:52,516 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:52,517 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:52,518 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:52,518 INFO  L87              Difference]: Start difference. First operand 29 states and 34 transitions. Second operand  has 6 states, 4 states have (on average 3.0) internal successors, (12), 6 states have internal predecessors, (12), 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:52,620 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:52,620 INFO  L93              Difference]: Finished difference Result 35 states and 42 transitions.
[2025-04-28 21:21:52,620 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:52,621 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 4 states have (on average 3.0) internal successors, (12), 6 states have internal predecessors, (12), 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:52,621 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:52,622 INFO  L225             Difference]: With dead ends: 35
[2025-04-28 21:21:52,622 INFO  L226             Difference]: Without dead ends: 35
[2025-04-28 21:21:52,622 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-04-28 21:21:52,623 INFO  L437           NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:52,624 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 130 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:52,624 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 35 states.
[2025-04-28 21:21:52,629 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33.
[2025-04-28 21:21:52,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 17 states have internal predecessors, (17), 9 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (13), 9 states have call predecessors, (13), 9 states have call successors, (13)
[2025-04-28 21:21:52,632 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions.
[2025-04-28 21:21:52,632 INFO  L79                 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 27
[2025-04-28 21:21:52,633 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:52,633 INFO  L485      AbstractCegarLoop]: Abstraction has 33 states and 39 transitions.
[2025-04-28 21:21:52,633 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 4 states have (on average 3.0) internal successors, (12), 6 states have internal predecessors, (12), 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:52,634 INFO  L278                IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions.
[2025-04-28 21:21:52,635 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2025-04-28 21:21:52,636 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:52,637 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]
[2025-04-28 21:21:52,637 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:52,637 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:52,638 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:52,639 INFO  L85        PathProgramCache]: Analyzing trace with hash -1615876710, now seen corresponding path program 1 times
[2025-04-28 21:21:52,639 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:52,639 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490200321]
[2025-04-28 21:21:52,639 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:52,639 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:52,661 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-04-28 21:21:52,695 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-04-28 21:21:52,696 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:52,696 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:53,188 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:53,189 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:53,189 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490200321]
[2025-04-28 21:21:53,189 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490200321] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:53,189 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:53,190 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-28 21:21:53,190 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073378749]
[2025-04-28 21:21:53,190 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:53,190 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-04-28 21:21:53,190 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:53,191 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-04-28 21:21:53,192 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-04-28 21:21:53,192 INFO  L87              Difference]: Start difference. First operand 33 states and 39 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:53,378 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:53,378 INFO  L93              Difference]: Finished difference Result 37 states and 44 transitions.
[2025-04-28 21:21:53,379 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-28 21:21:53,379 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:53,379 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:53,380 INFO  L225             Difference]: With dead ends: 37
[2025-04-28 21:21:53,380 INFO  L226             Difference]: Without dead ends: 33
[2025-04-28 21:21:53,380 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110
[2025-04-28 21:21:53,381 INFO  L437           NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:53,382 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 175 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-04-28 21:21:53,383 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 33 states.
[2025-04-28 21:21:53,387 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31.
[2025-04-28 21:21:53,387 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 16 states have internal predecessors, (16), 9 states have call successors, (9), 6 states have call predecessors, (9), 8 states have return successors, (11), 8 states have call predecessors, (11), 9 states have call successors, (11)
[2025-04-28 21:21:53,388 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions.
[2025-04-28 21:21:53,388 INFO  L79                 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 31
[2025-04-28 21:21:53,389 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:53,389 INFO  L485      AbstractCegarLoop]: Abstraction has 31 states and 36 transitions.
[2025-04-28 21:21:53,389 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:53,389 INFO  L278                IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions.
[2025-04-28 21:21:53,390 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 32
[2025-04-28 21:21:53,390 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:53,390 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]
[2025-04-28 21:21:53,391 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:53,391 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:53,391 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:53,392 INFO  L85        PathProgramCache]: Analyzing trace with hash 1523889007, now seen corresponding path program 1 times
[2025-04-28 21:21:53,392 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:53,392 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890140023]
[2025-04-28 21:21:53,392 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:53,392 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:53,405 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-04-28 21:21:53,455 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-04-28 21:21:53,455 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:53,455 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:54,804 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:54,805 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:54,805 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890140023]
[2025-04-28 21:21:54,805 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890140023] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:54,806 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460573982]
[2025-04-28 21:21:54,806 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:54,806 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:54,809 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:54,811 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:54,815 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:54,892 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes.
[2025-04-28 21:21:54,946 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements.
[2025-04-28 21:21:54,946 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:54,947 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:54,957 INFO  L256         TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 79 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:54,972 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:55,430 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1
[2025-04-28 21:21:55,729 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:21:55,730 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:01,413 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1
[2025-04-28 21:22:02,546 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1
[2025-04-28 21:22:03,061 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1
[2025-04-28 21:22:03,370 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1
[2025-04-28 21:22:03,605 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-04-28 21:22:03,605 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [460573982] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:03,605 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:03,605 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24
[2025-04-28 21:22:03,605 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434583217]
[2025-04-28 21:22:03,605 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:03,606 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2025-04-28 21:22:03,606 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:03,607 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2025-04-28 21:22:03,607 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552
[2025-04-28 21:22:03,608 INFO  L87              Difference]: Start difference. First operand 31 states and 36 transitions. Second operand  has 24 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 24 states have internal predecessors, (28), 15 states have call successors, (16), 1 states have call predecessors, (16), 12 states have return successors, (19), 11 states have call predecessors, (19), 15 states have call successors, (19)
[2025-04-28 21:22:04,039 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:04,039 INFO  L93              Difference]: Finished difference Result 45 states and 54 transitions.
[2025-04-28 21:22:04,043 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2025-04-28 21:22:04,043 INFO  L79                 Accepts]: Start accepts. Automaton has  has 24 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 24 states have internal predecessors, (28), 15 states have call successors, (16), 1 states have call predecessors, (16), 12 states have return successors, (19), 11 states have call predecessors, (19), 15 states have call successors, (19) Word has length 31
[2025-04-28 21:22:04,044 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:04,045 INFO  L225             Difference]: With dead ends: 45
[2025-04-28 21:22:04,045 INFO  L226             Difference]: Without dead ends: 45
[2025-04-28 21:22:04,045 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870
[2025-04-28 21:22:04,046 INFO  L437           NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:04,047 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 402 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:22:04,048 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 45 states.
[2025-04-28 21:22:04,053 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39.
[2025-04-28 21:22:04,054 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 9 states have call successors, (9), 6 states have call predecessors, (9), 12 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17)
[2025-04-28 21:22:04,055 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions.
[2025-04-28 21:22:04,055 INFO  L79                 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 31
[2025-04-28 21:22:04,055 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:04,055 INFO  L485      AbstractCegarLoop]: Abstraction has 39 states and 46 transitions.
[2025-04-28 21:22:04,056 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 24 states have internal predecessors, (28), 15 states have call successors, (16), 1 states have call predecessors, (16), 12 states have return successors, (19), 11 states have call predecessors, (19), 15 states have call successors, (19)
[2025-04-28 21:22:04,056 INFO  L278                IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions.
[2025-04-28 21:22:04,057 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2025-04-28 21:22:04,057 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:04,057 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]
[2025-04-28 21:22:04,063 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:22:04,262 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:04,262 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:04,263 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:04,263 INFO  L85        PathProgramCache]: Analyzing trace with hash -942634609, now seen corresponding path program 1 times
[2025-04-28 21:22:04,263 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:04,263 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389406106]
[2025-04-28 21:22:04,263 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:04,263 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:04,274 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-04-28 21:22:04,289 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-04-28 21:22:04,289 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:04,289 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:04,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:22:04,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:04,643 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389406106]
[2025-04-28 21:22:04,643 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389406106] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:04,643 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321113042]
[2025-04-28 21:22:04,643 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:22:04,644 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:04,646 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:04,649 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:22:04,653 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-04-28 21:22:04,762 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes.
[2025-04-28 21:22:04,802 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements.
[2025-04-28 21:22:04,803 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:22:04,803 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:04,805 INFO  L256         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 46 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:04,808 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:05,182 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:22:05,182 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:11,101 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:22:11,102 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [321113042] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:22:11,102 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:22:11,102 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 14] total 28
[2025-04-28 21:22:11,102 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453531324]
[2025-04-28 21:22:11,102 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:22:11,103 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 28 states
[2025-04-28 21:22:11,103 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:22:11,104 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants.
[2025-04-28 21:22:11,104 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756
[2025-04-28 21:22:11,105 INFO  L87              Difference]: Start difference. First operand 39 states and 46 transitions. Second operand  has 28 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 28 states have internal predecessors, (36), 18 states have call successors, (21), 1 states have call predecessors, (21), 14 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23)
[2025-04-28 21:22:11,509 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:22:11,509 INFO  L93              Difference]: Finished difference Result 51 states and 62 transitions.
[2025-04-28 21:22:11,510 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-04-28 21:22:11,510 INFO  L79                 Accepts]: Start accepts. Automaton has  has 28 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 28 states have internal predecessors, (36), 18 states have call successors, (21), 1 states have call predecessors, (21), 14 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23) Word has length 35
[2025-04-28 21:22:11,512 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:22:11,513 INFO  L225             Difference]: With dead ends: 51
[2025-04-28 21:22:11,515 INFO  L226             Difference]: Without dead ends: 47
[2025-04-28 21:22:11,516 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260
[2025-04-28 21:22:11,517 INFO  L437           NwaCegarLoop]: 29 mSDtfsCounter, 15 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-28 21:22:11,517 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 435 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-28 21:22:11,521 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 47 states.
[2025-04-28 21:22:11,529 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45.
[2025-04-28 21:22:11,529 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 45 states, 20 states have (on average 1.15) internal successors, (23), 23 states have internal predecessors, (23), 9 states have call successors, (9), 6 states have call predecessors, (9), 15 states have return successors, (21), 15 states have call predecessors, (21), 9 states have call successors, (21)
[2025-04-28 21:22:11,530 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions.
[2025-04-28 21:22:11,531 INFO  L79                 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 35
[2025-04-28 21:22:11,531 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:22:11,531 INFO  L485      AbstractCegarLoop]: Abstraction has 45 states and 53 transitions.
[2025-04-28 21:22:11,531 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 28 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 28 states have internal predecessors, (36), 18 states have call successors, (21), 1 states have call predecessors, (21), 14 states have return successors, (23), 14 states have call predecessors, (23), 18 states have call successors, (23)
[2025-04-28 21:22:11,531 INFO  L278                IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions.
[2025-04-28 21:22:11,533 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 36
[2025-04-28 21:22:11,533 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:22:11,533 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 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]
[2025-04-28 21:22:11,539 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-04-28 21:22:11,733 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:11,734 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:22:11,734 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:22:11,735 INFO  L85        PathProgramCache]: Analyzing trace with hash 740973722, now seen corresponding path program 2 times
[2025-04-28 21:22:11,735 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:22:11,735 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482461674]
[2025-04-28 21:22:11,735 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:22:11,735 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:22:11,746 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes.
[2025-04-28 21:22:11,786 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements.
[2025-04-28 21:22:11,787 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:22:11,787 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:12,729 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:22:12,730 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:22:12,731 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482461674]
[2025-04-28 21:22:12,731 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482461674] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:22:12,731 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035047603]
[2025-04-28 21:22:12,731 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-28 21:22:12,731 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:22:12,735 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:22:12,738 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:22:12,743 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-04-28 21:22:12,910 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes.
[2025-04-28 21:22:12,954 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 35 of 35 statements.
[2025-04-28 21:22:12,954 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2025-04-28 21:22:12,954 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:22:12,957 INFO  L256         TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 86 conjuncts are in the unsatisfiable core
[2025-04-28 21:22:12,961 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:22:13,159 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1
[2025-04-28 21:22:13,201 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1
[2025-04-28 21:22:13,316 INFO  L134       CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-04-28 21:22:13,316 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:22:20,138 INFO  L325             Elim1Store]: treesize reduction 13, result has 7.1 percent of original size
[2025-04-28 21:22:20,139 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 22
[2025-04-28 21:22:21,483 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:22:21,486 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:22:21,488 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 5
[2025-04-28 21:22:22,343 INFO  L172   IndexEqualityManager]: detected equality via solver
[2025-04-28 21:22:22,346 INFO  L354             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1
