/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/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:09,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:09,734 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:09,737 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:09,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:09,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:09,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:09,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:09,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:09,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:09,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:09,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:09,753 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:09,754 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:09,754 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:09,754 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:09,754 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:09,754 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:09,754 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:09,754 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:09,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:09,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:09,754 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:09,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:09,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:09,754 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:09,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:09,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:09,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:09,754 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:09,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:09,755 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:09,755 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:09,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:09,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:09,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:09,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:09,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:09,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:09,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:09,755 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:09,755 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:09,755 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:09,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:09,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:09,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:09,987 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:09,987 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:09,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-2.wvr.bpl [2025-04-26 16:56:09,988 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-2.wvr.bpl' [2025-04-26 16:56:10,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:10,003 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:10,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:10,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:10,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:10,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,032 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:10,033 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:10,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:10,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:10,034 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:10,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,041 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,043 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,043 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,047 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:10,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:10,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:10,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:10,064 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/1) ... [2025-04-26 16:56:10,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:10,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:10,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:10,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:56:10,114 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:10,115 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:10,115 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:10,115 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:10,115 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:10,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:10,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:10,116 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:56:10,150 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:10,153 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:10,243 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:10,243 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:10,265 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:10,265 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:10,266 INFO L201 PluginConnector]: Adding new model queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:10 BoogieIcfgContainer [2025-04-26 16:56:10,266 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:10,267 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:10,267 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:10,273 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:10,273 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:10,273 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:10" (1/2) ... [2025-04-26 16:56:10,274 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27109124 and model type queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:10, skipping insertion in model container [2025-04-26 16:56:10,274 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:10,274 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:10" (2/2) ... [2025-04-26 16:56:10,276 INFO L376 chiAutomizerObserver]: Analyzing ICFG queue-add-2.wvr.bpl [2025-04-26 16:56:10,322 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:56:10,365 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:10,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:10,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:10,368 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:56:10,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:56:10,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 70 flow [2025-04-26 16:56:10,436 INFO L116 PetriNetUnfolderBase]: 2/24 cut-off events. [2025-04-26 16:56:10,438 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:56:10,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 2/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 16:56:10,442 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 28 transitions, 70 flow [2025-04-26 16:56:10,445 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 24 transitions, 60 flow [2025-04-26 16:56:10,445 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 24 transitions, 60 flow [2025-04-26 16:56:10,451 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:10,516 WARN L140 AmpleReduction]: Number of pruned transitions: 38 [2025-04-26 16:56:10,516 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:10,516 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 9 [2025-04-26 16:56:10,516 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:19 [2025-04-26 16:56:10,516 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:35 [2025-04-26 16:56:10,516 WARN L145 AmpleReduction]: Times succ was already a loop node:2 [2025-04-26 16:56:10,516 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:11 [2025-04-26 16:56:10,517 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:10,521 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 64 states, 62 states have (on average 1.3548387096774193) internal successors, (in total 84), 63 states have internal predecessors, (84), 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:56:10,526 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:10,527 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:10,527 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:10,527 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:10,527 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:10,527 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:10,527 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:10,527 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:10,528 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 64 states, 62 states have (on average 1.3548387096774193) internal successors, (in total 84), 63 states have internal predecessors, (84), 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:56:10,539 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 36 [2025-04-26 16:56:10,539 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:10,539 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:10,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:10,541 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:10,542 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:10,542 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 64 states, 62 states have (on average 1.3548387096774193) internal successors, (in total 84), 63 states have internal predecessors, (84), 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:56:10,544 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 36 [2025-04-26 16:56:10,544 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:10,544 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:10,544 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:10,544 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:56:10,548 INFO L752 eck$LassoCheckResult]: Stem: "[59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[]" "[81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" [2025-04-26 16:56:10,548 INFO L754 eck$LassoCheckResult]: Loop: "[66] L22-1-->L23: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[68] L23-->L23-1: Formula: (and (= (+ v_q_back_14 1) v_q_back_13) (= (select v_q_6 v_q_back_14) 1)) InVars {q=v_q_6, q_back=v_q_back_14} OutVars{q=v_q_6, q_back=v_q_back_13} AuxVars[] AssignedVars[q_back]" "[70] L23-1-->L22-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" [2025-04-26 16:56:10,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:10,552 INFO L85 PathProgramCache]: Analyzing trace with hash 89065, now seen corresponding path program 1 times [2025-04-26 16:56:10,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:10,556 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831304248] [2025-04-26 16:56:10,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:10,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:10,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:10,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:10,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,603 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:10,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:10,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:10,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:10,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:10,624 INFO L85 PathProgramCache]: Analyzing trace with hash 95395, now seen corresponding path program 1 times [2025-04-26 16:56:10,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:10,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048819546] [2025-04-26 16:56:10,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:10,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:10,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:10,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:10,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,636 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:10,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:10,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:10,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:10,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:10,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1641566277, now seen corresponding path program 1 times [2025-04-26 16:56:10,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:10,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834196762] [2025-04-26 16:56:10,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:10,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:10,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:10,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:10,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,656 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:10,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:10,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:10,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:10,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:10,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:10,762 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:10,763 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:10,764 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:10,764 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:10,764 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:10,764 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:10,764 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:10,764 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:10,764 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:56:10,764 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:10,764 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:10,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,807 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:10,917 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:10,919 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:10,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:10,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:10,922 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:56:10,924 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:56:10,925 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:56:10,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:10,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:10,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:10,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:10,947 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:10,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:10,958 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:10,974 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:56:10,974 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:56:10,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:10,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,008 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:56:11,016 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:56:11,017 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:11,034 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:56:11,034 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:11,035 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:11,035 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:56:11,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:56:11,043 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:11,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:11,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:11,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:11,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:11,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:11,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:11,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:11,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:11,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:11,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:11,127 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:56:11,143 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:56:11,144 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 64 states, 62 states have (on average 1.3548387096774193) internal successors, (in total 84), 63 states have internal predecessors, (84), 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) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:56:11,226 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 64 states, 62 states have (on average 1.3548387096774193) internal successors, (in total 84), 63 states have internal predecessors, (84), 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). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 131 states and 186 transitions. Complement of second has 7 states. [2025-04-26 16:56:11,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:56:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2025-04-26 16:56:11,238 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:56:11,238 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,238 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:56:11,240 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,240 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:56:11,240 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,241 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 186 transitions. [2025-04-26 16:56:11,248 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-04-26 16:56:11,250 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 53 states and 72 transitions. [2025-04-26 16:56:11,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-04-26 16:56:11,251 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2025-04-26 16:56:11,254 INFO L74 IsDeterministic]: Start isDeterministic. Operand 53 states and 72 transitions. [2025-04-26 16:56:11,254 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:11,254 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 72 transitions. [2025-04-26 16:56:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 72 transitions. [2025-04-26 16:56:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2025-04-26 16:56:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.38) internal successors, (in total 69), 49 states have internal predecessors, (69), 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:56:11,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 69 transitions. [2025-04-26 16:56:11,276 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 69 transitions. [2025-04-26 16:56:11,276 INFO L438 stractBuchiCegarLoop]: Abstraction has 50 states and 69 transitions. [2025-04-26 16:56:11,276 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:11,276 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 69 transitions. [2025-04-26 16:56:11,279 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-04-26 16:56:11,279 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:11,279 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:11,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:11,280 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:11,280 INFO L752 eck$LassoCheckResult]: Stem: "[59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[]" "[81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[65] L22-1-->L29: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[67] L29-->thread1FINAL: Formula: (and (= (+ v_q_back_10 1) v_q_back_9) (= 0 (select v_q_4 v_q_back_10))) InVars {q=v_q_4, q_back=v_q_back_10} OutVars{q=v_q_4, q_back=v_q_back_9} AuxVars[] AssignedVars[q_back]" "[69] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[71] $Ultimate##0-->L39: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[72] L39-->L40-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" [2025-04-26 16:56:11,280 INFO L754 eck$LassoCheckResult]: Loop: "[74] L40-1-->L41: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[76] L41-->L41-1: Formula: (and (= v_q_front_10 (+ v_q_front_11 1)) (< v_q_front_11 v_q_back_17) (= (select v_q_10 v_q_front_11) v_j_6)) InVars {q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_11} OutVars{q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_10, j=v_j_6} AuxVars[] AssignedVars[j, q_front]" "[77] L41-1-->L47: Formula: (= (+ v_j_2 v_s_2) v_s_1) InVars {s=v_s_2, j=v_j_2} OutVars{s=v_s_1, j=v_j_2} AuxVars[] AssignedVars[s]" "[78] L47-->L40-1: Formula: (let ((.cse0 (= v_j_3 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_3} OutVars{j=v_j_3, f=v_f_2} AuxVars[] AssignedVars[f]" [2025-04-26 16:56:11,281 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1432825317, now seen corresponding path program 1 times [2025-04-26 16:56:11,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038762633] [2025-04-26 16:56:11,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:11,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:11,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,288 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:11,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:11,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,300 INFO L85 PathProgramCache]: Analyzing trace with hash 3203556, now seen corresponding path program 1 times [2025-04-26 16:56:11,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259380019] [2025-04-26 16:56:11,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:11,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:11,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,307 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:11,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:11,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,314 INFO L85 PathProgramCache]: Analyzing trace with hash 796858110, now seen corresponding path program 1 times [2025-04-26 16:56:11,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140932596] [2025-04-26 16:56:11,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:11,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:11,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,329 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:56:11,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:56:11,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,494 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:11,494 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:11,494 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:11,494 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:11,495 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:11,495 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,495 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:11,495 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:11,495 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:56:11,495 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:11,495 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:11,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:11,723 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:11,723 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:11,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,727 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:56:11,728 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:56:11,729 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:56:11,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:11,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:11,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:11,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:11,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:11,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:11,746 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:11,751 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:56:11,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,753 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:56:11,754 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:56:11,755 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:56:11,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:11,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:11,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:11,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:11,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:11,767 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:11,770 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:11,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:56:11,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,778 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:56:11,779 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:56:11,780 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:56:11,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:11,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:11,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:11,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:11,793 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:11,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:11,797 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:11,805 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:56:11,805 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:56:11,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:11,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:11,807 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:56:11,808 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:56:11,812 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:11,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:56:11,828 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:11,828 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:11,828 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_front, q_back) = -1*q_front + 1*q_back Supporting invariants [] [2025-04-26 16:56:11,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:11,834 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:11,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:11,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:11,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:11,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:11,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:11,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:11,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:11,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:11,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:11,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:11,906 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:56:11,907 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:56:11,907 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 69 transitions. cyclomatic complexity: 25 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:56:11,920 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 69 transitions. cyclomatic complexity: 25. 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 78 states and 102 transitions. Complement of second has 5 states. [2025-04-26 16:56:11,920 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:56:11,921 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:56:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2025-04-26 16:56:11,921 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:56:11,921 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,921 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 16:56:11,921 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,921 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 9 letters. Loop has 8 letters. [2025-04-26 16:56:11,922 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:11,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 102 transitions. [2025-04-26 16:56:11,922 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-04-26 16:56:11,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 44 states and 60 transitions. [2025-04-26 16:56:11,923 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-04-26 16:56:11,923 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2025-04-26 16:56:11,923 INFO L74 IsDeterministic]: Start isDeterministic. Operand 44 states and 60 transitions. [2025-04-26 16:56:11,923 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:11,923 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 60 transitions. [2025-04-26 16:56:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 60 transitions. [2025-04-26 16:56:11,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2025-04-26 16:56:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.372093023255814) internal successors, (in total 59), 42 states have internal predecessors, (59), 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:56:11,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 59 transitions. [2025-04-26 16:56:11,925 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 59 transitions. [2025-04-26 16:56:11,925 INFO L438 stractBuchiCegarLoop]: Abstraction has 43 states and 59 transitions. [2025-04-26 16:56:11,925 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:11,925 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 59 transitions. [2025-04-26 16:56:11,925 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2025-04-26 16:56:11,925 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:11,926 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:11,927 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:11,927 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:56:11,927 INFO L752 eck$LassoCheckResult]: Stem: "[59] $Ultimate##0-->L55: Formula: (and (= v_q_back_8 v_q_front_5) (<= 0 v_N_4)) InVars {q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} OutVars{q_back=v_q_back_8, N=v_N_4, q_front=v_q_front_5} AuxVars[] AssignedVars[]" "[81] L55-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[64] $Ultimate##0-->L22-1: Formula: (= v_i_1 0) InVars {} OutVars{i=v_i_1} AuxVars[] AssignedVars[i]" "[66] L22-1-->L23: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[68] L23-->L23-1: Formula: (and (= (+ v_q_back_14 1) v_q_back_13) (= (select v_q_6 v_q_back_14) 1)) InVars {q=v_q_6, q_back=v_q_back_14} OutVars{q=v_q_6, q_back=v_q_back_13} AuxVars[] AssignedVars[q_back]" "[84] L55-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[71] $Ultimate##0-->L39: Formula: (= v_s_3 0) InVars {} OutVars{s=v_s_3} AuxVars[] AssignedVars[s]" "[70] L23-1-->L22-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[66] L22-1-->L23: Formula: (< v_i_2 v_N_1) InVars {i=v_i_2, N=v_N_1} OutVars{i=v_i_2, N=v_N_1} AuxVars[] AssignedVars[]" "[72] L39-->L40-1: Formula: v_f_4 InVars {} OutVars{f=v_f_4} AuxVars[] AssignedVars[f]" "[68] L23-->L23-1: Formula: (and (= (+ v_q_back_14 1) v_q_back_13) (= (select v_q_6 v_q_back_14) 1)) InVars {q=v_q_6, q_back=v_q_back_14} OutVars{q=v_q_6, q_back=v_q_back_13} AuxVars[] AssignedVars[q_back]" "[70] L23-1-->L22-1: Formula: (= v_i_3 (+ v_i_4 1)) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[65] L22-1-->L29: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[67] L29-->thread1FINAL: Formula: (and (= (+ v_q_back_10 1) v_q_back_9) (= 0 (select v_q_4 v_q_back_10))) InVars {q=v_q_4, q_back=v_q_back_10} OutVars{q=v_q_4, q_back=v_q_back_9} AuxVars[] AssignedVars[q_back]" [2025-04-26 16:56:11,928 INFO L754 eck$LassoCheckResult]: Loop: "[74] L40-1-->L41: Formula: v_f_1 InVars {f=v_f_1} OutVars{f=v_f_1} AuxVars[] AssignedVars[]" "[76] L41-->L41-1: Formula: (and (= v_q_front_10 (+ v_q_front_11 1)) (< v_q_front_11 v_q_back_17) (= (select v_q_10 v_q_front_11) v_j_6)) InVars {q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_11} OutVars{q=v_q_10, q_back=v_q_back_17, q_front=v_q_front_10, j=v_j_6} AuxVars[] AssignedVars[j, q_front]" "[77] L41-1-->L47: Formula: (= (+ v_j_2 v_s_2) v_s_1) InVars {s=v_s_2, j=v_j_2} OutVars{s=v_s_1, j=v_j_2} AuxVars[] AssignedVars[s]" "[78] L47-->L40-1: Formula: (let ((.cse0 (= v_j_3 0))) (or (and (not .cse0) v_f_2) (and .cse0 (not v_f_2)))) InVars {j=v_j_3} OutVars{j=v_j_3, f=v_f_2} AuxVars[] AssignedVars[f]" [2025-04-26 16:56:11,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1944185298, now seen corresponding path program 1 times [2025-04-26 16:56:11,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515641021] [2025-04-26 16:56:11,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:56:11,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:56:11,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,934 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:56:11,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:56:11,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,940 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash 3203556, now seen corresponding path program 2 times [2025-04-26 16:56:11,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721843016] [2025-04-26 16:56:11,940 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:11,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:11,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:11,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:11,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,946 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:11,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:11,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:11,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:11,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2054650677, now seen corresponding path program 1 times [2025-04-26 16:56:11,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:11,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209798130] [2025-04-26 16:56:11,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:11,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:11,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:56:11,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:56:11,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,967 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:11,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:56:11,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:56:11,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:11,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:11,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:12,175 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:12,175 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:12,176 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:12,176 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:12,176 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:12,176 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,178 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:12,178 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:12,178 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:56:12,178 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:12,178 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:12,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,244 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:12,411 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:12,411 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:12,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,414 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:56:12,416 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:56:12,418 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:56:12,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,429 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:12,429 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,432 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:12,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:12,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,461 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:56:12,463 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:56:12,463 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:56:12,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,474 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:56:12,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,492 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:56:12,492 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:56:12,519 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:12,525 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:56:12,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,529 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:56:12,530 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:56:12,531 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:56:12,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:12,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,545 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:12,551 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:56:12,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,553 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:56:12,555 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:56:12,556 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:56:12,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:12,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:12,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:12,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:12,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:12,569 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:12,574 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:12,586 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:56:12,587 INFO L437 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:56:12,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:12,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:12,590 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:56:12,592 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:56:12,593 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:12,610 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:56:12,610 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:12,610 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:12,610 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_front, q_back) = -1*q_front + 1*q_back Supporting invariants [] [2025-04-26 16:56:12,616 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:56:12,619 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:56:12,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:12,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:56:12,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:56:12,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:12,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:12,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:12,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:56:12,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:56:12,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:12,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:12,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:12,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:12,684 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:56:12,685 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:56:12,685 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 59 transitions. cyclomatic complexity: 22 Second operand has 4 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:56:12,700 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 59 transitions. cyclomatic complexity: 22. Second operand has 4 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) Result 60 states and 83 transitions. Complement of second has 4 states. [2025-04-26 16:56:12,702 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:56:12,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 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:56:12,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2025-04-26 16:56:12,703 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 14 letters. Loop has 4 letters. [2025-04-26 16:56:12,703 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:12,703 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 18 letters. Loop has 4 letters. [2025-04-26 16:56:12,703 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:12,703 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 14 letters. Loop has 8 letters. [2025-04-26 16:56:12,704 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:12,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 83 transitions. [2025-04-26 16:56:12,706 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:12,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 0 states and 0 transitions. [2025-04-26 16:56:12,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:56:12,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:56:12,706 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:56:12,706 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:56:12,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:12,706 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:12,706 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:56:12,706 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:12,706 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:56:12,706 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:56:12,706 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:56:12,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:56:12,718 INFO L201 PluginConnector]: Adding new model queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:12 BoogieIcfgContainer [2025-04-26 16:56:12,718 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:12,719 INFO L158 Benchmark]: Toolchain (without parser) took 2716.14ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 86.3MB in the beginning and 52.0MB in the end (delta: 34.3MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB. [2025-04-26 16:56:12,719 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:12,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.40ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:12,720 INFO L158 Benchmark]: Boogie Preprocessor took 25.05ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.4MB in the end (delta: 984.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:12,720 INFO L158 Benchmark]: RCFGBuilder took 206.36ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 73.7MB in the end (delta: 9.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:56:12,720 INFO L158 Benchmark]: BuchiAutomizer took 2451.95ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.6MB in the beginning and 52.0MB in the end (delta: 21.6MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. [2025-04-26 16:56:12,721 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.16ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.40ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 84.4MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.05ms. Allocated memory is still 159.4MB. Free memory was 84.4MB in the beginning and 83.4MB in the end (delta: 984.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 206.36ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 73.7MB in the end (delta: 9.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2451.95ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.6MB in the beginning and 52.0MB in the end (delta: 21.6MB). Peak memory consumption was 8.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 47 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 40 mSDtfsCounter, 47 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital61 mio100 ax100 hnf100 lsp69 ukn94 mio100 lsp74 div100 bol114 ite100 ukn100 eq168 hnf92 smp100 dnf226 smp70 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 80ms VariablesStem: 4 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 158, Number of transitions in reduction automaton: 84, Number of states in reduction automaton: 64, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 3 locations. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:56:12,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...