/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dec-subseq.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:07,803 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:07,853 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:23:07,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:07,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:07,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:07,881 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:07,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:07,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:07,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:07,884 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:07,884 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:07,884 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:07,884 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:07,884 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:07,885 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:07,885 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:07,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:07,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:07,885 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:07,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:07,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:07,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:07,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:07,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:07,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:07,885 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:07,885 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:07,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:07,885 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:07,886 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:07,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:07,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:07,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:07,886 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:07,886 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:07,886 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:08,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:08,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:08,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:08,125 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:08,126 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:08,130 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dec-subseq.wvr.bpl [2025-04-26 16:23:08,130 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dec-subseq.wvr.bpl' [2025-04-26 16:23:08,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:08,156 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:08,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:08,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:08,157 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:08,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:08" (1/1) ... [2025-04-26 16:23:08,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:08" (1/1) ... [2025-04-26 16:23:08,193 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:08,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:08,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:08,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:08,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:08,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:08" (1/1) ... [2025-04-26 16:23:08,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:08" (1/1) ... [2025-04-26 16:23:08,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:08" (1/1) ... [2025-04-26 16:23:08,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:08" (1/1) ... [2025-04-26 16:23:08,205 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:08" (1/1) ... [2025-04-26 16:23:08,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:08" (1/1) ... [2025-04-26 16:23:08,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:08" (1/1) ... [2025-04-26 16:23:08,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:08" (1/1) ... [2025-04-26 16:23:08,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:08" (1/1) ... [2025-04-26 16:23:08,214 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:08,215 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:08,215 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:08,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:08,216 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:08" (1/1) ... [2025-04-26 16:23:08,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:08,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:08,239 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:08,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:23:08,263 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:08,263 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:08,263 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:08,263 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:08,263 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:08,264 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:08,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:08,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:08,264 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:23:08,300 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:08,301 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:08,384 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:08,384 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:08,403 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:08,403 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:08,404 INFO L201 PluginConnector]: Adding new model dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:08 BoogieIcfgContainer [2025-04-26 16:23:08,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:08,404 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:08,404 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:08,409 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:08,410 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:08,410 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:08" (1/2) ... [2025-04-26 16:23:08,411 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7617b444 and model type dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:23:08, skipping insertion in model container [2025-04-26 16:23:08,411 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:08,411 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:08" (2/2) ... [2025-04-26 16:23:08,413 INFO L376 chiAutomizerObserver]: Analyzing ICFG dec-subseq.wvr.bpl [2025-04-26 16:23:08,453 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:23:08,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 74 flow [2025-04-26 16:23:08,520 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-26 16:23:08,522 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:23:08,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 3/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2025-04-26 16:23:08,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 74 flow [2025-04-26 16:23:08,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 26 transitions, 64 flow [2025-04-26 16:23:08,531 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 26 transitions, 64 flow [2025-04-26 16:23:08,542 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:08,542 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:08,543 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:08,543 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:08,543 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:08,543 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:08,543 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:08,543 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:08,544 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:08,581 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 47 [2025-04-26 16:23:08,582 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:08,582 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:08,585 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:08,585 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:08,585 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:08,585 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 64 states, but on-demand construction may add more states [2025-04-26 16:23:08,588 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 47 [2025-04-26 16:23:08,588 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:08,588 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:08,589 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:08,589 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:08,595 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" [2025-04-26 16:23:08,595 INFO L754 eck$LassoCheckResult]: Loop: "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[72] L24-->L24-2: Formula: (< v_last_3 (select v_A_4 v_i_5)) InVars {A=v_A_4, last=v_last_3, i=v_i_5} OutVars{A=v_A_4, last=v_last_3, i=v_i_5} AuxVars[] AssignedVars[]" "[74] L24-2-->L23: Formula: (= v_i_6 (+ v_i_7 1)) InVars {i=v_i_7} OutVars{i=v_i_6} AuxVars[] AssignedVars[i]" [2025-04-26 16:23:08,600 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:08,601 INFO L85 PathProgramCache]: Analyzing trace with hash 88116564, now seen corresponding path program 1 times [2025-04-26 16:23:08,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:08,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897607840] [2025-04-26 16:23:08,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:08,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:08,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:08,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:08,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,668 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:08,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:08,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:08,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:08,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:08,691 INFO L85 PathProgramCache]: Analyzing trace with hash 98406, now seen corresponding path program 1 times [2025-04-26 16:23:08,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:08,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875098880] [2025-04-26 16:23:08,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:08,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:08,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:08,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:08,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,704 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:08,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:08,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:08,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:08,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:08,712 INFO L85 PathProgramCache]: Analyzing trace with hash 855608883, now seen corresponding path program 1 times [2025-04-26 16:23:08,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:08,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965532118] [2025-04-26 16:23:08,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:08,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:08,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:08,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:08,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:08,823 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-26 16:23:08,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:08,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965532118] [2025-04-26 16:23:08,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965532118] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:08,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:08,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:23:08,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629960890] [2025-04-26 16:23:08,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:08,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:08,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:23:08,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:23:08,877 INFO L87 Difference]: Start difference. First operand currently 64 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:08,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:08,977 INFO L93 Difference]: Finished difference Result 186 states and 372 transitions. [2025-04-26 16:23:08,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 372 transitions. [2025-04-26 16:23:09,017 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 127 [2025-04-26 16:23:09,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 159 states and 327 transitions. [2025-04-26 16:23:09,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 159 [2025-04-26 16:23:09,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 159 [2025-04-26 16:23:09,028 INFO L74 IsDeterministic]: Start isDeterministic. Operand 159 states and 327 transitions. [2025-04-26 16:23:09,029 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:09,030 INFO L218 hiAutomatonCegarLoop]: Abstraction has 159 states and 327 transitions. [2025-04-26 16:23:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states and 327 transitions. [2025-04-26 16:23:09,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 68. [2025-04-26 16:23:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.1029411764705883) internal successors, (in total 143), 67 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:09,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 143 transitions. [2025-04-26 16:23:09,097 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 143 transitions. [2025-04-26 16:23:09,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:23:09,102 INFO L438 stractBuchiCegarLoop]: Abstraction has 68 states and 143 transitions. [2025-04-26 16:23:09,102 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:09,102 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 143 transitions. [2025-04-26 16:23:09,106 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 55 [2025-04-26 16:23:09,106 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:09,106 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:09,106 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:09,106 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:09,107 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 16:23:09,107 INFO L754 eck$LassoCheckResult]: Loop: "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (or (not v_ok_2) (< v_v_old_1 v_new_2)) (not v_ok_1)) (and (<= v_new_2 v_v_old_1) v_ok_2 v_ok_1)) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" [2025-04-26 16:23:09,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1563353728, now seen corresponding path program 1 times [2025-04-26 16:23:09,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:09,108 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602058892] [2025-04-26 16:23:09,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:09,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:09,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:09,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:09,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,116 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:09,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:09,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:09,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:09,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,125 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 1 times [2025-04-26 16:23:09,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:09,125 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767081451] [2025-04-26 16:23:09,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:09,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:09,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:09,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:09,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,136 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:09,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:09,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:09,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:09,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1915392163, now seen corresponding path program 1 times [2025-04-26 16:23:09,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:09,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591190690] [2025-04-26 16:23:09,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:09,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:09,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:09,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:09,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:09,199 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-26 16:23:09,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:09,199 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591190690] [2025-04-26 16:23:09,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591190690] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:09,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:09,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:23:09,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497074927] [2025-04-26 16:23:09,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:09,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:09,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:23:09,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:23:09,327 INFO L87 Difference]: Start difference. First operand 68 states and 143 transitions. cyclomatic complexity: 84 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:09,346 INFO L93 Difference]: Finished difference Result 77 states and 150 transitions. [2025-04-26 16:23:09,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 150 transitions. [2025-04-26 16:23:09,349 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 47 [2025-04-26 16:23:09,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 69 states and 137 transitions. [2025-04-26 16:23:09,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2025-04-26 16:23:09,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2025-04-26 16:23:09,350 INFO L74 IsDeterministic]: Start isDeterministic. Operand 69 states and 137 transitions. [2025-04-26 16:23:09,350 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:09,350 INFO L218 hiAutomatonCegarLoop]: Abstraction has 69 states and 137 transitions. [2025-04-26 16:23:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 137 transitions. [2025-04-26 16:23:09,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2025-04-26 16:23:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.0) internal successors, (in total 134), 66 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:09,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 134 transitions. [2025-04-26 16:23:09,356 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 134 transitions. [2025-04-26 16:23:09,358 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:23:09,358 INFO L438 stractBuchiCegarLoop]: Abstraction has 67 states and 134 transitions. [2025-04-26 16:23:09,358 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:09,359 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 134 transitions. [2025-04-26 16:23:09,359 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 47 [2025-04-26 16:23:09,359 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:09,359 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:09,359 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:09,360 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:09,360 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= (select v_A_1 v_i_2) v_last_1) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" [2025-04-26 16:23:09,360 INFO L754 eck$LassoCheckResult]: Loop: "[75] L25-1-->L24-2: Formula: (= (select v_A_3 v_i_4) v_last_2) InVars {A=v_A_3, i=v_i_4} OutVars{A=v_A_3, last=v_last_2, i=v_i_4} AuxVars[] AssignedVars[last]" "[74] L24-2-->L23: Formula: (= v_i_6 (+ v_i_7 1)) InVars {i=v_i_7} OutVars{i=v_i_6} AuxVars[] AssignedVars[i]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= (select v_A_1 v_i_2) v_last_1) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" [2025-04-26 16:23:09,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,360 INFO L85 PathProgramCache]: Analyzing trace with hash 855608851, now seen corresponding path program 1 times [2025-04-26 16:23:09,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:09,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378557093] [2025-04-26 16:23:09,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:09,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:09,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:09,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:09,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,371 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:09,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:09,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:09,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:09,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,383 INFO L85 PathProgramCache]: Analyzing trace with hash 100166343, now seen corresponding path program 1 times [2025-04-26 16:23:09,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:09,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114183009] [2025-04-26 16:23:09,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:09,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:09,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:09,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:09,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,390 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:09,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:09,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:09,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:09,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1228462069, now seen corresponding path program 1 times [2025-04-26 16:23:09,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:09,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297121765] [2025-04-26 16:23:09,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:09,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:09,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:09,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:09,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,414 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:09,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:09,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:09,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:09,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:09,540 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:09,541 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:09,541 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:09,541 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:09,541 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:09,541 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,541 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:09,541 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:09,541 INFO L132 ssoRankerPreferences]: Filename of dumped script: dec-subseq.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:23:09,541 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:09,541 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:09,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,693 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:09,696 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:09,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:09,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:09,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:23:09,702 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:09,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:09,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:09,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:09,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:09,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:09,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:09,729 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:09,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:23:09,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:09,741 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:09,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:23:09,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:09,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:09,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:09,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:09,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:09,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:09,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:09,764 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:09,776 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:23:09,776 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:23:09,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:09,780 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:09,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:23:09,782 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:09,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:23:09,804 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:09,804 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:09,804 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:23:09,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:09,812 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:09,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:09,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:09,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:09,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:09,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:09,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:09,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:09,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:09,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:09,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:09,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:09,908 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-26 16:23:09,911 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:23:09,912 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 134 transitions. cyclomatic complexity: 74 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (in total 13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:09,981 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 134 transitions. cyclomatic complexity: 74. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (in total 13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 152 states and 345 transitions. Complement of second has 6 states. [2025-04-26 16:23:09,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (in total 13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-04-26 16:23:09,985 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 8 letters. Loop has 5 letters. [2025-04-26 16:23:09,985 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:09,985 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 13 letters. Loop has 5 letters. [2025-04-26 16:23:09,986 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:09,986 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 8 letters. Loop has 10 letters. [2025-04-26 16:23:09,986 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:09,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 345 transitions. [2025-04-26 16:23:09,988 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:09,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 100 states and 225 transitions. [2025-04-26 16:23:09,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2025-04-26 16:23:09,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2025-04-26 16:23:09,989 INFO L74 IsDeterministic]: Start isDeterministic. Operand 100 states and 225 transitions. [2025-04-26 16:23:09,989 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:09,989 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 225 transitions. [2025-04-26 16:23:09,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 225 transitions. [2025-04-26 16:23:09,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 84. [2025-04-26 16:23:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 2.25) internal successors, (in total 189), 83 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 189 transitions. [2025-04-26 16:23:09,993 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84 states and 189 transitions. [2025-04-26 16:23:09,993 INFO L438 stractBuchiCegarLoop]: Abstraction has 84 states and 189 transitions. [2025-04-26 16:23:09,993 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:23:09,993 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 189 transitions. [2025-04-26 16:23:09,993 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:09,993 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:09,994 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:09,994 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:09,994 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:09,994 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= (select v_A_1 v_i_2) v_last_1) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 16:23:09,994 INFO L754 eck$LassoCheckResult]: Loop: "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (or (not v_ok_2) (< v_v_old_1 v_new_2)) (not v_ok_1)) (and (<= v_new_2 v_v_old_1) v_ok_2 v_ok_1)) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" [2025-04-26 16:23:09,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:09,995 INFO L85 PathProgramCache]: Analyzing trace with hash 754070689, now seen corresponding path program 1 times [2025-04-26 16:23:09,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:09,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983525256] [2025-04-26 16:23:09,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:09,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:09,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:10,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:10,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,000 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:10,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:10,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:10,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:10,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:10,012 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 2 times [2025-04-26 16:23:10,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:10,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911959802] [2025-04-26 16:23:10,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:10,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:10,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:10,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:10,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:10,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:10,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:10,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:10,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:10,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:10,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1236873028, now seen corresponding path program 1 times [2025-04-26 16:23:10,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:10,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858650686] [2025-04-26 16:23:10,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:10,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:10,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:10,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:10,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,032 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:10,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:23:10,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:23:10,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:10,210 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:10,210 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:10,210 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:10,210 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:10,210 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:10,210 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,210 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:10,210 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:10,210 INFO L132 ssoRankerPreferences]: Filename of dumped script: dec-subseq.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:23:10,210 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:10,210 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:10,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:10,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:10,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:10,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:10,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:10,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:10,443 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:10,444 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:10,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,446 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:23:10,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:10,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:10,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:10,464 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:10,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:23:10,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,471 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:23:10,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:10,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:10,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:10,489 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:10,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:10,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,498 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:23:10,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:10,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:10,512 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:10,515 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:10,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:23:10,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,523 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:23:10,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:10,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:10,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:10,540 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:10,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:10,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,548 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:23:10,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,560 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:23:10,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,579 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:23:10,579 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:23:10,609 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:10,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:23:10,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,618 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:23:10,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:10,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:10,634 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:10,638 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:10,646 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:23:10,646 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:23:10,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,648 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:23:10,651 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:10,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:10,666 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:10,666 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:10,666 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2025-04-26 16:23:10,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:10,673 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:10,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:10,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:10,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:10,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:10,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:10,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:10,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:10,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:10,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:10,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:10,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:10,732 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-26 16:23:10,733 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:10,733 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 189 transitions. cyclomatic complexity: 115 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:10,755 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 189 transitions. cyclomatic complexity: 115. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 264 states and 609 transitions. Complement of second has 5 states. [2025-04-26 16:23:10,758 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:10,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-26 16:23:10,759 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:23:10,759 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:10,759 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 16:23:10,759 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:10,759 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 36 transitions. Stem has 9 letters. Loop has 8 letters. [2025-04-26 16:23:10,759 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:10,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 264 states and 609 transitions. [2025-04-26 16:23:10,765 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:10,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 264 states to 173 states and 401 transitions. [2025-04-26 16:23:10,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2025-04-26 16:23:10,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2025-04-26 16:23:10,767 INFO L74 IsDeterministic]: Start isDeterministic. Operand 173 states and 401 transitions. [2025-04-26 16:23:10,767 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:10,767 INFO L218 hiAutomatonCegarLoop]: Abstraction has 173 states and 401 transitions. [2025-04-26 16:23:10,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 401 transitions. [2025-04-26 16:23:10,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 161. [2025-04-26 16:23:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 161 states have (on average 2.3664596273291925) internal successors, (in total 381), 160 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 381 transitions. [2025-04-26 16:23:10,778 INFO L240 hiAutomatonCegarLoop]: Abstraction has 161 states and 381 transitions. [2025-04-26 16:23:10,779 INFO L438 stractBuchiCegarLoop]: Abstraction has 161 states and 381 transitions. [2025-04-26 16:23:10,779 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:23:10,779 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 381 transitions. [2025-04-26 16:23:10,780 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:10,780 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:10,780 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:10,780 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:10,780 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:10,784 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= (select v_A_1 v_i_2) v_last_1) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[75] L25-1-->L24-2: Formula: (= (select v_A_3 v_i_4) v_last_2) InVars {A=v_A_3, i=v_i_4} OutVars{A=v_A_3, last=v_last_2, i=v_i_4} AuxVars[] AssignedVars[last]" [2025-04-26 16:23:10,784 INFO L754 eck$LassoCheckResult]: Loop: "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (or (not v_ok_2) (< v_v_old_1 v_new_2)) (not v_ok_1)) (and (<= v_new_2 v_v_old_1) v_ok_2 v_ok_1)) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" [2025-04-26 16:23:10,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:10,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1915145924, now seen corresponding path program 1 times [2025-04-26 16:23:10,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:10,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468016239] [2025-04-26 16:23:10,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:10,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:10,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:10,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:10,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,791 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:10,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:10,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:10,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:10,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 3 times [2025-04-26 16:23:10,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:10,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460296230] [2025-04-26 16:23:10,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:10,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:10,805 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:10,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:10,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:10,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:10,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:10,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:10,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:10,815 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:10,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1358823399, now seen corresponding path program 1 times [2025-04-26 16:23:10,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:10,815 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932670510] [2025-04-26 16:23:10,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:10,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:10,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:10,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:10,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,824 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:10,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:10,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:10,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:10,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:10,988 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:10,988 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:10,988 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:10,988 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:10,988 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:10,989 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,989 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:10,989 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:10,989 INFO L132 ssoRankerPreferences]: Filename of dumped script: dec-subseq.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:23:10,989 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:10,989 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:10,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:10,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:10,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:10,997 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,221 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:11,221 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:11,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:11,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:11,223 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:11,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:23:11,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:11,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:11,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:11,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:11,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:11,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:11,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:11,242 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:11,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:11,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:11,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:11,252 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:11,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:23:11,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:11,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:11,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:11,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:11,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:11,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:11,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:11,268 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:11,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:23:11,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:11,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:11,276 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:11,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:23:11,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:11,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:11,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:11,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:11,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:11,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:11,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:11,293 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:11,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:11,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:11,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:11,301 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:11,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:23:11,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:11,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:11,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:11,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:11,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:11,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:11,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:11,321 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:11,329 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:23:11,329 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:23:11,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:11,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:11,332 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:11,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:23:11,333 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:11,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:23:11,350 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:11,350 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:11,350 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(start, end) = -1*start + 1*end Supporting invariants [] [2025-04-26 16:23:11,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:11,357 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:11,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:11,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:11,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:11,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:11,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:11,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:11,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:11,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:11,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:11,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:11,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:11,402 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-26 16:23:11,403 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:11,403 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 161 states and 381 transitions. cyclomatic complexity: 239 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:11,439 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 161 states and 381 transitions. cyclomatic complexity: 239. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 484 states and 1154 transitions. Complement of second has 5 states. [2025-04-26 16:23:11,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:11,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-26 16:23:11,441 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:23:11,441 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:11,441 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:23:11,441 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:11,441 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 10 letters. Loop has 8 letters. [2025-04-26 16:23:11,442 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:11,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 484 states and 1154 transitions. [2025-04-26 16:23:11,449 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:23:11,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 484 states to 350 states and 812 transitions. [2025-04-26 16:23:11,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2025-04-26 16:23:11,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2025-04-26 16:23:11,453 INFO L74 IsDeterministic]: Start isDeterministic. Operand 350 states and 812 transitions. [2025-04-26 16:23:11,453 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:11,453 INFO L218 hiAutomatonCegarLoop]: Abstraction has 350 states and 812 transitions. [2025-04-26 16:23:11,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states and 812 transitions. [2025-04-26 16:23:11,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 182. [2025-04-26 16:23:11,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 182 states have (on average 2.32967032967033) internal successors, (in total 424), 181 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:11,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 424 transitions. [2025-04-26 16:23:11,460 INFO L240 hiAutomatonCegarLoop]: Abstraction has 182 states and 424 transitions. [2025-04-26 16:23:11,460 INFO L438 stractBuchiCegarLoop]: Abstraction has 182 states and 424 transitions. [2025-04-26 16:23:11,460 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:23:11,460 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 424 transitions. [2025-04-26 16:23:11,461 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:23:11,461 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:11,461 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:11,461 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:11,461 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:11,462 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= (select v_A_1 v_i_2) v_last_1) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" [2025-04-26 16:23:11,462 INFO L754 eck$LassoCheckResult]: Loop: "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (or (not v_ok_2) (< v_v_old_1 v_new_2)) (not v_ok_1)) (and (<= v_new_2 v_v_old_1) v_ok_2 v_ok_1)) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" [2025-04-26 16:23:11,462 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1915145926, now seen corresponding path program 1 times [2025-04-26 16:23:11,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:11,462 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854490425] [2025-04-26 16:23:11,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:11,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:11,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:11,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:11,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:11,466 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:11,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:11,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:11,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:11,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:11,471 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:11,471 INFO L85 PathProgramCache]: Analyzing trace with hash 3356478, now seen corresponding path program 4 times [2025-04-26 16:23:11,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:11,471 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546677736] [2025-04-26 16:23:11,471 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:11,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:11,478 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-04-26 16:23:11,480 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:11,480 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:11,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:11,480 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:11,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:11,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:11,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:11,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:11,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1360731011, now seen corresponding path program 2 times [2025-04-26 16:23:11,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:11,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596608520] [2025-04-26 16:23:11,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:11,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:11,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-04-26 16:23:11,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:11,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:11,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:11,492 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:11,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:23:11,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:23:11,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:11,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:11,622 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:11,622 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:11,622 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:11,622 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:11,622 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:11,622 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:11,622 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:11,622 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:11,622 INFO L132 ssoRankerPreferences]: Filename of dumped script: dec-subseq.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:23:11,622 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:11,622 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:11,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:11,840 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:11,840 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:11,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:11,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:11,845 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:11,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:23:11,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:11,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:11,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:11,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:11,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:11,858 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:11,858 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:11,861 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:11,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:23:11,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:11,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:11,868 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:11,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:23:11,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:11,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:11,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:11,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:11,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:11,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:11,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:11,883 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:11,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:23:11,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:11,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:11,891 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:11,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:23:11,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:11,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:11,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:11,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:11,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:11,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:11,903 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:11,905 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:11,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:23:11,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:11,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:11,913 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:11,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:23:11,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:11,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:11,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:11,926 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:23:11,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:11,934 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:23:11,934 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:11,948 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:11,971 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:23:11,971 INFO L437 ModelExtractionUtils]: 14 out of 26 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:23:11,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:11,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:11,973 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:11,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:23:11,976 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:11,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:23:11,992 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:23:11,992 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:11,992 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(start, end) = -1*start + 1*end Supporting invariants [] [2025-04-26 16:23:11,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:23:11,999 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:12,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:12,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:12,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:12,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:12,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:12,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:12,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:12,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:12,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:12,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:12,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:12,058 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-26 16:23:12,058 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:12,058 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 182 states and 424 transitions. cyclomatic complexity: 265 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:12,086 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 182 states and 424 transitions. cyclomatic complexity: 265. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 573 states and 1311 transitions. Complement of second has 5 states. [2025-04-26 16:23:12,086 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:12,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-26 16:23:12,087 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:23:12,087 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:12,087 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:23:12,087 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:12,087 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 10 letters. Loop has 8 letters. [2025-04-26 16:23:12,087 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:12,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 573 states and 1311 transitions. [2025-04-26 16:23:12,092 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:23:12,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 573 states to 404 states and 918 transitions. [2025-04-26 16:23:12,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 115 [2025-04-26 16:23:12,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 127 [2025-04-26 16:23:12,099 INFO L74 IsDeterministic]: Start isDeterministic. Operand 404 states and 918 transitions. [2025-04-26 16:23:12,099 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:12,099 INFO L218 hiAutomatonCegarLoop]: Abstraction has 404 states and 918 transitions. [2025-04-26 16:23:12,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states and 918 transitions. [2025-04-26 16:23:12,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 204. [2025-04-26 16:23:12,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 204 states have (on average 2.343137254901961) internal successors, (in total 478), 203 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 478 transitions. [2025-04-26 16:23:12,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 204 states and 478 transitions. [2025-04-26 16:23:12,112 INFO L438 stractBuchiCegarLoop]: Abstraction has 204 states and 478 transitions. [2025-04-26 16:23:12,112 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:23:12,112 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 204 states and 478 transitions. [2025-04-26 16:23:12,113 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:23:12,113 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:12,113 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:12,114 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:12,114 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:12,114 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= (select v_A_1 v_i_2) v_last_1) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" [2025-04-26 16:23:12,114 INFO L754 eck$LassoCheckResult]: Loop: "[80] L40-1-->L46: Formula: (or (and (or (not v_ok_2) (< v_v_old_1 v_new_2)) (not v_ok_1)) (and (<= v_new_2 v_v_old_1) v_ok_2 v_ok_1)) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" [2025-04-26 16:23:12,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:12,114 INFO L85 PathProgramCache]: Analyzing trace with hash -760014639, now seen corresponding path program 1 times [2025-04-26 16:23:12,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:12,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141916202] [2025-04-26 16:23:12,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:12,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:12,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:12,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:12,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:12,119 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:12,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:12,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:12,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:12,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:12,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:12,125 INFO L85 PathProgramCache]: Analyzing trace with hash 3387108, now seen corresponding path program 5 times [2025-04-26 16:23:12,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:12,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714641534] [2025-04-26 16:23:12,126 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:23:12,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:12,128 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:12,130 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:12,130 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:12,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:12,130 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:12,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:12,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:12,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:12,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:12,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:12,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1626480716, now seen corresponding path program 3 times [2025-04-26 16:23:12,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:12,135 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060851213] [2025-04-26 16:23:12,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:12,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:12,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-04-26 16:23:12,139 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:12,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:23:12,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:12,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:12,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060851213] [2025-04-26 16:23:12,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060851213] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:12,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:12,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:23:12,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724307147] [2025-04-26 16:23:12,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:12,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:12,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:23:12,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:23:12,247 INFO L87 Difference]: Start difference. First operand 204 states and 478 transitions. cyclomatic complexity: 299 Second operand has 5 states, 4 states have (on average 3.75) internal successors, (in total 15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:12,277 INFO L93 Difference]: Finished difference Result 423 states and 956 transitions. [2025-04-26 16:23:12,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 423 states and 956 transitions. [2025-04-26 16:23:12,280 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:12,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 423 states to 309 states and 704 transitions. [2025-04-26 16:23:12,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2025-04-26 16:23:12,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2025-04-26 16:23:12,286 INFO L74 IsDeterministic]: Start isDeterministic. Operand 309 states and 704 transitions. [2025-04-26 16:23:12,286 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:12,286 INFO L218 hiAutomatonCegarLoop]: Abstraction has 309 states and 704 transitions. [2025-04-26 16:23:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states and 704 transitions. [2025-04-26 16:23:12,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 249. [2025-04-26 16:23:12,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 249 states have (on average 2.3453815261044175) internal successors, (in total 584), 248 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 584 transitions. [2025-04-26 16:23:12,296 INFO L240 hiAutomatonCegarLoop]: Abstraction has 249 states and 584 transitions. [2025-04-26 16:23:12,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:23:12,298 INFO L438 stractBuchiCegarLoop]: Abstraction has 249 states and 584 transitions. [2025-04-26 16:23:12,298 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:23:12,298 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 249 states and 584 transitions. [2025-04-26 16:23:12,300 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:12,300 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:12,300 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:12,300 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:12,300 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:12,302 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L54: Formula: (= v_end_7 v_start_7) InVars {end=v_end_7, start=v_start_7} OutVars{end=v_end_7, start=v_start_7} AuxVars[] AssignedVars[]" "[42] L54-->L55: Formula: (and (= v_v_old_3 v_last_4) (= (select v_A_5 0) v_v_old_3)) InVars {A=v_A_5, last=v_last_4, v_old=v_v_old_3} OutVars{A=v_A_5, last=v_last_4, v_old=v_v_old_3} AuxVars[] AssignedVars[]" "[55] L55-->L56: Formula: (= v_i_11 0) InVars {i=v_i_11} OutVars{i=v_i_11} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: v_ok_4 InVars {ok=v_ok_4} OutVars{ok=v_ok_4} AuxVars[] AssignedVars[]" "[87] L57-->L23: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[84] L57-1-->L39: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= (select v_A_1 v_i_2) v_last_1) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" "[75] L25-1-->L24-2: Formula: (= (select v_A_3 v_i_4) v_last_2) InVars {A=v_A_3, i=v_i_4} OutVars{A=v_A_3, last=v_last_2, i=v_i_4} AuxVars[] AssignedVars[last]" "[74] L24-2-->L23: Formula: (= v_i_6 (+ v_i_7 1)) InVars {i=v_i_7} OutVars{i=v_i_6} AuxVars[] AssignedVars[i]" "[69] L23-->L24: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[71] L24-->L25: Formula: (<= (select v_A_1 v_i_2) v_last_1) InVars {A=v_A_1, last=v_last_1, i=v_i_2} OutVars{A=v_A_1, last=v_last_1, i=v_i_2} AuxVars[] AssignedVars[]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" "[73] L25-->L25-1: Formula: (and (= (select v_A_6 v_i_12) (select v_queue_3 v_end_9)) (= (+ v_end_9 1) v_end_8)) InVars {A=v_A_6, i=v_i_12, end=v_end_9, queue=v_queue_3} OutVars{A=v_A_6, i=v_i_12, end=v_end_8, queue=v_queue_3} AuxVars[] AssignedVars[end]" [2025-04-26 16:23:12,302 INFO L754 eck$LassoCheckResult]: Loop: "[79] L40-->L40-1: Formula: (and (< v_start_13 v_end_12) (= v_start_12 (+ v_start_13 1)) (= (select v_queue_7 v_start_13) v_new_6)) InVars {queue=v_queue_7, end=v_end_12, start=v_start_13} OutVars{end=v_end_12, start=v_start_12, new=v_new_6, queue=v_queue_7} AuxVars[] AssignedVars[start, new]" "[80] L40-1-->L46: Formula: (or (and (or (not v_ok_2) (< v_v_old_1 v_new_2)) (not v_ok_1)) (and (<= v_new_2 v_v_old_1) v_ok_2 v_ok_1)) InVars {ok=v_ok_2, v_old=v_v_old_1, new=v_new_2} OutVars{ok=v_ok_1, v_old=v_v_old_1, new=v_new_2} AuxVars[] AssignedVars[ok]" "[81] L46-->L39: Formula: (= v_v_old_2 v_new_3) InVars {new=v_new_3} OutVars{v_old=v_v_old_2, new=v_new_3} AuxVars[] AssignedVars[v_old]" "[77] L39-->L40: Formula: (or (< v_start_1 v_end_4) (< v_i_9 v_N_3)) InVars {i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} OutVars{i=v_i_9, end=v_end_4, start=v_start_1, N=v_N_3} AuxVars[] AssignedVars[]" [2025-04-26 16:23:12,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:12,302 INFO L85 PathProgramCache]: Analyzing trace with hash -829224764, now seen corresponding path program 1 times [2025-04-26 16:23:12,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:12,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951081288] [2025-04-26 16:23:12,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:12,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:12,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:12,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:12,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:12,308 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:12,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:12,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:12,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:12,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:12,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:12,319 INFO L85 PathProgramCache]: Analyzing trace with hash 3356478, now seen corresponding path program 6 times [2025-04-26 16:23:12,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:12,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344809998] [2025-04-26 16:23:12,319 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:23:12,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:12,321 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:12,322 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:12,322 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:23:12,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:12,322 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:12,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:12,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:12,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:12,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:12,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:12,324 INFO L85 PathProgramCache]: Analyzing trace with hash -927062399, now seen corresponding path program 1 times [2025-04-26 16:23:12,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:12,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255145504] [2025-04-26 16:23:12,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:12,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:12,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:12,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:12,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:12,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:12,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:23:12,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:23:12,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:12,348 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:12,517 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:12,517 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:12,517 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:12,517 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:12,517 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:12,517 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:12,517 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:12,518 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:12,518 INFO L132 ssoRankerPreferences]: Filename of dumped script: dec-subseq.wvr.bpl_petrified1_Iteration8_Lasso [2025-04-26 16:23:12,518 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:12,518 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:12,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:12,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:12,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:12,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:12,753 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:12,753 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:12,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:12,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:12,755 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:12,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:23:12,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:12,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:12,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:12,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:12,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:12,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:12,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:12,771 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:12,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:12,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:12,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:12,778 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:12,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:23:12,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:12,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:12,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:12,789 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:23:12,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:12,794 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:23:12,794 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:12,809 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:12,830 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:12,830 INFO L437 ModelExtractionUtils]: 13 out of 26 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-04-26 16:23:12,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:12,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:12,832 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:12,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:23:12,836 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:12,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:12,857 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:23:12,857 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:12,857 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(end, start) = 1*end - 1*start Supporting invariants [] [2025-04-26 16:23:12,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:23:12,868 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:23:12,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:12,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:12,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:12,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:12,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:12,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:12,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:12,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:12,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:12,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:12,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:12,924 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-26 16:23:12,925 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:12,925 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:12,939 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 403 states and 908 transitions. Complement of second has 5 states. [2025-04-26 16:23:12,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-26 16:23:12,940 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:23:12,940 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:12,940 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:12,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:12,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:12,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:12,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:12,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:12,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:12,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:12,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:12,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:12,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:12,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:12,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:12,989 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-26 16:23:12,990 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:12,990 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:13,011 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 483 states and 1086 transitions. Complement of second has 7 states. [2025-04-26 16:23:13,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2025-04-26 16:23:13,012 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 37 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:23:13,012 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:13,012 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:13,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:13,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:13,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:13,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:13,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:13,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:13,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:13,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:13,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:13,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:13,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:13,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:13,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:13,079 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-26 16:23:13,080 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:13,080 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361 Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:13,098 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 249 states and 584 transitions. cyclomatic complexity: 361. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 588 states and 1370 transitions. Complement of second has 5 states. [2025-04-26 16:23:13,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:13,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (in total 17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:13,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-04-26 16:23:13,099 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:23:13,099 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:13,099 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 19 letters. Loop has 4 letters. [2025-04-26 16:23:13,099 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:13,099 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 46 transitions. Stem has 15 letters. Loop has 8 letters. [2025-04-26 16:23:13,099 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:13,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 588 states and 1370 transitions. [2025-04-26 16:23:13,103 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:13,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 588 states to 0 states and 0 transitions. [2025-04-26 16:23:13,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:23:13,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:23:13,104 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:23:13,104 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:13,104 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:13,104 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:13,104 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:13,104 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:23:13,104 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:23:13,104 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:13,104 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:23:13,109 INFO L201 PluginConnector]: Adding new model dec-subseq.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:13 BoogieIcfgContainer [2025-04-26 16:23:13,109 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:13,109 INFO L158 Benchmark]: Toolchain (without parser) took 4953.37ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 85.1MB in the beginning and 51.0MB in the end (delta: 34.1MB). Peak memory consumption was 42.1MB. Max. memory is 8.0GB. [2025-04-26 16:23:13,110 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.27ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:13,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.06ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 83.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:13,113 INFO L158 Benchmark]: Boogie Preprocessor took 19.31ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 82.2MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:23:13,114 INFO L158 Benchmark]: RCFGBuilder took 188.52ms. Allocated memory is still 159.4MB. Free memory was 82.2MB in the beginning and 72.3MB in the end (delta: 9.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:23:13,114 INFO L158 Benchmark]: BuchiAutomizer took 4704.62ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 72.3MB in the beginning and 51.0MB in the end (delta: 21.3MB). Peak memory consumption was 33.7MB. Max. memory is 8.0GB. [2025-04-26 16:23:13,115 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.27ms. Allocated memory is still 159.4MB. Free memory is still 86.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.06ms. Allocated memory is still 159.4MB. Free memory was 85.1MB in the beginning and 83.3MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 19.31ms. Allocated memory is still 159.4MB. Free memory was 83.3MB in the beginning and 82.2MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 188.52ms. Allocated memory is still 159.4MB. Free memory was 82.2MB in the beginning and 72.3MB in the end (delta: 9.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 4704.62ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 72.3MB in the beginning and 51.0MB in the end (delta: 21.3MB). Peak memory consumption was 33.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 3.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 549 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 288 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 281 mSDsluCounter, 295 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 194 IncrementalHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 175 mSDtfsCounter, 194 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp96 ukn80 mio100 lsp58 div100 bol117 ite100 ukn100 eq163 hnf90 smp100 dnf199 smp67 tf100 neg100 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 62ms VariablesStem: 6 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function end + -1 * start and consists of 3 locations. One deterministic module has affine ranking function end + -1 * start and consists of 3 locations. One deterministic module has affine ranking function end + -1 * start and consists of 3 locations. One nondeterministic module has affine ranking function end + -1 * start and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:23:13,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...