/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/queue-add-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:49,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:49,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:23:49,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:49,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:49,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:49,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:49,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:49,583 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:49,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:49,583 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:49,583 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:49,583 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:49,583 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:49,583 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:49,583 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:49,583 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:49,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:49,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:49,584 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:49,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:49,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:49,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:49,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:49,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:49,584 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:49,584 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:49,585 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:49,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:49,585 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:49,585 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:49,585 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:49,585 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:49,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:49,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:49,585 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:49,585 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:49,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:49,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:49,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:49,811 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:49,811 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:49,813 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:23:49,813 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:23:49,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:49,833 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:49,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:49,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:49,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:49,842 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:23:49" (1/1) ... [2025-04-26 16:23:49,857 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:23:49" (1/1) ... [2025-04-26 16:23:49,861 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:49,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:49,863 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:49,863 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:49,863 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:49,867 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:23:49" (1/1) ... [2025-04-26 16:23:49,868 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:23:49" (1/1) ... [2025-04-26 16:23:49,869 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:23:49" (1/1) ... [2025-04-26 16:23:49,869 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:23:49" (1/1) ... [2025-04-26 16:23:49,870 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:23:49" (1/1) ... [2025-04-26 16:23:49,870 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:23:49" (1/1) ... [2025-04-26 16:23:49,872 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:23:49" (1/1) ... [2025-04-26 16:23:49,872 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:23:49" (1/1) ... [2025-04-26 16:23:49,873 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:23:49" (1/1) ... [2025-04-26 16:23:49,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:49,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:49,884 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:49,884 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:49,885 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:23:49" (1/1) ... [2025-04-26 16:23:49,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:49,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:49,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:49,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:23:49,938 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:49,938 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:49,938 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:49,939 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:49,939 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:49,939 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:49,940 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:49,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:49,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:49,940 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:23:49,979 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:49,980 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:50,055 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:50,056 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:50,078 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:50,078 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:50,079 INFO L201 PluginConnector]: Adding new model queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:50 BoogieIcfgContainer [2025-04-26 16:23:50,079 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:50,080 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:50,080 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:50,087 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:50,088 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:50,088 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:23:49" (1/2) ... [2025-04-26 16:23:50,089 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25aa39c and model type queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:23:50, skipping insertion in model container [2025-04-26 16:23:50,089 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:50,089 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:23:50" (2/2) ... [2025-04-26 16:23:50,091 INFO L376 chiAutomizerObserver]: Analyzing ICFG queue-add-2.wvr.bpl [2025-04-26 16:23:50,124 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:23:50,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 28 transitions, 70 flow [2025-04-26 16:23:50,183 INFO L116 PetriNetUnfolderBase]: 2/24 cut-off events. [2025-04-26 16:23:50,184 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:23:50,189 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:23:50,189 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 28 transitions, 70 flow [2025-04-26 16:23:50,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 24 transitions, 60 flow [2025-04-26 16:23:50,192 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 24 transitions, 60 flow [2025-04-26 16:23:50,202 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:50,202 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:50,202 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:50,202 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:50,202 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:50,202 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:50,202 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:50,202 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:50,203 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:50,233 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 47 [2025-04-26 16:23:50,234 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:50,234 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:50,238 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:23:50,238 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:50,238 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:50,238 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 77 states, but on-demand construction may add more states [2025-04-26 16:23:50,242 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 47 [2025-04-26 16:23:50,242 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:50,242 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:50,242 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:23:50,242 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:23:50,248 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:23:50,249 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:23:50,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:50,253 INFO L85 PathProgramCache]: Analyzing trace with hash 89065, now seen corresponding path program 1 times [2025-04-26 16:23:50,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:50,259 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155645773] [2025-04-26 16:23:50,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:50,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:50,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:50,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:50,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,328 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:50,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:50,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:50,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:50,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:50,352 INFO L85 PathProgramCache]: Analyzing trace with hash 95395, now seen corresponding path program 1 times [2025-04-26 16:23:50,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:50,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726670157] [2025-04-26 16:23:50,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:50,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:50,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:50,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:50,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,362 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:50,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:50,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:50,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:50,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:50,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1641566277, now seen corresponding path program 1 times [2025-04-26 16:23:50,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:50,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449920253] [2025-04-26 16:23:50,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:50,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:50,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:50,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:50,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,373 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:50,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:50,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:50,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:50,493 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:50,493 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:50,493 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:50,494 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:50,494 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:50,494 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:50,494 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:50,494 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:50,494 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:23:50,494 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:50,494 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:50,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:50,527 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:50,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:50,612 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:50,615 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:50,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:50,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:50,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:50,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:23:50,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:50,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:50,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:50,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:50,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:50,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:50,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:50,651 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:50,666 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:23:50,666 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:50,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:50,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:50,670 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:50,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:23:50,672 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:50,691 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:23:50,691 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:50,695 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:50,695 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:23:50,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:23:50,704 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:50,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:50,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:50,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:50,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:50,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:50,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:50,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:23:50,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:23:50,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:50,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:50,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:50,873 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:50,875 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 77 states, but on-demand construction may add more states 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:23:51,006 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 77 states, but on-demand construction may add more states. 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 182 states and 422 transitions. Complement of second has 7 states. [2025-04-26 16:23:51,007 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:23:51,012 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:23:51,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-04-26 16:23:51,022 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 3 letters. Loop has 3 letters. [2025-04-26 16:23:51,023 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:51,023 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 6 letters. Loop has 3 letters. [2025-04-26 16:23:51,024 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:51,024 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 53 transitions. Stem has 3 letters. Loop has 6 letters. [2025-04-26 16:23:51,024 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:51,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 422 transitions. [2025-04-26 16:23:51,036 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:51,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 107 states and 251 transitions. [2025-04-26 16:23:51,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2025-04-26 16:23:51,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2025-04-26 16:23:51,041 INFO L74 IsDeterministic]: Start isDeterministic. Operand 107 states and 251 transitions. [2025-04-26 16:23:51,041 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:51,041 INFO L218 hiAutomatonCegarLoop]: Abstraction has 107 states and 251 transitions. [2025-04-26 16:23:51,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 251 transitions. [2025-04-26 16:23:51,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 90. [2025-04-26 16:23:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 90 states have (on average 2.3555555555555556) internal successors, (in total 212), 89 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 212 transitions. [2025-04-26 16:23:51,061 INFO L240 hiAutomatonCegarLoop]: Abstraction has 90 states and 212 transitions. [2025-04-26 16:23:51,061 INFO L438 stractBuchiCegarLoop]: Abstraction has 90 states and 212 transitions. [2025-04-26 16:23:51,061 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:51,061 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 212 transitions. [2025-04-26 16:23:51,062 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 32 [2025-04-26 16:23:51,062 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:51,063 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:51,063 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:51,063 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:51,063 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]" "[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:23:51,063 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:23:51,064 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,064 INFO L85 PathProgramCache]: Analyzing trace with hash 85612958, now seen corresponding path program 1 times [2025-04-26 16:23:51,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,064 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850575882] [2025-04-26 16:23:51,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:51,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:51,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:51,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,068 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:51,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:51,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:51,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:51,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,071 INFO L85 PathProgramCache]: Analyzing trace with hash 3203556, now seen corresponding path program 1 times [2025-04-26 16:23:51,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253774206] [2025-04-26 16:23:51,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:51,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:51,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:51,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,079 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:51,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:51,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:51,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:51,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,086 INFO L85 PathProgramCache]: Analyzing trace with hash -686086911, now seen corresponding path program 1 times [2025-04-26 16:23:51,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457611167] [2025-04-26 16:23:51,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:51,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:51,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:51,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:51,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:51,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457611167] [2025-04-26 16:23:51,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457611167] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:51,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:51,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:23:51,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411045829] [2025-04-26 16:23:51,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:51,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:51,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:23:51,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:23:51,248 INFO L87 Difference]: Start difference. First operand 90 states and 212 transitions. cyclomatic complexity: 134 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:51,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:51,271 INFO L93 Difference]: Finished difference Result 109 states and 240 transitions. [2025-04-26 16:23:51,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 240 transitions. [2025-04-26 16:23:51,273 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:23:51,279 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 109 states and 240 transitions. [2025-04-26 16:23:51,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2025-04-26 16:23:51,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2025-04-26 16:23:51,280 INFO L74 IsDeterministic]: Start isDeterministic. Operand 109 states and 240 transitions. [2025-04-26 16:23:51,280 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:51,280 INFO L218 hiAutomatonCegarLoop]: Abstraction has 109 states and 240 transitions. [2025-04-26 16:23:51,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states and 240 transitions. [2025-04-26 16:23:51,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-04-26 16:23:51,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 109 states have (on average 2.2018348623853212) internal successors, (in total 240), 108 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:51,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 240 transitions. [2025-04-26 16:23:51,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 109 states and 240 transitions. [2025-04-26 16:23:51,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:23:51,293 INFO L438 stractBuchiCegarLoop]: Abstraction has 109 states and 240 transitions. [2025-04-26 16:23:51,293 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:51,294 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 240 transitions. [2025-04-26 16:23:51,295 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:23:51,295 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:51,295 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:51,295 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:51,295 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:51,298 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]" "[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:23:51,298 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:23:51,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1293132150, now seen corresponding path program 1 times [2025-04-26 16:23:51,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,299 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431113146] [2025-04-26 16:23:51,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:51,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:51,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:51,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,305 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:51,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:51,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:51,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:51,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,315 INFO L85 PathProgramCache]: Analyzing trace with hash 3203556, now seen corresponding path program 2 times [2025-04-26 16:23:51,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941963248] [2025-04-26 16:23:51,315 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:51,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,318 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:51,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:51,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:51,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,321 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:51,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:51,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:51,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:51,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1857498131, now seen corresponding path program 1 times [2025-04-26 16:23:51,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558536740] [2025-04-26 16:23:51,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:51,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:51,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:51,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:51,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:51,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:51,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:51,500 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:51,500 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:51,500 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:51,500 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:51,500 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:51,500 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:51,500 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:51,500 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:51,501 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:23:51,501 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:51,501 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:51,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:51,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:51,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:51,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:51,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:51,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:51,734 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:51,735 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:51,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:51,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:51,738 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:51,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:23:51,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:51,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:51,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:51,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:51,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:51,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:51,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:51,754 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:51,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:23:51,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:51,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:51,762 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:51,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:23:51,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:51,775 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:51,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:51,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:51,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:51,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:51,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:51,783 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:51,795 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:23:51,795 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:51,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:51,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:51,797 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:51,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:23:51,800 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:51,817 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:23:51,817 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:51,818 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:51,818 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2025-04-26 16:23:51,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:23:51,824 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:51,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:51,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:51,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:51,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:51,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:51,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:51,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:51,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:51,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:51,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:51,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:51,898 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:51,898 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 240 transitions. cyclomatic complexity: 142 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:51,919 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 240 transitions. cyclomatic complexity: 142. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 264 states and 556 transitions. Complement of second has 5 states. [2025-04-26 16:23:51,921 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:51,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:51,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2025-04-26 16:23:51,922 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:23:51,922 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:51,923 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:23:51,923 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:51,923 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 31 transitions. Stem has 8 letters. Loop has 8 letters. [2025-04-26 16:23:51,923 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:51,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 264 states and 556 transitions. [2025-04-26 16:23:51,926 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:23:51,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 264 states to 194 states and 430 transitions. [2025-04-26 16:23:51,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2025-04-26 16:23:51,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2025-04-26 16:23:51,928 INFO L74 IsDeterministic]: Start isDeterministic. Operand 194 states and 430 transitions. [2025-04-26 16:23:51,928 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:51,928 INFO L218 hiAutomatonCegarLoop]: Abstraction has 194 states and 430 transitions. [2025-04-26 16:23:51,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 430 transitions. [2025-04-26 16:23:51,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 161. [2025-04-26 16:23:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 161 states have (on average 2.2919254658385095) internal successors, (in total 369), 160 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:51,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 369 transitions. [2025-04-26 16:23:51,941 INFO L240 hiAutomatonCegarLoop]: Abstraction has 161 states and 369 transitions. [2025-04-26 16:23:51,941 INFO L438 stractBuchiCegarLoop]: Abstraction has 161 states and 369 transitions. [2025-04-26 16:23:51,941 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:23:51,941 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 369 transitions. [2025-04-26 16:23:51,942 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 28 [2025-04-26 16:23:51,942 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:51,942 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:51,943 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:51,943 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:51,943 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[]" "[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]" "[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:23:51,943 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:23:51,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1292638170, now seen corresponding path program 2 times [2025-04-26 16:23:51,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182940296] [2025-04-26 16:23:51,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:51,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:51,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:51,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:51,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,950 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:51,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:51,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:51,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:51,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,953 INFO L85 PathProgramCache]: Analyzing trace with hash 3203556, now seen corresponding path program 3 times [2025-04-26 16:23:51,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294223643] [2025-04-26 16:23:51,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:51,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:51,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:51,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:51,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,957 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:51,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:51,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:51,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,962 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:51,962 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:51,962 INFO L85 PathProgramCache]: Analyzing trace with hash -923127927, now seen corresponding path program 2 times [2025-04-26 16:23:51,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:51,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049806528] [2025-04-26 16:23:51,962 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:51,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:51,964 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:51,970 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:51,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:51,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,970 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:51,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:51,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:51,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:51,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:51,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:52,105 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:52,105 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:52,105 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:52,105 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:52,105 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:52,106 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,106 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:52,106 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:52,106 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:23:52,106 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:52,106 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:52,107 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,137 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,139 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,141 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,147 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,313 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:52,313 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:52,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:52,315 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:52,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:23:52,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:52,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:52,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:52,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:52,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:52,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:52,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:52,338 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:52,350 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:23:52,350 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:23:52,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:52,354 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:52,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:23:52,356 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:52,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:52,374 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:52,374 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:52,374 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2025-04-26 16:23:52,380 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:23:52,381 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:52,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:52,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:52,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:52,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:52,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:52,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:52,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:52,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:52,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:52,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:52,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:52,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:52,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:52,447 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:52,448 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 161 states and 369 transitions. cyclomatic complexity: 225 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:52,464 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 161 states and 369 transitions. cyclomatic complexity: 225. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 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 185 states and 417 transitions. Complement of second has 4 states. [2025-04-26 16:23:52,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:52,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:52,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-04-26 16:23:52,465 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:23:52,465 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:52,465 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:23:52,465 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:52,466 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 8 letters. Loop has 8 letters. [2025-04-26 16:23:52,466 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:52,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 185 states and 417 transitions. [2025-04-26 16:23:52,470 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2025-04-26 16:23:52,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 185 states to 129 states and 284 transitions. [2025-04-26 16:23:52,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2025-04-26 16:23:52,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-04-26 16:23:52,471 INFO L74 IsDeterministic]: Start isDeterministic. Operand 129 states and 284 transitions. [2025-04-26 16:23:52,471 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:52,472 INFO L218 hiAutomatonCegarLoop]: Abstraction has 129 states and 284 transitions. [2025-04-26 16:23:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 284 transitions. [2025-04-26 16:23:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-04-26 16:23:52,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 2.201550387596899) internal successors, (in total 284), 128 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:52,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 284 transitions. [2025-04-26 16:23:52,484 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 284 transitions. [2025-04-26 16:23:52,484 INFO L438 stractBuchiCegarLoop]: Abstraction has 129 states and 284 transitions. [2025-04-26 16:23:52,484 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:23:52,484 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 284 transitions. [2025-04-26 16:23:52,485 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2025-04-26 16:23:52,485 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:52,485 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:52,485 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:52,485 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:52,485 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[]" "[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]" "[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]" [2025-04-26 16:23:52,485 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:23:52,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:52,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1291714648, now seen corresponding path program 1 times [2025-04-26 16:23:52,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:52,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345238898] [2025-04-26 16:23:52,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:52,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:52,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:52,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:52,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:52,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:52,495 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:52,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:52,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:52,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:52,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:52,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:52,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:52,502 INFO L85 PathProgramCache]: Analyzing trace with hash 3203556, now seen corresponding path program 4 times [2025-04-26 16:23:52,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:52,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465690228] [2025-04-26 16:23:52,502 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:52,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:52,505 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 4 statements into 2 equivalence classes. [2025-04-26 16:23:52,508 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:52,508 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:52,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:52,509 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:52,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:52,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:52,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:52,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:52,514 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:52,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:52,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1565308427, now seen corresponding path program 1 times [2025-04-26 16:23:52,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:52,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292173795] [2025-04-26 16:23:52,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:52,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:52,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:52,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:52,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:52,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:52,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:52,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:52,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:52,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:52,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:52,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:52,650 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:52,651 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:52,651 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:52,651 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:52,651 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:52,651 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,651 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:52,651 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:52,651 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:23:52,651 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:52,651 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:52,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,843 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:52,843 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:52,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:52,845 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:52,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:23:52,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:52,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:52,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:52,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:52,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:52,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:52,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:52,861 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:52,866 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:23:52,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:52,868 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:52,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:23:52,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:52,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:52,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:52,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:52,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:52,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:52,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:52,884 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:52,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:23:52,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:52,892 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:52,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:23:52,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:52,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:52,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:52,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:52,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:52,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:52,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:52,908 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:52,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:52,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:52,916 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:52,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:23:52,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:52,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:52,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:52,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:52,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:52,935 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:52,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:52,939 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:52,947 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:23:52,947 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:23:52,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:52,949 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:52,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:23:52,953 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:52,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:23:52,973 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:52,973 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:52,973 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2025-04-26 16:23:52,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:23:52,980 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:52,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:52,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:52,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:52,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:52,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:52,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:52,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:53,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:53,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:53,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:53,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:53,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:53,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:53,032 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:53,032 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 284 transitions. cyclomatic complexity: 168 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:53,051 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 284 transitions. cyclomatic complexity: 168. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 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 386 states and 825 transitions. Complement of second has 5 states. [2025-04-26 16:23:53,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2025-04-26 16:23:53,054 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:23:53,054 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:53,054 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 12 letters. Loop has 4 letters. [2025-04-26 16:23:53,054 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:53,054 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 8 letters. Loop has 8 letters. [2025-04-26 16:23:53,055 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:53,055 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 386 states and 825 transitions. [2025-04-26 16:23:53,058 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2025-04-26 16:23:53,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 386 states to 295 states and 631 transitions. [2025-04-26 16:23:53,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2025-04-26 16:23:53,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2025-04-26 16:23:53,060 INFO L74 IsDeterministic]: Start isDeterministic. Operand 295 states and 631 transitions. [2025-04-26 16:23:53,060 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:53,060 INFO L218 hiAutomatonCegarLoop]: Abstraction has 295 states and 631 transitions. [2025-04-26 16:23:53,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 631 transitions. [2025-04-26 16:23:53,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 165. [2025-04-26 16:23:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 165 states have (on average 2.16969696969697) internal successors, (in total 358), 164 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 358 transitions. [2025-04-26 16:23:53,077 INFO L240 hiAutomatonCegarLoop]: Abstraction has 165 states and 358 transitions. [2025-04-26 16:23:53,077 INFO L438 stractBuchiCegarLoop]: Abstraction has 165 states and 358 transitions. [2025-04-26 16:23:53,077 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:23:53,077 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 358 transitions. [2025-04-26 16:23:53,078 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2025-04-26 16:23:53,078 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:53,078 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:53,079 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:53,079 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:23:53,080 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[]" "[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]" "[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]" "[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[]" "[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]" "[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]" [2025-04-26 16:23:53,080 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:23:53,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:53,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1348170046, now seen corresponding path program 1 times [2025-04-26 16:23:53,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:53,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205901970] [2025-04-26 16:23:53,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:53,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:53,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:53,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:53,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:53,084 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:53,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:53,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:53,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:53,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:53,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:53,088 INFO L85 PathProgramCache]: Analyzing trace with hash 3203556, now seen corresponding path program 5 times [2025-04-26 16:23:53,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:53,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086603224] [2025-04-26 16:23:53,089 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:23:53,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:53,093 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:53,094 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:53,094 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:53,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:53,094 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:53,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:53,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:53,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:53,102 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:53,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:53,105 INFO L85 PathProgramCache]: Analyzing trace with hash -423138143, now seen corresponding path program 1 times [2025-04-26 16:23:53,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:53,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190024730] [2025-04-26 16:23:53,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:53,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:53,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:53,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:53,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:53,113 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:53,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:23:53,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:23:53,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:53,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:53,267 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:53,267 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:53,267 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:53,268 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:53,268 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:53,268 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:53,268 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:53,268 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:53,268 INFO L132 ssoRankerPreferences]: Filename of dumped script: queue-add-2.wvr.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:23:53,268 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:53,268 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:53,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:53,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:53,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:53,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:53,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:53,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:53,456 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:53,456 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:53,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:53,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:53,458 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:53,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:23:53,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:53,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:53,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:53,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:53,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:53,470 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:53,470 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:53,473 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:53,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:23:53,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:53,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:53,480 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:53,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:23:53,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:53,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:53,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:53,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:53,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:53,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:53,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:53,497 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:53,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:23:53,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:53,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:53,504 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:53,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:23:53,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:53,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:53,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:53,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:53,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:53,519 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:53,519 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:53,522 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:53,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:23:53,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:53,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:53,530 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:53,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:23:53,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:53,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:53,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:53,543 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:23:53,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:53,559 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 16:23:53,559 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:23:53,587 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:53,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:53,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:53,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:53,596 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:53,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:23:53,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:53,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:53,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:53,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:53,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:53,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:53,613 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:53,617 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:53,624 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:23:53,624 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:23:53,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:53,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:53,627 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:53,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:23:53,629 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:53,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:23:53,646 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:53,646 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:53,646 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(q_back, q_front) = 1*q_back - 1*q_front Supporting invariants [] [2025-04-26 16:23:53,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:53,661 INFO L156 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:23:53,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:53,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:53,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:53,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:53,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:53,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:53,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:53,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:53,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:53,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:53,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:53,719 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:53,719 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 165 states and 358 transitions. cyclomatic complexity: 206 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:53,732 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 165 states and 358 transitions. cyclomatic complexity: 206. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 318 states and 679 transitions. Complement of second has 5 states. [2025-04-26 16:23:53,733 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:53,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2025-04-26 16:23:53,734 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 26 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:23:53,734 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:53,734 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:53,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:53,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:53,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:53,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:53,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:53,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:53,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:53,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:53,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:53,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:53,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:53,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:53,798 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:53,798 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 165 states and 358 transitions. cyclomatic complexity: 206 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:53,827 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 165 states and 358 transitions. cyclomatic complexity: 206. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 458 states and 977 transitions. Complement of second has 7 states. [2025-04-26 16:23:53,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:53,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2025-04-26 16:23:53,828 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:23:53,828 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:53,828 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:53,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:53,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:53,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:53,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:53,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:53,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:53,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:23:53,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:23:53,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:53,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:53,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:53,872 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:23:53,872 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 165 states and 358 transitions. cyclomatic complexity: 206 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:53,890 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 165 states and 358 transitions. cyclomatic complexity: 206. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 349 states and 747 transitions. Complement of second has 5 states. [2025-04-26 16:23:53,891 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:53,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2025-04-26 16:23:53,892 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:23:53,892 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:53,892 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 15 letters. Loop has 4 letters. [2025-04-26 16:23:53,892 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:53,892 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 11 letters. Loop has 8 letters. [2025-04-26 16:23:53,892 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:53,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 747 transitions. [2025-04-26 16:23:53,899 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:53,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 0 states and 0 transitions. [2025-04-26 16:23:53,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:23:53,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:23:53,899 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:23:53,899 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:53,900 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:53,900 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:53,900 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:53,900 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:23:53,900 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:23:53,900 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:53,900 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:23:53,906 INFO L201 PluginConnector]: Adding new model queue-add-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:53 BoogieIcfgContainer [2025-04-26 16:23:53,906 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:53,907 INFO L158 Benchmark]: Toolchain (without parser) took 4073.34ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.4MB in the beginning and 54.7MB in the end (delta: 31.7MB). Peak memory consumption was 29.3MB. Max. memory is 8.0GB. [2025-04-26 16:23:53,907 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.76ms. 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:23:53,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.62ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 83.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:53,908 INFO L158 Benchmark]: Boogie Preprocessor took 20.00ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 82.8MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:23:53,908 INFO L158 Benchmark]: RCFGBuilder took 195.20ms. Allocated memory is still 159.4MB. Free memory was 82.8MB in the beginning and 73.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:23:53,908 INFO L158 Benchmark]: BuchiAutomizer took 3826.11ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.0MB in the beginning and 54.7MB in the end (delta: 18.3MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. [2025-04-26 16:23:53,909 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.76ms. 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 28.62ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 83.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 20.00ms. Allocated memory is still 159.4MB. Free memory was 83.8MB in the beginning and 82.8MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 195.20ms. Allocated memory is still 159.4MB. Free memory was 82.8MB in the beginning and 73.1MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3826.11ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.0MB in the beginning and 54.7MB in the end (delta: 18.3MB). Peak memory consumption was 16.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 180 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 128 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital62 mio100 ax100 hnf100 lsp72 ukn97 mio100 lsp71 div100 bol116 ite100 ukn100 eq171 hnf92 smp100 dnf251 smp64 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 59ms 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.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 4 deterministic, 1 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. One deterministic module has affine ranking function q_back + -1 * q_front and consists of 3 locations. One nondeterministic module has affine ranking function q_back + -1 * q_front and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these 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:23:53,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...