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


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


This is Ultimate 0.3.0-dev-42d8767-m
[2025-04-28 21:21:22,214 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-28 21:21:22,317 INFO  L114        SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bdadc1-7c5f-4182-af44-7245fa53c5a7/chc-comp25-scripts/participants/UltimateUnihorn/./chccomp-Unihorn_Default.epf
[2025-04-28 21:21:22,324 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-28 21:21:22,325 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-28 21:21:22,361 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-28 21:21:22,362 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-28 21:21:22,363 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-28 21:21:22,363 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-28 21:21:22,365 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-28 21:21:22,365 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-28 21:21:22,366 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-28 21:21:22,366 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-28 21:21:22,367 INFO  L151        SettingsManager]: Preferences of ChcToBoogie differ from their defaults:
[2025-04-28 21:21:22,367 INFO  L153        SettingsManager]:  * Use one large procedure with gotos to replace tail recursive calls=false
[2025-04-28 21:21:22,367 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-28 21:21:22,367 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-28 21:21:22,367 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-28 21:21:22,367 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:22,367 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-28 21:21:22,368 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-28 21:21:22,368 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-28 21:21:22,368 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-28 21:21:22,368 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-28 21:21:22,368 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-28 21:21:22,369 INFO  L151        SettingsManager]: Preferences of SmtParser differ from their defaults:
[2025-04-28 21:21:22,369 INFO  L153        SettingsManager]:  * SmtParser Mode=UltimateTreeAutomizer
[2025-04-28 21:21:22,713 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-28 21:21:22,724 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-28 21:21:22,727 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-28 21:21:22,728 INFO  L270        PluginConnector]: Initializing SmtParser...
[2025-04-28 21:21:22,729 INFO  L274        PluginConnector]: SmtParser initialized
[2025-04-28 21:21:22,730 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bdadc1-7c5f-4182-af44-7245fa53c5a7/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-183.smt2
[2025-04-28 21:21:22,732 INFO  L314              SmtParser]: Parsing .smt2 file as a set of Horn Clauses
[2025-04-28 21:21:22,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:23,844 INFO  L339              SmtParser]: Successfully executed SMT file /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e0bdadc1-7c5f-4182-af44-7245fa53c5a7/chc-comp25-scripts/participants/UltimateUnihorn/../../../chc-comp24-benchmarks/LIA/chc-comp24-LIA-183.smt2
[2025-04-28 21:21:23,849 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-28 21:21:23,852 INFO  L133        ToolchainWalker]: Walking toolchain with 4 elements.
[2025-04-28 21:21:23,853 INFO  L112        PluginConnector]: ------------------------ChcToBoogie----------------------------
[2025-04-28 21:21:23,853 INFO  L270        PluginConnector]: Initializing ChcToBoogie...
[2025-04-28 21:21:23,853 INFO  L274        PluginConnector]: ChcToBoogie initialized
[2025-04-28 21:21:23,856 INFO  L184        PluginConnector]: Executing the observer ChcToBoogieObserver from plugin ChcToBoogie for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:23,934 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23 Unit
[2025-04-28 21:21:23,934 INFO  L131        PluginConnector]: ------------------------ END ChcToBoogie----------------------------
[2025-04-28 21:21:23,937 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-28 21:21:23,937 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-28 21:21:23,937 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-28 21:21:23,954 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:23,954 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:23,986 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:23,986 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:24,011 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:24,014 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:24,020 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:24,027 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:24,037 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:24,078 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-28 21:21:24,079 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-28 21:21:24,079 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-28 21:21:24,080 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-28 21:21:24,081 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (1/1) ...
[2025-04-28 21:21:24,083 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2025-04-28 21:21:24,100 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:24,115 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:24,119 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:24,131 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure False given in one single declaration
[2025-04-28 21:21:24,131 INFO  L130     BoogieDeclarations]: Found specification of procedure False
[2025-04-28 21:21:24,131 INFO  L138     BoogieDeclarations]: Found implementation of procedure False
[2025-04-28 21:21:24,131 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure CHC_COMP_FALSE given in one single declaration
[2025-04-28 21:21:24,131 INFO  L130     BoogieDeclarations]: Found specification of procedure CHC_COMP_FALSE
[2025-04-28 21:21:24,131 INFO  L138     BoogieDeclarations]: Found implementation of procedure CHC_COMP_FALSE
[2025-04-28 21:21:24,131 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure step_lturn given in one single declaration
[2025-04-28 21:21:24,132 INFO  L130     BoogieDeclarations]: Found specification of procedure step_lturn
[2025-04-28 21:21:24,132 INFO  L138     BoogieDeclarations]: Found implementation of procedure step_lturn
[2025-04-28 21:21:24,132 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure combined_lturn given in one single declaration
[2025-04-28 21:21:24,132 INFO  L130     BoogieDeclarations]: Found specification of procedure combined_lturn
[2025-04-28 21:21:24,132 INFO  L138     BoogieDeclarations]: Found implementation of procedure combined_lturn
[2025-04-28 21:21:24,132 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure lturn given in one single declaration
[2025-04-28 21:21:24,132 INFO  L130     BoogieDeclarations]: Found specification of procedure lturn
[2025-04-28 21:21:24,133 INFO  L138     BoogieDeclarations]: Found implementation of procedure lturn
[2025-04-28 21:21:24,133 INFO  L124     BoogieDeclarations]: Specification and implementation of procedure Ultimate.START given in one single declaration
[2025-04-28 21:21:24,133 INFO  L130     BoogieDeclarations]: Found specification of procedure Ultimate.START
[2025-04-28 21:21:24,133 INFO  L138     BoogieDeclarations]: Found implementation of procedure Ultimate.START
[2025-04-28 21:21:24,204 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-28 21:21:24,206 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-28 21:21:25,875 INFO  L?                        ?]: Removed 0 outVars from TransFormulas that were not future-live.
[2025-04-28 21:21:25,876 INFO  L283             CfgBuilder]: Performing block encoding
[2025-04-28 21:21:25,900 INFO  L304             CfgBuilder]: Using library mode
[2025-04-28 21:21:25,902 INFO  L312             CfgBuilder]: Removed 7 assume(true) statements.
[2025-04-28 21:21:25,905 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,905 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-28 21:21:25,908 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-28 21:21:25,908 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-28 21:21:25,918 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-28 21:21:25,918 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.source.smtparser OTHER 28.04 09:21:23" (1/3) ...
[2025-04-28 21:21:25,919 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fc8362 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,919 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.chctoboogie AST 28.04 09:21:23" (2/3) ...
[2025-04-28 21:21:25,919 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45fc8362 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,920 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,922 INFO  L128   eAbstractionObserver]: Analyzing ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver
[2025-04-28 21:21:25,939 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-28 21:21:25,943 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG de.uni_freiburg.informatik.ultimate.plugins.chctoboogie.ChcToBoogieObserver that has 6 procedures, 142 locations, 432 edges, 6 initial locations, 0 loop locations, and 1 error locations.
[2025-04-28 21:21:26,010 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-28 21:21:26,034 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;@463d9901, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-28 21:21:26,035 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-04-28 21:21:26,041 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 142 states, 10 states have (on average 4.2) internal successors, (42), 36 states have internal predecessors, (42), 128 states have call successors, (130), 5 states have call predecessors, (130), 5 states have return successors, (130), 102 states have call predecessors, (130), 128 states have call successors, (130)
[2025-04-28 21:21:26,082 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2025-04-28 21:21:26,086 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:26,087 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:26,088 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:26,095 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:26,096 INFO  L85        PathProgramCache]: Analyzing trace with hash 1512433606, now seen corresponding path program 1 times
[2025-04-28 21:21:26,105 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:26,106 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399768201]
[2025-04-28 21:21:26,106 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:26,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:26,175 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes.
[2025-04-28 21:21:26,522 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements.
[2025-04-28 21:21:26,523 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:26,523 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:27,545 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:27,546 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:27,546 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399768201]
[2025-04-28 21:21:27,547 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399768201] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:27,547 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:27,551 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:27,552 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282326865]
[2025-04-28 21:21:27,554 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:27,560 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:27,561 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:27,635 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:27,636 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:27,642 INFO  L87              Difference]: Start difference. First operand  has 142 states, 10 states have (on average 4.2) internal successors, (42), 36 states have internal predecessors, (42), 128 states have call successors, (130), 5 states have call predecessors, (130), 5 states have return successors, (130), 102 states have call predecessors, (130), 128 states have call successors, (130) Second operand  has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:29,978 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:29,979 INFO  L93              Difference]: Finished difference Result 198 states and 576 transitions.
[2025-04-28 21:21:29,981 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:29,984 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 18
[2025-04-28 21:21:29,984 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:30,016 INFO  L225             Difference]: With dead ends: 198
[2025-04-28 21:21:30,017 INFO  L226             Difference]: Without dead ends: 198
[2025-04-28 21:21:30,019 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:30,026 INFO  L437           NwaCegarLoop]: 278 mSDtfsCounter, 10 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:30,027 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1205 Invalid, 963 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-04-28 21:21:30,053 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 198 states.
[2025-04-28 21:21:30,296 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196.
[2025-04-28 21:21:30,297 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 196 states, 13 states have (on average 4.076923076923077) internal successors, (53), 46 states have internal predecessors, (53), 178 states have call successors, (181), 7 states have call predecessors, (181), 8 states have return successors, (340), 145 states have call predecessors, (340), 178 states have call successors, (340)
[2025-04-28 21:21:30,312 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 574 transitions.
[2025-04-28 21:21:30,314 INFO  L79                 Accepts]: Start accepts. Automaton has 196 states and 574 transitions. Word has length 18
[2025-04-28 21:21:30,316 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:30,316 INFO  L485      AbstractCegarLoop]: Abstraction has 196 states and 574 transitions.
[2025-04-28 21:21:30,316 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:30,316 INFO  L278                IsEmpty]: Start isEmpty. Operand 196 states and 574 transitions.
[2025-04-28 21:21:30,326 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2025-04-28 21:21:30,329 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:30,329 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:30,330 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-28 21:21:30,330 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:30,330 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:30,331 INFO  L85        PathProgramCache]: Analyzing trace with hash 1034417154, now seen corresponding path program 1 times
[2025-04-28 21:21:30,331 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:30,331 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440854]
[2025-04-28 21:21:30,331 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:30,331 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:30,358 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes.
[2025-04-28 21:21:30,426 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements.
[2025-04-28 21:21:30,426 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:30,426 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:30,947 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:30,947 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:30,948 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440854]
[2025-04-28 21:21:30,948 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440854] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:30,948 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:30,948 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:30,948 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159216744]
[2025-04-28 21:21:30,948 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:30,950 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:30,950 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:30,951 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:30,953 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:30,954 INFO  L87              Difference]: Start difference. First operand 196 states and 574 transitions. Second operand  has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:32,980 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:32,980 INFO  L93              Difference]: Finished difference Result 290 states and 1186 transitions.
[2025-04-28 21:21:32,981 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:32,981 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 18
[2025-04-28 21:21:32,982 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:32,996 INFO  L225             Difference]: With dead ends: 290
[2025-04-28 21:21:32,996 INFO  L226             Difference]: Without dead ends: 290
[2025-04-28 21:21:32,996 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:32,997 INFO  L437           NwaCegarLoop]: 294 mSDtfsCounter, 10 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:32,998 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1261 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-04-28 21:21:32,999 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 290 states.
[2025-04-28 21:21:33,158 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288.
[2025-04-28 21:21:33,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 288 states, 20 states have (on average 3.95) internal successors, (79), 68 states have internal predecessors, (79), 260 states have call successors, (265), 11 states have call predecessors, (265), 13 states have return successors, (840), 212 states have call predecessors, (840), 260 states have call successors, (840)
[2025-04-28 21:21:33,169 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 1184 transitions.
[2025-04-28 21:21:33,169 INFO  L79                 Accepts]: Start accepts. Automaton has 288 states and 1184 transitions. Word has length 18
[2025-04-28 21:21:33,170 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:33,170 INFO  L485      AbstractCegarLoop]: Abstraction has 288 states and 1184 transitions.
[2025-04-28 21:21:33,170 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:33,170 INFO  L278                IsEmpty]: Start isEmpty. Operand 288 states and 1184 transitions.
[2025-04-28 21:21:33,180 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2025-04-28 21:21:33,180 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:33,180 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:33,180 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-28 21:21:33,181 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:33,182 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:33,182 INFO  L85        PathProgramCache]: Analyzing trace with hash 248363134, now seen corresponding path program 1 times
[2025-04-28 21:21:33,182 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:33,182 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615318449]
[2025-04-28 21:21:33,183 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:33,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:33,202 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes.
[2025-04-28 21:21:33,234 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements.
[2025-04-28 21:21:33,234 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:33,234 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:33,618 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:33,618 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:33,618 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615318449]
[2025-04-28 21:21:33,619 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615318449] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:33,619 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:33,620 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:33,620 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822989972]
[2025-04-28 21:21:33,620 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:33,620 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:33,620 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:33,621 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:33,621 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:33,621 INFO  L87              Difference]: Start difference. First operand 288 states and 1184 transitions. Second operand  has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:35,373 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:35,373 INFO  L93              Difference]: Finished difference Result 429 states and 2766 transitions.
[2025-04-28 21:21:35,374 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-04-28 21:21:35,374 INFO  L79                 Accepts]: Start accepts. Automaton has  has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 18
[2025-04-28 21:21:35,374 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:35,399 INFO  L225             Difference]: With dead ends: 429
[2025-04-28 21:21:35,399 INFO  L226             Difference]: Without dead ends: 429
[2025-04-28 21:21:35,399 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:35,400 INFO  L437           NwaCegarLoop]: 308 mSDtfsCounter, 9 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:35,401 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1332 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-04-28 21:21:35,402 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 429 states.
[2025-04-28 21:21:35,873 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 427.
[2025-04-28 21:21:35,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 427 states, 33 states have (on average 3.515151515151515) internal successors, (116), 96 states have internal predecessors, (116), 377 states have call successors, (384), 15 states have call predecessors, (384), 24 states have return successors, (2264), 319 states have call predecessors, (2264), 377 states have call successors, (2264)
[2025-04-28 21:21:35,894 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 2764 transitions.
[2025-04-28 21:21:35,895 INFO  L79                 Accepts]: Start accepts. Automaton has 427 states and 2764 transitions. Word has length 18
[2025-04-28 21:21:35,895 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:35,895 INFO  L485      AbstractCegarLoop]: Abstraction has 427 states and 2764 transitions.
[2025-04-28 21:21:35,895 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5)
[2025-04-28 21:21:35,895 INFO  L278                IsEmpty]: Start isEmpty. Operand 427 states and 2764 transitions.
[2025-04-28 21:21:35,904 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2025-04-28 21:21:35,904 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:35,904 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:35,904 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-28 21:21:35,905 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:35,907 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:35,907 INFO  L85        PathProgramCache]: Analyzing trace with hash -1046600411, now seen corresponding path program 1 times
[2025-04-28 21:21:35,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:35,907 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770606320]
[2025-04-28 21:21:35,908 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:35,908 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:35,929 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes.
[2025-04-28 21:21:35,959 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements.
[2025-04-28 21:21:35,960 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:35,960 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:36,345 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:36,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:36,346 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770606320]
[2025-04-28 21:21:36,346 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770606320] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:36,346 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:36,346 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-28 21:21:36,346 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175058895]
[2025-04-28 21:21:36,346 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:36,346 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-04-28 21:21:36,347 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:36,347 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-04-28 21:21:36,347 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:36,347 INFO  L87              Difference]: Start difference. First operand 427 states and 2764 transitions. Second operand  has 5 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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:37,683 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:37,683 INFO  L93              Difference]: Finished difference Result 515 states and 3934 transitions.
[2025-04-28 21:21:37,684 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-04-28 21:21:37,684 INFO  L79                 Accepts]: Start accepts. Automaton has  has 5 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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 18
[2025-04-28 21:21:37,684 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:37,717 INFO  L225             Difference]: With dead ends: 515
[2025-04-28 21:21:37,717 INFO  L226             Difference]: Without dead ends: 515
[2025-04-28 21:21:37,717 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-04-28 21:21:37,719 INFO  L437           NwaCegarLoop]: 302 mSDtfsCounter, 9 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:37,719 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1021 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-04-28 21:21:37,720 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 515 states.
[2025-04-28 21:21:38,338 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 511.
[2025-04-28 21:21:38,342 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 511 states, 45 states have (on average 3.022222222222222) internal successors, (136), 115 states have internal predecessors, (136), 439 states have call successors, (447), 17 states have call predecessors, (447), 35 states have return successors, (3328), 382 states have call predecessors, (3328), 439 states have call successors, (3328)
[2025-04-28 21:21:38,364 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 3911 transitions.
[2025-04-28 21:21:38,364 INFO  L79                 Accepts]: Start accepts. Automaton has 511 states and 3911 transitions. Word has length 18
[2025-04-28 21:21:38,365 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:38,365 INFO  L485      AbstractCegarLoop]: Abstraction has 511 states and 3911 transitions.
[2025-04-28 21:21:38,365 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 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:38,365 INFO  L278                IsEmpty]: Start isEmpty. Operand 511 states and 3911 transitions.
[2025-04-28 21:21:38,380 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2025-04-28 21:21:38,380 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:38,381 INFO  L218           NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:38,381 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-28 21:21:38,381 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:38,382 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:38,382 INFO  L85        PathProgramCache]: Analyzing trace with hash 497057919, now seen corresponding path program 1 times
[2025-04-28 21:21:38,382 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:38,382 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542856274]
[2025-04-28 21:21:38,383 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:38,383 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:38,403 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-04-28 21:21:38,435 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:38,435 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:38,435 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,048 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2025-04-28 21:21:39,048 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:39,049 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542856274]
[2025-04-28 21:21:39,049 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542856274] provided 0 perfect and 1 imperfect interpolant sequences
[2025-04-28 21:21:39,049 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090278476]
[2025-04-28 21:21:39,049 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:39,049 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-04-28 21:21:39,053 INFO  L189       MonitoredProcess]: No working directory specified, using /usr/bin/z3
[2025-04-28 21:21:39,058 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:39,061 INFO  L327       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-04-28 21:21:39,131 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-04-28 21:21:39,275 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:39,275 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:39,275 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:39,286 INFO  L256         TraceCheckSpWp]: Trace formula consists of 875 conjuncts, 11 conjuncts are in the unsatisfiable core
[2025-04-28 21:21:39,294 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-04-28 21:21:39,454 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:21:39,454 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-04-28 21:21:40,104 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:21:40,104 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090278476] provided 0 perfect and 2 imperfect interpolant sequences
[2025-04-28 21:21:40,104 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-04-28 21:21:40,104 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13
[2025-04-28 21:21:40,105 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010791200]
[2025-04-28 21:21:40,105 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-04-28 21:21:40,105 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-28 21:21:40,105 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:40,105 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-28 21:21:40,106 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156
[2025-04-28 21:21:40,106 INFO  L87              Difference]: Start difference. First operand 511 states and 3911 transitions. Second operand  has 13 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (8), 1 states have call predecessors, (8), 9 states have return successors, (12), 8 states have call predecessors, (12), 4 states have call successors, (12)
[2025-04-28 21:21:47,606 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-28 21:21:47,607 INFO  L93              Difference]: Finished difference Result 1003 states and 12573 transitions.
[2025-04-28 21:21:47,607 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-04-28 21:21:47,607 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (8), 1 states have call predecessors, (8), 9 states have return successors, (12), 8 states have call predecessors, (12), 4 states have call successors, (12) Word has length 21
[2025-04-28 21:21:47,608 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-28 21:21:47,731 INFO  L225             Difference]: With dead ends: 1003
[2025-04-28 21:21:47,731 INFO  L226             Difference]: Without dead ends: 1003
[2025-04-28 21:21:47,731 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506
[2025-04-28 21:21:47,732 INFO  L437           NwaCegarLoop]: 419 mSDtfsCounter, 21 mSDsluCounter, 3119 mSDsCounter, 0 mSdLazyCounter, 5782 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 3538 SdHoareTripleChecker+Invalid, 5992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 5782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time
[2025-04-28 21:21:47,733 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 3538 Invalid, 5992 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [210 Valid, 5782 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time]
[2025-04-28 21:21:47,734 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1003 states.
[2025-04-28 21:21:50,142 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 984.
[2025-04-28 21:21:50,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 984 states, 99 states have (on average 2.1414141414141414) internal successors, (212), 190 states have internal predecessors, (212), 810 states have call successors, (820), 22 states have call predecessors, (820), 86 states have return successors, (11352), 775 states have call predecessors, (11352), 810 states have call successors, (11352)
[2025-04-28 21:21:50,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 12384 transitions.
[2025-04-28 21:21:50,226 INFO  L79                 Accepts]: Start accepts. Automaton has 984 states and 12384 transitions. Word has length 21
[2025-04-28 21:21:50,226 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-28 21:21:50,226 INFO  L485      AbstractCegarLoop]: Abstraction has 984 states and 12384 transitions.
[2025-04-28 21:21:50,227 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 4 states have call successors, (8), 1 states have call predecessors, (8), 9 states have return successors, (12), 8 states have call predecessors, (12), 4 states have call successors, (12)
[2025-04-28 21:21:50,227 INFO  L278                IsEmpty]: Start isEmpty. Operand 984 states and 12384 transitions.
[2025-04-28 21:21:50,262 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2025-04-28 21:21:50,262 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-28 21:21:50,262 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-28 21:21:50,269 INFO  L552       MonitoredProcess]: [MP /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-04-28 21:21:50,463 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /usr/bin/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5
[2025-04-28 21:21:50,463 INFO  L403      AbstractCegarLoop]: === Iteration 6 === Targeting Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY === [Ultimate.STARTErr0ASSERT_VIOLATIONCHC_SATISFIABILITY] ===
[2025-04-28 21:21:50,467 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-28 21:21:50,467 INFO  L85        PathProgramCache]: Analyzing trace with hash 905056314, now seen corresponding path program 1 times
[2025-04-28 21:21:50,467 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-28 21:21:50,468 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793126995]
[2025-04-28 21:21:50,468 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-28 21:21:50,468 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-28 21:21:50,486 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes.
[2025-04-28 21:21:50,518 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements.
[2025-04-28 21:21:50,519 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-28 21:21:50,519 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-28 21:21:50,999 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2025-04-28 21:21:50,999 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-28 21:21:50,999 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793126995]
[2025-04-28 21:21:51,000 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793126995] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-28 21:21:51,000 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-28 21:21:51,000 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-04-28 21:21:51,000 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454037010]
[2025-04-28 21:21:51,000 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-28 21:21:51,000 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-04-28 21:21:51,001 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-28 21:21:51,001 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-04-28 21:21:51,001 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-04-28 21:21:51,001 INFO  L87              Difference]: Start difference. First operand 984 states and 12384 transitions. Second operand  has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6)
