/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/POPL2023/work-steal2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:49,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:49,746 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:21:49,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:49,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:49,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:49,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:49,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:49,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:49,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:49,771 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:49,771 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:49,771 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:49,771 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:49,771 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:49,772 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:49,772 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:49,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:49,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:49,772 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:49,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:49,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:49,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:49,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:49,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:49,772 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:49,772 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:49,772 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:49,772 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:49,772 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:49,774 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:49,774 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:49,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:49,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:49,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:49,774 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:49,774 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:50,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:50,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:50,040 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:50,041 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:50,041 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:50,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/work-steal2.bpl [2025-04-26 16:21:50,043 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/work-steal2.bpl' [2025-04-26 16:21:50,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:50,059 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:50,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:50,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:50,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:50,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,108 INFO L138 Inliner]: procedures = 4, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2025-04-26 16:21:50,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:50,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:50,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:50,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:50,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,120 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:50,141 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:50,141 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:50,141 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:50,141 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/1) ... [2025-04-26 16:21:50,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:50,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:50,168 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:21:50,170 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:21:50,192 INFO L124 BoogieDeclarations]: Specification and implementation of procedure workerWithAssert given in one single declaration [2025-04-26 16:21:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure workerWithAssert [2025-04-26 16:21:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure workerWithAssert [2025-04-26 16:21:50,192 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:50,193 INFO L124 BoogieDeclarations]: Specification and implementation of procedure worker given in one single declaration [2025-04-26 16:21:50,193 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-04-26 16:21:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-04-26 16:21:50,194 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:21:50,233 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:50,235 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:50,330 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:50,331 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:50,391 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:50,391 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-26 16:21:50,392 INFO L201 PluginConnector]: Adding new model work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:50 BoogieIcfgContainer [2025-04-26 16:21:50,392 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:50,392 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:50,392 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:50,401 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:50,401 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:50,401 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:50" (1/2) ... [2025-04-26 16:21:50,402 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62feeaaa and model type work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:50, skipping insertion in model container [2025-04-26 16:21:50,402 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:50,402 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:50" (2/2) ... [2025-04-26 16:21:50,404 INFO L376 chiAutomizerObserver]: Analyzing ICFG work-steal2.bpl [2025-04-26 16:21:50,457 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:21:50,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 32 transitions, 72 flow [2025-04-26 16:21:50,509 INFO L116 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-04-26 16:21:50,511 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-26 16:21:50,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 4/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-26 16:21:50,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 32 transitions, 72 flow [2025-04-26 16:21:50,518 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 62 flow [2025-04-26 16:21:50,518 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 31 places, 28 transitions, 62 flow [2025-04-26 16:21:50,525 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:50,526 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:50,526 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:50,526 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:50,526 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:50,526 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:50,526 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:50,526 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:50,527 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:50,591 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 216 [2025-04-26 16:21:50,591 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:50,591 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:50,594 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:50,594 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:50,594 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:50,594 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 233 states, but on-demand construction may add more states [2025-04-26 16:21:50,600 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 216 [2025-04-26 16:21:50,600 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:50,600 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:50,600 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:50,601 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:50,605 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" [2025-04-26 16:21:50,605 INFO L754 eck$LassoCheckResult]: Loop: "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" [2025-04-26 16:21:50,609 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:50,609 INFO L85 PathProgramCache]: Analyzing trace with hash 128782, now seen corresponding path program 1 times [2025-04-26 16:21:50,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:50,615 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630853414] [2025-04-26 16:21:50,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:50,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:50,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:50,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:50,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,659 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:50,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:50,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:50,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:50,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:50,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1838304007, now seen corresponding path program 1 times [2025-04-26 16:21:50,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:50,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50845633] [2025-04-26 16:21:50,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:50,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:50,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:50,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:50,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,701 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:50,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:50,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:50,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:50,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1797711124, now seen corresponding path program 1 times [2025-04-26 16:21:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:50,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910296461] [2025-04-26 16:21:50,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:50,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:50,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:21:50,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:21:50,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,737 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:50,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:21:50,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:21:50,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:50,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:50,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:50,972 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:50,973 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:50,973 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:50,973 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:50,973 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:50,973 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:50,973 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:50,973 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:50,974 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:50,974 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:50,974 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:50,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:50,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:50,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:51,198 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:51,200 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:51,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,204 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:21:51,205 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:21:51,207 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:21:51,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:51,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:51,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:51,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:51,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:51,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:51,231 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:51,236 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:21:51,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,238 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:21:51,239 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:21:51,241 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:21:51,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:51,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:51,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:51,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:51,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:51,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:51,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:51,254 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:51,260 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:21:51,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,262 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:21:51,263 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:21:51,264 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:21:51,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:51,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:51,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:51,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:51,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:51,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:51,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:51,277 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:51,282 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:21:51,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,284 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:21:51,285 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:21:51,286 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:21:51,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:51,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:51,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:51,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:51,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:51,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:51,310 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:51,321 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:21:51,322 INFO L437 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:51,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:51,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:51,326 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:21:51,327 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:21:51,328 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:51,345 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:21:51,346 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:51,346 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:51,346 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2025-04-26 16:21:51,356 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:21:51,358 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:51,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:51,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:51,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:51,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:51,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:51,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:51,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:51,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:51,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:21:51,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:51,694 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:21:51,719 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 16:21:51,721 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 233 states, but on-demand construction may add more states Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (in total 11), 6 states have internal predecessors, (11), 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:21:51,878 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 233 states, but on-demand construction may add more states. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (in total 11), 6 states have internal predecessors, (11), 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 553 states and 1420 transitions. Complement of second has 9 states. [2025-04-26 16:21:51,880 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:21:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (in total 11), 6 states have internal predecessors, (11), 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:21:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2025-04-26 16:21:51,889 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 3 letters. Loop has 8 letters. [2025-04-26 16:21:51,889 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:51,890 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 11 letters. Loop has 8 letters. [2025-04-26 16:21:51,890 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:51,890 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 44 transitions. Stem has 3 letters. Loop has 16 letters. [2025-04-26 16:21:51,890 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:51,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 553 states and 1420 transitions. [2025-04-26 16:21:51,899 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:51,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 553 states to 386 states and 984 transitions. [2025-04-26 16:21:51,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 299 [2025-04-26 16:21:51,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 324 [2025-04-26 16:21:51,908 INFO L74 IsDeterministic]: Start isDeterministic. Operand 386 states and 984 transitions. [2025-04-26 16:21:51,908 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:51,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 386 states and 984 transitions. [2025-04-26 16:21:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states and 984 transitions. [2025-04-26 16:21:51,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 332. [2025-04-26 16:21:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 332 states have (on average 2.6144578313253013) internal successors, (in total 868), 331 states have internal predecessors, (868), 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:21:51,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 868 transitions. [2025-04-26 16:21:51,939 INFO L240 hiAutomatonCegarLoop]: Abstraction has 332 states and 868 transitions. [2025-04-26 16:21:51,939 INFO L438 stractBuchiCegarLoop]: Abstraction has 332 states and 868 transitions. [2025-04-26 16:21:51,939 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:51,939 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 332 states and 868 transitions. [2025-04-26 16:21:51,941 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:51,941 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:51,941 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:51,941 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:21:51,941 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:51,942 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[105] L38-->L41: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:21:51,942 INFO L754 eck$LassoCheckResult]: Loop: "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" [2025-04-26 16:21:51,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,942 INFO L85 PathProgramCache]: Analyzing trace with hash 123763606, now seen corresponding path program 1 times [2025-04-26 16:21:51,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:51,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092056173] [2025-04-26 16:21:51,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:51,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:51,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:51,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:51,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,946 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:51,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:51,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:51,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:51,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,948 INFO L85 PathProgramCache]: Analyzing trace with hash -602664729, now seen corresponding path program 1 times [2025-04-26 16:21:51,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:51,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572667823] [2025-04-26 16:21:51,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:51,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:51,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:51,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:51,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,960 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:51,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:51,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:51,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:51,968 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:51,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1331812484, now seen corresponding path program 1 times [2025-04-26 16:21:51,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:51,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728974098] [2025-04-26 16:21:51,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:51,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:51,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:21:51,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:21:51,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,975 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:51,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:21:51,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:21:51,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:51,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:51,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:52,087 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:52,087 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:52,087 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:52,087 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:52,087 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:52,087 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,087 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:52,087 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:52,087 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:21:52,087 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:52,088 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:52,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,111 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:52,254 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:52,255 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:52,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,256 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:21:52,258 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:21:52,259 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:21:52,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,276 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:21:52,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,284 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:21:52,286 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:21:52,287 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:21:52,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:52,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:52,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:52,299 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:21:52,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,307 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:21:52,309 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:21:52,310 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:21:52,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:52,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,321 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:52,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:52,322 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,327 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:21:52,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,329 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:21:52,331 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:21:52,332 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:21:52,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:52,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:52,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:52,347 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:52,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,356 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:21:52,356 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:21:52,357 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:21:52,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:52,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:52,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:52,369 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:21:52,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,376 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:21:52,377 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:21:52,378 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:21:52,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,392 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,398 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:21:52,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,400 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:21:52,402 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:21:52,403 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:21:52,414 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:52,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:52,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:52,415 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:52,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,424 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:21:52,425 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:21:52,427 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:21:52,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,442 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:52,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,451 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:21:52,452 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:21:52,454 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:21:52,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:52,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:52,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:52,466 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:52,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,474 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:21:52,475 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:21:52,478 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:21:52,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:52,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,488 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:52,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:52,490 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,496 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:21:52,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,498 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:21:52,500 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:21:52,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:52,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:52,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:52,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:52,512 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:52,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 16:21:52,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,520 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:21:52,520 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:21:52,522 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:21:52,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:52,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:52,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:52,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:52,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:52,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:52,540 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:52,549 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:21:52,549 INFO L437 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:21:52,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:52,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:52,552 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:21:52,552 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:21:52,553 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:52,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:52,570 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:52,570 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:52,570 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(cnt, N) = -1*cnt + 1*N Supporting invariants [] [2025-04-26 16:21:52,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:21:52,577 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:52,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:21:52,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:21:52,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:52,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:52,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:52,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:52,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:52,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:52,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:21:52,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:52,770 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:21:52,770 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 16:21:52,771 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 332 states and 868 transitions. cyclomatic complexity: 555 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (in total 13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:52,865 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 332 states and 868 transitions. cyclomatic complexity: 555. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (in total 13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 471 states and 1195 transitions. Complement of second has 8 states. [2025-04-26 16:21:52,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:21:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (in total 13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:52,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2025-04-26 16:21:52,866 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 16:21:52,866 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:52,866 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 13 letters. Loop has 8 letters. [2025-04-26 16:21:52,867 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:52,867 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 57 transitions. Stem has 5 letters. Loop has 16 letters. [2025-04-26 16:21:52,867 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:52,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 471 states and 1195 transitions. [2025-04-26 16:21:52,875 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:52,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 471 states to 332 states and 844 transitions. [2025-04-26 16:21:52,877 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 270 [2025-04-26 16:21:52,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 270 [2025-04-26 16:21:52,878 INFO L74 IsDeterministic]: Start isDeterministic. Operand 332 states and 844 transitions. [2025-04-26 16:21:52,878 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:52,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 332 states and 844 transitions. [2025-04-26 16:21:52,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states and 844 transitions. [2025-04-26 16:21:52,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-04-26 16:21:52,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 332 states have (on average 2.5421686746987953) internal successors, (in total 844), 331 states have internal predecessors, (844), 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:21:52,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 844 transitions. [2025-04-26 16:21:52,897 INFO L240 hiAutomatonCegarLoop]: Abstraction has 332 states and 844 transitions. [2025-04-26 16:21:52,897 INFO L438 stractBuchiCegarLoop]: Abstraction has 332 states and 844 transitions. [2025-04-26 16:21:52,897 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:21:52,898 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 332 states and 844 transitions. [2025-04-26 16:21:52,899 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:52,899 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:52,899 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:52,900 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:52,900 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:52,900 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:21:52,900 INFO L754 eck$LassoCheckResult]: Loop: "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:21:52,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1322244573, now seen corresponding path program 1 times [2025-04-26 16:21:52,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:52,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799358074] [2025-04-26 16:21:52,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:52,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:52,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:52,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:52,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,906 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:52,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:52,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:52,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,910 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:52,910 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1105178277, now seen corresponding path program 2 times [2025-04-26 16:21:52,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:52,911 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484993988] [2025-04-26 16:21:52,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:21:52,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:52,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:52,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:52,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:21:52,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,917 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:52,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:52,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:52,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:52,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:52,926 INFO L85 PathProgramCache]: Analyzing trace with hash 417412477, now seen corresponding path program 1 times [2025-04-26 16:21:52,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:52,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699356196] [2025-04-26 16:21:52,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:52,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:52,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:21:52,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:21:52,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,938 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:52,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:21:52,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:21:52,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:52,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:52,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:53,112 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:53,112 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:53,112 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:53,112 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:53,112 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:53,112 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,113 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:53,113 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:53,113 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:21:53,113 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:53,113 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:53,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:53,510 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:53,510 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:53,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,513 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:53,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:21:53,515 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:21:53,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:53,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:53,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:53,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:53,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:53,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:53,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:53,527 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:53,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:21:53,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,535 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:53,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:21:53,539 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:21:53,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:53,549 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:21:53,550 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:53,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:53,568 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:21:53,568 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:53,592 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:53,623 INFO L436 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-04-26 16:21:53,623 INFO L437 ModelExtractionUtils]: 23 out of 36 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:21:53,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:53,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:53,625 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:53,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:21:53,632 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:53,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:53,650 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:21:53,650 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:53,650 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerThread1of1ForFork0_steal_num#1) = 3*N - 2*cnt + 2*workerThread1of1ForFork0_steal_num#1 Supporting invariants [3*N - 2*cnt >= 0] [2025-04-26 16:21:53,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:21:53,660 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:21:53,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:53,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:53,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:53,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:53,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:21:53,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:53,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:53,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:53,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:53,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:53,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:21:53,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:53,813 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:21:53,814 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 4 loop predicates [2025-04-26 16:21:53,814 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 332 states and 844 transitions. cyclomatic complexity: 531 Second operand has 8 states, 8 states have (on average 1.875) internal successors, (in total 15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:54,005 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 332 states and 844 transitions. cyclomatic complexity: 531. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (in total 15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 618 states and 1533 transitions. Complement of second has 17 states. [2025-04-26 16:21:54,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 4 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:21:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (in total 15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:21:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2025-04-26 16:21:54,007 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 62 transitions. Stem has 7 letters. Loop has 8 letters. [2025-04-26 16:21:54,007 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:54,007 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 62 transitions. Stem has 15 letters. Loop has 8 letters. [2025-04-26 16:21:54,007 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:54,007 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 62 transitions. Stem has 7 letters. Loop has 16 letters. [2025-04-26 16:21:54,007 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:54,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 618 states and 1533 transitions. [2025-04-26 16:21:54,012 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:54,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 618 states to 594 states and 1481 transitions. [2025-04-26 16:21:54,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 404 [2025-04-26 16:21:54,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 459 [2025-04-26 16:21:54,017 INFO L74 IsDeterministic]: Start isDeterministic. Operand 594 states and 1481 transitions. [2025-04-26 16:21:54,018 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:54,018 INFO L218 hiAutomatonCegarLoop]: Abstraction has 594 states and 1481 transitions. [2025-04-26 16:21:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states and 1481 transitions. [2025-04-26 16:21:54,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 458. [2025-04-26 16:21:54,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 458 states have (on average 2.561135371179039) internal successors, (in total 1173), 457 states have internal predecessors, (1173), 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:21:54,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1173 transitions. [2025-04-26 16:21:54,039 INFO L240 hiAutomatonCegarLoop]: Abstraction has 458 states and 1173 transitions. [2025-04-26 16:21:54,039 INFO L438 stractBuchiCegarLoop]: Abstraction has 458 states and 1173 transitions. [2025-04-26 16:21:54,039 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:21:54,039 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 458 states and 1173 transitions. [2025-04-26 16:21:54,041 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:54,041 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:54,041 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:54,042 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:54,042 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:54,042 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:21:54,042 INFO L754 eck$LassoCheckResult]: Loop: "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:21:54,043 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:54,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1842899289, now seen corresponding path program 1 times [2025-04-26 16:21:54,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:54,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979006847] [2025-04-26 16:21:54,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:54,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:54,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:54,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:54,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,054 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:54,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:54,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:54,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:54,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:54,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1105178277, now seen corresponding path program 3 times [2025-04-26 16:21:54,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:54,068 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020705596] [2025-04-26 16:21:54,068 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:21:54,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:54,074 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:54,080 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:54,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:21:54,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,081 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:54,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:54,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:54,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:54,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:54,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1991369217, now seen corresponding path program 1 times [2025-04-26 16:21:54,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:54,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769879082] [2025-04-26 16:21:54,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:54,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:54,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:21:54,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:21:54,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,107 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:54,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:21:54,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:21:54,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:54,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:54,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:54,462 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:54,462 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:54,462 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:54,462 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:54,462 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:54,462 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:54,462 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:54,462 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:54,462 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:21:54,462 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:54,462 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:54,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,473 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:54,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:55,068 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:21:55,297 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:55,297 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:55,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,302 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:55,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:21:55,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:21:55,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,317 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:55,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:55,319 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:21:55,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,328 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:21:55,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:21:55,330 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:21:55,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:55,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:55,343 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:55,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,351 INFO L229 MonitoredProcess]: Starting monitored process 25 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:21:55,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:21:55,352 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:21:55,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:55,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:55,366 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:21:55,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,374 INFO L229 MonitoredProcess]: Starting monitored process 26 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:21:55,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:21:55,377 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:21:55,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:55,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:55,391 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:55,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,399 INFO L229 MonitoredProcess]: Starting monitored process 27 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:21:55,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:21:55,401 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:21:55,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:55,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:55,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:55,412 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:21:55,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,419 INFO L229 MonitoredProcess]: Starting monitored process 28 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:21:55,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:21:55,421 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:21:55,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:55,432 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:55,434 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:55,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,443 INFO L229 MonitoredProcess]: Starting monitored process 29 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:21:55,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:21:55,444 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:21:55,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:55,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:55,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:55,456 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 16:21:55,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,463 INFO L229 MonitoredProcess]: Starting monitored process 30 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:21:55,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:21:55,465 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:21:55,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:55,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:55,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:55,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:55,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:55,476 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:55,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:21:55,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,483 INFO L229 MonitoredProcess]: Starting monitored process 31 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:21:55,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:21:55,484 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:21:55,494 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:55,494 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:21:55,494 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:55,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:55,510 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:21:55,511 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:55,539 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:55,572 INFO L436 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-04-26 16:21:55,573 INFO L437 ModelExtractionUtils]: 32 out of 46 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-04-26 16:21:55,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:55,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:55,574 INFO L229 MonitoredProcess]: Starting monitored process 32 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:21:55,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:21:55,576 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:55,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:21:55,592 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:21:55,593 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:55,593 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerThread1of1ForFork0_steal_num#1) = 3*N - 2*cnt + 2*workerThread1of1ForFork0_steal_num#1 Supporting invariants [-2*cnt + 3*N >= 0] [2025-04-26 16:21:55,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:21:55,606 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:21:55,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:55,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:55,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:55,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:55,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:55,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 16:21:55,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:55,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:55,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:55,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:55,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:55,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:21:55,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:55,857 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:21:55,858 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 4 loop predicates [2025-04-26 16:21:55,858 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 458 states and 1173 transitions. cyclomatic complexity: 740 Second operand has 10 states, 10 states have (on average 1.8) internal successors, (in total 18), 9 states have internal predecessors, (18), 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:21:56,115 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 458 states and 1173 transitions. cyclomatic complexity: 740. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (in total 18), 9 states have internal predecessors, (18), 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 1952 states and 4809 transitions. Complement of second has 19 states. [2025-04-26 16:21:56,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 6 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:21:56,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (in total 18), 9 states have internal predecessors, (18), 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:21:56,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 155 transitions. [2025-04-26 16:21:56,117 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 155 transitions. Stem has 10 letters. Loop has 8 letters. [2025-04-26 16:21:56,117 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:56,117 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 155 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:21:56,117 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:56,117 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 155 transitions. Stem has 10 letters. Loop has 16 letters. [2025-04-26 16:21:56,117 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:56,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1952 states and 4809 transitions. [2025-04-26 16:21:56,132 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:56,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1952 states to 1469 states and 3679 transitions. [2025-04-26 16:21:56,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 922 [2025-04-26 16:21:56,145 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1041 [2025-04-26 16:21:56,145 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1469 states and 3679 transitions. [2025-04-26 16:21:56,145 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:56,145 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1469 states and 3679 transitions. [2025-04-26 16:21:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states and 3679 transitions. [2025-04-26 16:21:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 635. [2025-04-26 16:21:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 635 states have (on average 2.606299212598425) internal successors, (in total 1655), 634 states have internal predecessors, (1655), 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:21:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1655 transitions. [2025-04-26 16:21:56,161 INFO L240 hiAutomatonCegarLoop]: Abstraction has 635 states and 1655 transitions. [2025-04-26 16:21:56,161 INFO L438 stractBuchiCegarLoop]: Abstraction has 635 states and 1655 transitions. [2025-04-26 16:21:56,161 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:21:56,161 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 635 states and 1655 transitions. [2025-04-26 16:21:56,163 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:56,163 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:56,163 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:56,165 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:56,165 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:56,166 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:21:56,166 INFO L754 eck$LassoCheckResult]: Loop: "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:21:56,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:56,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1843373949, now seen corresponding path program 2 times [2025-04-26 16:21:56,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:56,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185116389] [2025-04-26 16:21:56,166 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:21:56,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:56,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:56,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:56,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:21:56,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:56,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:56,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:56,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:56,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:56,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:56,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:56,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:56,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1336743739, now seen corresponding path program 2 times [2025-04-26 16:21:56,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:56,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846416280] [2025-04-26 16:21:56,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:21:56,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:56,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:56,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:56,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:21:56,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:56,191 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:56,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:56,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:56,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:56,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:56,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:56,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:56,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1833579075, now seen corresponding path program 1 times [2025-04-26 16:21:56,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:56,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950697944] [2025-04-26 16:21:56,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:56,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:56,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:21:56,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:21:56,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:56,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:56,211 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:56,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:21:56,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:21:56,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:56,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:56,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:56,489 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:56,489 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:56,489 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:56,489 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:56,489 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:56,489 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:56,489 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:56,489 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:56,489 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:21:56,489 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:56,489 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:56,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:56,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:56,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:56,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:56,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:56,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:56,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:56,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:56,810 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-04-26 16:21:57,024 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:57,025 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:57,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,027 INFO L229 MonitoredProcess]: Starting monitored process 33 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:21:57,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:21:57,028 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:21:57,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,039 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,039 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,042 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:21:57,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,050 INFO L229 MonitoredProcess]: Starting monitored process 34 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:21:57,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:21:57,053 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:21:57,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,069 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,077 INFO L229 MonitoredProcess]: Starting monitored process 35 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:21:57,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:21:57,082 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:21:57,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:57,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:57,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:57,093 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-04-26 16:21:57,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,101 INFO L229 MonitoredProcess]: Starting monitored process 36 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:21:57,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:21:57,102 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:21:57,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,116 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:21:57,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,123 INFO L229 MonitoredProcess]: Starting monitored process 37 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:21:57,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:21:57,125 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:21:57,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,138 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,145 INFO L229 MonitoredProcess]: Starting monitored process 38 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:21:57,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:21:57,148 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:21:57,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,159 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:57,159 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:57,164 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,172 INFO L229 MonitoredProcess]: Starting monitored process 39 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:21:57,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-04-26 16:21:57,174 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:21:57,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:57,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:57,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:57,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:57,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:57,186 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:57,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:57,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,194 INFO L229 MonitoredProcess]: Starting monitored process 40 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:21:57,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-04-26 16:21:57,196 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:21:57,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:57,206 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:21:57,207 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:57,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:57,221 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:21:57,221 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:21:57,251 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:57,276 INFO L436 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-04-26 16:21:57,276 INFO L437 ModelExtractionUtils]: 34 out of 46 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:21:57,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:57,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:57,278 INFO L229 MonitoredProcess]: Starting monitored process 41 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:21:57,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-04-26 16:21:57,279 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:57,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-04-26 16:21:57,296 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:21:57,296 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:57,296 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerWithAssertThread1of1ForFork1_steal_num#1) = 3*N - 2*cnt + 2*workerWithAssertThread1of1ForFork1_steal_num#1 Supporting invariants [-2*cnt + 3*N >= 0] [2025-04-26 16:21:57,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2025-04-26 16:21:57,305 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:21:57,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:57,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:57,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:57,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:57,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:57,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:21:57,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:57,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:57,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:57,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:57,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:57,423 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 16:21:57,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:57,500 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:21:57,500 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 5 loop predicates [2025-04-26 16:21:57,501 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 635 states and 1655 transitions. cyclomatic complexity: 1055 Second operand has 10 states, 10 states have (on average 1.8) internal successors, (in total 18), 9 states have internal predecessors, (18), 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:21:57,744 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 635 states and 1655 transitions. cyclomatic complexity: 1055. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (in total 18), 9 states have internal predecessors, (18), 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 2011 states and 5067 transitions. Complement of second has 20 states. [2025-04-26 16:21:57,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 5 stem states 6 non-accepting loop states 2 accepting loop states [2025-04-26 16:21:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (in total 18), 9 states have internal predecessors, (18), 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:21:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 155 transitions. [2025-04-26 16:21:57,745 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 155 transitions. Stem has 10 letters. Loop has 8 letters. [2025-04-26 16:21:57,745 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:57,745 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 155 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:21:57,745 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:57,745 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 155 transitions. Stem has 10 letters. Loop has 16 letters. [2025-04-26 16:21:57,745 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:57,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2011 states and 5067 transitions. [2025-04-26 16:21:57,758 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:57,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2011 states to 1593 states and 4026 transitions. [2025-04-26 16:21:57,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 975 [2025-04-26 16:21:57,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1100 [2025-04-26 16:21:57,768 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1593 states and 4026 transitions. [2025-04-26 16:21:57,768 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:57,768 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1593 states and 4026 transitions. [2025-04-26 16:21:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states and 4026 transitions. [2025-04-26 16:21:57,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 914. [2025-04-26 16:21:57,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 914 states have (on average 2.6192560175054704) internal successors, (in total 2394), 913 states have internal predecessors, (2394), 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:21:57,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 2394 transitions. [2025-04-26 16:21:57,786 INFO L240 hiAutomatonCegarLoop]: Abstraction has 914 states and 2394 transitions. [2025-04-26 16:21:57,786 INFO L438 stractBuchiCegarLoop]: Abstraction has 914 states and 2394 transitions. [2025-04-26 16:21:57,786 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:21:57,786 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 914 states and 2394 transitions. [2025-04-26 16:21:57,790 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:21:57,790 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:57,790 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:57,791 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:57,791 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:57,791 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[123] L55-->L56: Formula: (<= |v_workerThread1of1ForFork0_sz#1_3| 0) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_3|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:21:57,791 INFO L754 eck$LassoCheckResult]: Loop: "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" [2025-04-26 16:21:57,791 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:57,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1842882441, now seen corresponding path program 1 times [2025-04-26 16:21:57,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:57,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535792134] [2025-04-26 16:21:57,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:57,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:57,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:57,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:57,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:57,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:57,796 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:57,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:57,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:57,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:57,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:57,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:57,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:57,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1838304007, now seen corresponding path program 3 times [2025-04-26 16:21:57,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:57,809 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719720591] [2025-04-26 16:21:57,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:21:57,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:57,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:57,813 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:57,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:21:57,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:57,813 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:57,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:57,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:57,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:57,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:57,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:57,816 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:57,816 INFO L85 PathProgramCache]: Analyzing trace with hash -34779779, now seen corresponding path program 1 times [2025-04-26 16:21:57,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:57,816 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802671329] [2025-04-26 16:21:57,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:57,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:57,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:21:57,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:21:57,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:57,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:57,971 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:21:57,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:21:57,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802671329] [2025-04-26 16:21:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802671329] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:21:57,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:21:57,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 16:21:57,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647331103] [2025-04-26 16:21:57,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:21:58,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:21:58,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-26 16:21:58,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-26 16:21:58,048 INFO L87 Difference]: Start difference. First operand 914 states and 2394 transitions. cyclomatic complexity: 1531 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (in total 18), 6 states have internal predecessors, (18), 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:21:58,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:21:58,128 INFO L93 Difference]: Finished difference Result 1448 states and 3712 transitions. [2025-04-26 16:21:58,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1448 states and 3712 transitions. [2025-04-26 16:21:58,135 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 400 [2025-04-26 16:21:58,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1448 states to 1416 states and 3620 transitions. [2025-04-26 16:21:58,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 935 [2025-04-26 16:21:58,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 935 [2025-04-26 16:21:58,143 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1416 states and 3620 transitions. [2025-04-26 16:21:58,144 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:58,144 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1416 states and 3620 transitions. [2025-04-26 16:21:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states and 3620 transitions. [2025-04-26 16:21:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1011. [2025-04-26 16:21:58,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 1011 states have (on average 2.6241345202769537) internal successors, (in total 2653), 1010 states have internal predecessors, (2653), 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:21:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 2653 transitions. [2025-04-26 16:21:58,163 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1011 states and 2653 transitions. [2025-04-26 16:21:58,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-26 16:21:58,164 INFO L438 stractBuchiCegarLoop]: Abstraction has 1011 states and 2653 transitions. [2025-04-26 16:21:58,164 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:21:58,164 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1011 states and 2653 transitions. [2025-04-26 16:21:58,167 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 256 [2025-04-26 16:21:58,167 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:58,167 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:58,168 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:58,168 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:58,168 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[111] L40-->L41: Formula: (<= |v_workerWithAssertThread1of1ForFork1_sz#1_3| 0) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_3|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:21:58,168 INFO L754 eck$LassoCheckResult]: Loop: "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" [2025-04-26 16:21:58,169 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:58,169 INFO L85 PathProgramCache]: Analyzing trace with hash 2097083383, now seen corresponding path program 1 times [2025-04-26 16:21:58,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:58,169 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527025102] [2025-04-26 16:21:58,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:58,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:58,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:58,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:58,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:58,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:58,176 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:58,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:21:58,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:21:58,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:58,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:58,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:58,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:58,179 INFO L85 PathProgramCache]: Analyzing trace with hash -602664729, now seen corresponding path program 4 times [2025-04-26 16:21:58,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:58,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832334837] [2025-04-26 16:21:58,179 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:21:58,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:58,185 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:21:58,187 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:58,187 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:21:58,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:58,187 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:58,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:58,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:58,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:58,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:58,190 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:58,190 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:58,190 INFO L85 PathProgramCache]: Analyzing trace with hash -365777187, now seen corresponding path program 1 times [2025-04-26 16:21:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:58,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678227474] [2025-04-26 16:21:58,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:58,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:58,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:21:58,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:21:58,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:58,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:58,252 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:21:58,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:21:58,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678227474] [2025-04-26 16:21:58,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678227474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:21:58,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:21:58,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 16:21:58,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023495096] [2025-04-26 16:21:58,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:21:58,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:21:58,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-26 16:21:58,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-26 16:21:58,318 INFO L87 Difference]: Start difference. First operand 1011 states and 2653 transitions. cyclomatic complexity: 1699 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (in total 18), 6 states have internal predecessors, (18), 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:21:58,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:21:58,385 INFO L93 Difference]: Finished difference Result 1688 states and 4368 transitions. [2025-04-26 16:21:58,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 4368 transitions. [2025-04-26 16:21:58,393 INFO L131 ngComponentsAnalysis]: Automaton has 36 accepting balls. 400 [2025-04-26 16:21:58,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1654 states and 4266 transitions. [2025-04-26 16:21:58,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1065 [2025-04-26 16:21:58,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1065 [2025-04-26 16:21:58,403 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1654 states and 4266 transitions. [2025-04-26 16:21:58,403 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:58,403 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1654 states and 4266 transitions. [2025-04-26 16:21:58,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states and 4266 transitions. [2025-04-26 16:21:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1120. [2025-04-26 16:21:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1120 states have (on average 2.6151785714285714) internal successors, (in total 2929), 1119 states have internal predecessors, (2929), 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:21:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 2929 transitions. [2025-04-26 16:21:58,425 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1120 states and 2929 transitions. [2025-04-26 16:21:58,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-26 16:21:58,425 INFO L438 stractBuchiCegarLoop]: Abstraction has 1120 states and 2929 transitions. [2025-04-26 16:21:58,425 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:21:58,425 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1120 states and 2929 transitions. [2025-04-26 16:21:58,429 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 304 [2025-04-26 16:21:58,429 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:58,429 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:58,430 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:58,430 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:58,430 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[113] L43-->workerWithAssertErr0ASSERT_VIOLATIONASSERT: Formula: (or (< |v_workerWithAssertThread1of1ForFork1_i#1_3| 0) (<= v_N_4 |v_workerWithAssertThread1of1ForFork1_i#1_3|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_3|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_3|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:21:58,430 INFO L754 eck$LassoCheckResult]: Loop: "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" [2025-04-26 16:21:58,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:58,431 INFO L85 PathProgramCache]: Analyzing trace with hash 585075577, now seen corresponding path program 1 times [2025-04-26 16:21:58,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:58,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78343519] [2025-04-26 16:21:58,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:58,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:58,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:21:58,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:21:58,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:58,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:58,488 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:21:58,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:21:58,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78343519] [2025-04-26 16:21:58,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78343519] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:21:58,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:21:58,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:21:58,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151457201] [2025-04-26 16:21:58,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:21:58,489 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:21:58,489 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:58,489 INFO L85 PathProgramCache]: Analyzing trace with hash -602664729, now seen corresponding path program 5 times [2025-04-26 16:21:58,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:58,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964315823] [2025-04-26 16:21:58,489 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:21:58,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:58,491 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:58,493 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:58,493 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:21:58,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:58,493 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:58,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:58,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:58,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:58,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:58,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:58,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:21:58,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:21:58,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:21:58,578 INFO L87 Difference]: Start difference. First operand 1120 states and 2929 transitions. cyclomatic complexity: 1872 Second operand has 6 states, 5 states have (on average 2.2) internal successors, (in total 11), 5 states have internal predecessors, (11), 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:21:58,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:21:58,650 INFO L93 Difference]: Finished difference Result 1637 states and 4196 transitions. [2025-04-26 16:21:58,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1637 states and 4196 transitions. [2025-04-26 16:21:58,657 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 384 [2025-04-26 16:21:58,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1637 states to 1637 states and 4196 transitions. [2025-04-26 16:21:58,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1048 [2025-04-26 16:21:58,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1048 [2025-04-26 16:21:58,667 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1637 states and 4196 transitions. [2025-04-26 16:21:58,667 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:58,667 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1637 states and 4196 transitions. [2025-04-26 16:21:58,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states and 4196 transitions. [2025-04-26 16:21:58,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1206. [2025-04-26 16:21:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 1206 states have (on average 2.6102819237147594) internal successors, (in total 3148), 1205 states have internal predecessors, (3148), 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:21:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 3148 transitions. [2025-04-26 16:21:58,687 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1206 states and 3148 transitions. [2025-04-26 16:21:58,687 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-26 16:21:58,690 INFO L438 stractBuchiCegarLoop]: Abstraction has 1206 states and 3148 transitions. [2025-04-26 16:21:58,690 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:21:58,690 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1206 states and 3148 transitions. [2025-04-26 16:21:58,694 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 320 [2025-04-26 16:21:58,694 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:58,695 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:58,695 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:58,695 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:21:58,695 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:21:58,695 INFO L754 eck$LassoCheckResult]: Loop: "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:21:58,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:58,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1309588330, now seen corresponding path program 1 times [2025-04-26 16:21:58,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:58,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382940921] [2025-04-26 16:21:58,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:58,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:58,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:21:58,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:21:58,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:58,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:58,703 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:58,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:21:58,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:21:58,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:58,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:58,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:58,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:58,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1336743739, now seen corresponding path program 4 times [2025-04-26 16:21:58,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:58,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568497882] [2025-04-26 16:21:58,709 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:21:58,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:58,711 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:21:58,713 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:58,713 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:21:58,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:58,713 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:58,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:58,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:58,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:58,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:58,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:58,720 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:58,720 INFO L85 PathProgramCache]: Analyzing trace with hash -101779760, now seen corresponding path program 1 times [2025-04-26 16:21:58,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:58,720 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764924345] [2025-04-26 16:21:58,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:58,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:58,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:21:58,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:21:58,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:58,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:58,729 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:58,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:21:58,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:21:58,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:58,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:58,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:59,051 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:59,051 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:59,051 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:59,051 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:59,051 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:59,051 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:59,051 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:59,051 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:59,051 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration9_Lasso [2025-04-26 16:21:59,051 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:59,051 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:59,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:59,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:59,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:59,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:59,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:59,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:59,578 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-04-26 16:21:59,847 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:59,847 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:59,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:59,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:59,849 INFO L229 MonitoredProcess]: Starting monitored process 42 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:21:59,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-04-26 16:21:59,851 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:21:59,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:59,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:59,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:59,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:59,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:59,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:59,864 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:59,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:59,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:59,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:59,872 INFO L229 MonitoredProcess]: Starting monitored process 43 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:21:59,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-04-26 16:21:59,874 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:21:59,883 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:59,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:59,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:59,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:59,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:59,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:59,887 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:59,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2025-04-26 16:21:59,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:59,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:59,894 INFO L229 MonitoredProcess]: Starting monitored process 44 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:21:59,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-04-26 16:21:59,896 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:21:59,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:59,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:59,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:59,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:59,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:59,907 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:59,909 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:59,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:59,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:59,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:59,916 INFO L229 MonitoredProcess]: Starting monitored process 45 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:21:59,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-04-26 16:21:59,917 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:21:59,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:59,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:59,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:59,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:59,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:59,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:59,931 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:59,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:59,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:59,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:59,938 INFO L229 MonitoredProcess]: Starting monitored process 46 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:21:59,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-04-26 16:21:59,940 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:21:59,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:59,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:59,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:59,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:59,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:59,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:59,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:59,951 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:59,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-04-26 16:21:59,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:59,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:59,958 INFO L229 MonitoredProcess]: Starting monitored process 47 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:21:59,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-04-26 16:21:59,960 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:21:59,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:59,970 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:21:59,970 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:21:59,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:59,985 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:21:59,986 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:00,017 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:00,066 INFO L436 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-04-26 16:22:00,066 INFO L437 ModelExtractionUtils]: 38 out of 56 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-04-26 16:22:00,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:00,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:00,069 INFO L229 MonitoredProcess]: Starting monitored process 48 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:22:00,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-04-26 16:22:00,071 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:00,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:00,091 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:00,091 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:00,091 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerWithAssertThread1of1ForFork1_steal_num#1) = 3*N - 2*cnt + 2*workerWithAssertThread1of1ForFork1_steal_num#1 Supporting invariants [3*N - 2*cnt >= 0] [2025-04-26 16:22:00,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-04-26 16:22:00,103 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:00,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:00,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:00,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:00,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:00,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:00,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 16:22:00,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:00,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:00,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:00,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:00,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:00,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:00,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:00,317 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:22:00,318 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 4 loop predicates [2025-04-26 16:22:00,318 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1206 states and 3148 transitions. cyclomatic complexity: 2007 Second operand has 10 states, 10 states have (on average 1.9) internal successors, (in total 19), 9 states have internal predecessors, (19), 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:22:00,524 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1206 states and 3148 transitions. cyclomatic complexity: 2007. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (in total 19), 9 states have internal predecessors, (19), 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 2964 states and 7505 transitions. Complement of second has 19 states. [2025-04-26 16:22:00,524 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 6 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (in total 19), 9 states have internal predecessors, (19), 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:22:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 127 transitions. [2025-04-26 16:22:00,525 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 127 transitions. Stem has 11 letters. Loop has 8 letters. [2025-04-26 16:22:00,525 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:00,525 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 127 transitions. Stem has 19 letters. Loop has 8 letters. [2025-04-26 16:22:00,525 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:00,525 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 127 transitions. Stem has 11 letters. Loop has 16 letters. [2025-04-26 16:22:00,525 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:00,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2964 states and 7505 transitions. [2025-04-26 16:22:00,539 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 320 [2025-04-26 16:22:00,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2964 states to 2319 states and 5906 transitions. [2025-04-26 16:22:00,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1175 [2025-04-26 16:22:00,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1382 [2025-04-26 16:22:00,552 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2319 states and 5906 transitions. [2025-04-26 16:22:00,552 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:00,552 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2319 states and 5906 transitions. [2025-04-26 16:22:00,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states and 5906 transitions. [2025-04-26 16:22:00,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 1301. [2025-04-26 16:22:00,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1301 states, 1301 states have (on average 2.6233666410453496) internal successors, (in total 3413), 1300 states have internal predecessors, (3413), 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:22:00,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 3413 transitions. [2025-04-26 16:22:00,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1301 states and 3413 transitions. [2025-04-26 16:22:00,576 INFO L438 stractBuchiCegarLoop]: Abstraction has 1301 states and 3413 transitions. [2025-04-26 16:22:00,576 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:22:00,576 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1301 states and 3413 transitions. [2025-04-26 16:22:00,579 INFO L131 ngComponentsAnalysis]: Automaton has 26 accepting balls. 320 [2025-04-26 16:22:00,579 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:00,579 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:00,579 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:00,579 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:00,580 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:22:00,580 INFO L754 eck$LassoCheckResult]: Loop: "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:22:00,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:00,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1295288650, now seen corresponding path program 2 times [2025-04-26 16:22:00,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:00,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530175403] [2025-04-26 16:22:00,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:00,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:00,582 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:00,584 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:00,584 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:00,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:00,584 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:00,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:00,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:00,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:00,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:00,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:00,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:00,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1336743739, now seen corresponding path program 5 times [2025-04-26 16:22:00,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:00,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860500403] [2025-04-26 16:22:00,588 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:00,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:00,589 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:00,591 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:00,591 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:00,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:00,591 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:00,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:00,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:00,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:00,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:00,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:00,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:00,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1728383216, now seen corresponding path program 2 times [2025-04-26 16:22:00,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:00,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505736931] [2025-04-26 16:22:00,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:00,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:00,595 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-26 16:22:00,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:22:00,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:22:00,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:00,601 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:00,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:22:00,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:22:00,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:00,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:00,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:00,856 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:00,856 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:00,856 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:00,856 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:00,856 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:00,856 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:00,856 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:00,856 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:00,856 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration10_Lasso [2025-04-26 16:22:00,856 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:00,856 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:00,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:00,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:00,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:01,026 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:01,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:01,029 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:01,110 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-04-26 16:22:01,401 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:01,402 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:01,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,404 INFO L229 MonitoredProcess]: Starting monitored process 49 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:22:01,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-04-26 16:22:01,405 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:22:01,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:01,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:01,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:01,419 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-04-26 16:22:01,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,426 INFO L229 MonitoredProcess]: Starting monitored process 50 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:22:01,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-04-26 16:22:01,428 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:22:01,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:01,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:01,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:01,441 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2025-04-26 16:22:01,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,449 INFO L229 MonitoredProcess]: Starting monitored process 51 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:22:01,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-04-26 16:22:01,450 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:22:01,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:01,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:01,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:01,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:01,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:01,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:01,462 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:01,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-04-26 16:22:01,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,471 INFO L229 MonitoredProcess]: Starting monitored process 52 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:22:01,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-04-26 16:22:01,475 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:22:01,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:01,485 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:01,485 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:01,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:01,501 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:22:01,502 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:01,533 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:01,595 INFO L436 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2025-04-26 16:22:01,595 INFO L437 ModelExtractionUtils]: 38 out of 56 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-04-26 16:22:01,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:01,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:01,597 INFO L229 MonitoredProcess]: Starting monitored process 53 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:22:01,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-04-26 16:22:01,600 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:01,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:01,618 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:01,618 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:01,618 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerWithAssertThread1of1ForFork1_steal_num#1) = 3*N - 2*cnt + 2*workerWithAssertThread1of1ForFork1_steal_num#1 Supporting invariants [3*N - 2*cnt >= 0] [2025-04-26 16:22:01,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2025-04-26 16:22:01,628 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:01,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:01,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:01,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:01,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:01,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:01,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 16:22:01,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:01,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:01,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:01,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:01,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:01,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:01,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:01,829 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:22:01,830 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 4 loop predicates [2025-04-26 16:22:01,830 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1301 states and 3413 transitions. cyclomatic complexity: 2177 Second operand has 10 states, 10 states have (on average 1.9) internal successors, (in total 19), 9 states have internal predecessors, (19), 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:22:02,040 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1301 states and 3413 transitions. cyclomatic complexity: 2177. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (in total 19), 9 states have internal predecessors, (19), 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 3645 states and 9348 transitions. Complement of second has 19 states. [2025-04-26 16:22:02,041 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 6 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:02,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (in total 19), 9 states have internal predecessors, (19), 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:22:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 136 transitions. [2025-04-26 16:22:02,041 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 136 transitions. Stem has 11 letters. Loop has 8 letters. [2025-04-26 16:22:02,042 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:02,042 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 136 transitions. Stem has 19 letters. Loop has 8 letters. [2025-04-26 16:22:02,042 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:02,042 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 136 transitions. Stem has 11 letters. Loop has 16 letters. [2025-04-26 16:22:02,042 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:02,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3645 states and 9348 transitions. [2025-04-26 16:22:02,057 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 272 [2025-04-26 16:22:02,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3645 states to 2556 states and 6533 transitions. [2025-04-26 16:22:02,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1294 [2025-04-26 16:22:02,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1461 [2025-04-26 16:22:02,072 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2556 states and 6533 transitions. [2025-04-26 16:22:02,072 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:02,072 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2556 states and 6533 transitions. [2025-04-26 16:22:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states and 6533 transitions. [2025-04-26 16:22:02,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 1201. [2025-04-26 16:22:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1201 states have (on average 2.607826810990841) internal successors, (in total 3132), 1200 states have internal predecessors, (3132), 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:22:02,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 3132 transitions. [2025-04-26 16:22:02,095 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1201 states and 3132 transitions. [2025-04-26 16:22:02,095 INFO L438 stractBuchiCegarLoop]: Abstraction has 1201 states and 3132 transitions. [2025-04-26 16:22:02,095 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:22:02,095 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1201 states and 3132 transitions. [2025-04-26 16:22:02,098 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 272 [2025-04-26 16:22:02,098 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:02,099 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:02,099 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:02,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:02,100 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:02,100 INFO L754 eck$LassoCheckResult]: Loop: "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:02,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:02,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1310017792, now seen corresponding path program 1 times [2025-04-26 16:22:02,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:02,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418211012] [2025-04-26 16:22:02,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:02,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:02,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:02,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:02,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:02,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:02,107 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:02,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:02,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:02,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:02,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:02,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:02,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:02,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1105178277, now seen corresponding path program 6 times [2025-04-26 16:22:02,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:02,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254016757] [2025-04-26 16:22:02,112 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:02,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:02,119 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:02,120 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:02,120 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:02,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:02,120 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:02,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:02,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:02,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:02,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:02,128 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:02,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:02,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1025481050, now seen corresponding path program 1 times [2025-04-26 16:22:02,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:02,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235916754] [2025-04-26 16:22:02,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:02,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:02,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:22:02,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:22:02,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:02,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:02,152 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:02,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:22:02,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:22:02,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:02,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:02,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:02,404 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:02,404 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:02,404 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:02,404 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:02,404 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:02,404 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:02,404 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:02,404 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:02,404 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration11_Lasso [2025-04-26 16:22:02,404 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:02,404 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:02,406 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:02,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:02,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:02,685 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:02,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:02,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:02,813 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-04-26 16:22:03,082 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:03,082 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:03,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:03,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:03,084 INFO L229 MonitoredProcess]: Starting monitored process 54 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:22:03,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-04-26 16:22:03,085 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:22:03,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:03,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:03,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:03,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:03,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:03,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:03,098 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:03,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-04-26 16:22:03,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:03,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:03,105 INFO L229 MonitoredProcess]: Starting monitored process 55 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:22:03,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-04-26 16:22:03,107 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:22:03,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:03,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:03,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:03,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:03,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:03,119 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:03,121 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:03,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-04-26 16:22:03,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:03,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:03,128 INFO L229 MonitoredProcess]: Starting monitored process 56 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:22:03,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-04-26 16:22:03,130 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:22:03,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:03,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:03,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:03,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:03,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:03,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:03,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:03,141 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:03,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-04-26 16:22:03,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:03,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:03,148 INFO L229 MonitoredProcess]: Starting monitored process 57 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:22:03,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-04-26 16:22:03,149 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:22:03,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:03,159 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:03,159 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:03,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:03,173 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:22:03,173 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:03,203 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:03,233 INFO L436 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-04-26 16:22:03,233 INFO L437 ModelExtractionUtils]: 41 out of 56 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:22:03,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:03,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:03,235 INFO L229 MonitoredProcess]: Starting monitored process 58 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:22:03,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-04-26 16:22:03,237 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:03,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:03,257 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:03,257 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:03,257 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerThread1of1ForFork0_steal_num#1) = 3*N - 2*cnt + 2*workerThread1of1ForFork0_steal_num#1 Supporting invariants [3*N - 2*cnt >= 0] [2025-04-26 16:22:03,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-04-26 16:22:03,266 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:03,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:03,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:03,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:03,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:03,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:03,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:03,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:03,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:03,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:03,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:03,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:03,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:03,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:03,427 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:22:03,428 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 4 loop predicates [2025-04-26 16:22:03,428 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1201 states and 3132 transitions. cyclomatic complexity: 1990 Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (in total 19), 8 states have internal predecessors, (19), 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:22:03,590 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1201 states and 3132 transitions. cyclomatic complexity: 1990. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (in total 19), 8 states have internal predecessors, (19), 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 2728 states and 6793 transitions. Complement of second has 18 states. [2025-04-26 16:22:03,590 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:03,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (in total 19), 8 states have internal predecessors, (19), 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:22:03,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 107 transitions. [2025-04-26 16:22:03,591 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 12 states and 107 transitions. Stem has 11 letters. Loop has 8 letters. [2025-04-26 16:22:03,591 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:03,591 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 12 states and 107 transitions. Stem has 19 letters. Loop has 8 letters. [2025-04-26 16:22:03,591 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:03,591 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 12 states and 107 transitions. Stem has 11 letters. Loop has 16 letters. [2025-04-26 16:22:03,591 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:03,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2728 states and 6793 transitions. [2025-04-26 16:22:03,602 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:03,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2728 states to 2105 states and 5336 transitions. [2025-04-26 16:22:03,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1083 [2025-04-26 16:22:03,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1180 [2025-04-26 16:22:03,613 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2105 states and 5336 transitions. [2025-04-26 16:22:03,613 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:03,613 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2105 states and 5336 transitions. [2025-04-26 16:22:03,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states and 5336 transitions. [2025-04-26 16:22:03,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 1125. [2025-04-26 16:22:03,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1125 states have (on average 2.617777777777778) internal successors, (in total 2945), 1124 states have internal predecessors, (2945), 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:22:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 2945 transitions. [2025-04-26 16:22:03,633 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1125 states and 2945 transitions. [2025-04-26 16:22:03,633 INFO L438 stractBuchiCegarLoop]: Abstraction has 1125 states and 2945 transitions. [2025-04-26 16:22:03,633 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 16:22:03,633 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1125 states and 2945 transitions. [2025-04-26 16:22:03,636 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:03,636 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:03,636 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:03,636 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:03,636 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:03,637 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[111] L40-->L41: Formula: (<= |v_workerWithAssertThread1of1ForFork1_sz#1_3| 0) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_3|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:03,637 INFO L754 eck$LassoCheckResult]: Loop: "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" [2025-04-26 16:22:03,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:03,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1957876616, now seen corresponding path program 1 times [2025-04-26 16:22:03,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:03,637 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264724255] [2025-04-26 16:22:03,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:03,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:03,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:03,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:03,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:03,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:03,641 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:03,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:03,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:03,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:03,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:03,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:03,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:03,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1853071129, now seen corresponding path program 7 times [2025-04-26 16:22:03,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:03,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307260897] [2025-04-26 16:22:03,644 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:03,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:03,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:03,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:03,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:03,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:03,648 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:03,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:03,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:03,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:03,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:03,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:03,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:03,652 INFO L85 PathProgramCache]: Analyzing trace with hash 784148062, now seen corresponding path program 2 times [2025-04-26 16:22:03,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:03,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47697028] [2025-04-26 16:22:03,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:03,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:03,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:22:03,660 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:22:03,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:03,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:03,661 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:03,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:22:03,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:22:03,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:03,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:03,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:03,869 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:03,869 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:03,869 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:03,869 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:03,869 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:03,869 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:03,869 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:03,869 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:03,869 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration12_Lasso [2025-04-26 16:22:03,869 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:03,869 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:03,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:03,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:03,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:03,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:03,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:03,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:03,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:04,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:04,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:04,305 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:04,305 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:04,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:04,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:04,307 INFO L229 MonitoredProcess]: Starting monitored process 59 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:22:04,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-04-26 16:22:04,308 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:22:04,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:04,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:04,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:04,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:04,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:04,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:04,321 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:04,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-04-26 16:22:04,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:04,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:04,328 INFO L229 MonitoredProcess]: Starting monitored process 60 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:22:04,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-04-26 16:22:04,330 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:22:04,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:04,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:04,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:04,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:04,341 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:04,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:04,343 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:04,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-04-26 16:22:04,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:04,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:04,350 INFO L229 MonitoredProcess]: Starting monitored process 61 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:22:04,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-04-26 16:22:04,352 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:22:04,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:04,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:04,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:04,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:04,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:04,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:04,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:04,362 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:04,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-04-26 16:22:04,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:04,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:04,370 INFO L229 MonitoredProcess]: Starting monitored process 62 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:22:04,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-04-26 16:22:04,371 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:22:04,380 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:04,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:04,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:04,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:04,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:04,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:04,383 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:04,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2025-04-26 16:22:04,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:04,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:04,392 INFO L229 MonitoredProcess]: Starting monitored process 63 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:22:04,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-04-26 16:22:04,394 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:22:04,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:04,404 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:04,404 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:04,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:04,418 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:22:04,418 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:04,444 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:04,466 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:22:04,466 INFO L437 ModelExtractionUtils]: 23 out of 36 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:22:04,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:04,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:04,468 INFO L229 MonitoredProcess]: Starting monitored process 64 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:22:04,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-04-26 16:22:04,469 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:04,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2025-04-26 16:22:04,486 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:04,486 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:04,486 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerThread1of1ForFork0_sz#1) = 1*workerThread1of1ForFork0_sz#1 Supporting invariants [1*cnt - 1*N >= 0] [2025-04-26 16:22:04,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:04,494 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:04,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:04,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:04,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:04,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:04,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:04,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:22:04,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:04,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:04,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:04,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:04,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:04,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:22:04,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:04,663 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:22:04,663 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2025-04-26 16:22:04,663 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1125 states and 2945 transitions. cyclomatic complexity: 1871 Second operand has 8 states, 8 states have (on average 2.75) internal successors, (in total 22), 8 states have internal predecessors, (22), 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:22:04,857 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1125 states and 2945 transitions. cyclomatic complexity: 1871. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (in total 22), 8 states have internal predecessors, (22), 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 1449 states and 3709 transitions. Complement of second has 14 states. [2025-04-26 16:22:04,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:04,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (in total 22), 8 states have internal predecessors, (22), 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:22:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2025-04-26 16:22:04,858 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 123 transitions. Stem has 14 letters. Loop has 8 letters. [2025-04-26 16:22:04,858 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:04,858 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 123 transitions. Stem has 22 letters. Loop has 8 letters. [2025-04-26 16:22:04,858 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:04,858 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 123 transitions. Stem has 14 letters. Loop has 16 letters. [2025-04-26 16:22:04,859 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:04,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1449 states and 3709 transitions. [2025-04-26 16:22:04,864 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 224 [2025-04-26 16:22:04,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1449 states to 1349 states and 3466 transitions. [2025-04-26 16:22:04,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 863 [2025-04-26 16:22:04,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 890 [2025-04-26 16:22:04,870 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1349 states and 3466 transitions. [2025-04-26 16:22:04,870 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:04,870 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1349 states and 3466 transitions. [2025-04-26 16:22:04,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states and 3466 transitions. [2025-04-26 16:22:04,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1125. [2025-04-26 16:22:04,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1125 states have (on average 2.6106666666666665) internal successors, (in total 2937), 1124 states have internal predecessors, (2937), 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:22:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 2937 transitions. [2025-04-26 16:22:04,885 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1125 states and 2937 transitions. [2025-04-26 16:22:04,885 INFO L438 stractBuchiCegarLoop]: Abstraction has 1125 states and 2937 transitions. [2025-04-26 16:22:04,885 INFO L340 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-04-26 16:22:04,885 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1125 states and 2937 transitions. [2025-04-26 16:22:04,888 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:04,888 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:04,888 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:04,888 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:04,888 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:04,889 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[123] L55-->L56: Formula: (<= |v_workerThread1of1ForFork0_sz#1_3| 0) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_3|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:04,889 INFO L754 eck$LassoCheckResult]: Loop: "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" [2025-04-26 16:22:04,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:04,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1627897466, now seen corresponding path program 1 times [2025-04-26 16:22:04,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:04,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099599338] [2025-04-26 16:22:04,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:04,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:04,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:04,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:04,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:04,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:04,893 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:04,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:04,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:04,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:04,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:04,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:04,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:04,897 INFO L85 PathProgramCache]: Analyzing trace with hash 617450247, now seen corresponding path program 6 times [2025-04-26 16:22:04,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:04,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928480902] [2025-04-26 16:22:04,897 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:04,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:04,898 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:04,900 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:04,900 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:04,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:04,900 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:04,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:04,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:04,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:04,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:04,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:04,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:04,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1838137472, now seen corresponding path program 2 times [2025-04-26 16:22:04,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:04,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457691402] [2025-04-26 16:22:04,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:04,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:04,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:22:04,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:22:04,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:04,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:04,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:04,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:22:04,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:22:04,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:04,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:04,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:05,139 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:05,139 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:05,139 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:05,139 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:05,139 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:05,139 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:05,139 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:05,139 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:05,139 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration13_Lasso [2025-04-26 16:22:05,139 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:05,139 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:05,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:05,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:05,143 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:05,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:05,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:05,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:05,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:05,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:05,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:05,514 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:05,514 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:05,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:05,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:05,516 INFO L229 MonitoredProcess]: Starting monitored process 65 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:22:05,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-04-26 16:22:05,518 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:22:05,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:05,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:05,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:05,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:05,528 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:05,528 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:05,530 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:05,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-04-26 16:22:05,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:05,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:05,537 INFO L229 MonitoredProcess]: Starting monitored process 66 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:22:05,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-04-26 16:22:05,539 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:22:05,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:05,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:05,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:05,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:05,549 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:05,549 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:05,551 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:05,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-04-26 16:22:05,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:05,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:05,558 INFO L229 MonitoredProcess]: Starting monitored process 67 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:22:05,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-04-26 16:22:05,560 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:22:05,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:05,570 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:05,570 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:05,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:05,580 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:22:05,580 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:05,604 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:05,628 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:22:05,628 INFO L437 ModelExtractionUtils]: 19 out of 36 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-04-26 16:22:05,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:05,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:05,630 INFO L229 MonitoredProcess]: Starting monitored process 68 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:22:05,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2025-04-26 16:22:05,632 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:05,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2025-04-26 16:22:05,649 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:05,649 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:05,649 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerWithAssertThread1of1ForFork1_sz#1) = 1*workerWithAssertThread1of1ForFork1_sz#1 Supporting invariants [-1*N + 1*cnt >= 0] [2025-04-26 16:22:05,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2025-04-26 16:22:05,657 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:05,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:05,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:22:05,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:22:05,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:05,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:05,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:22:05,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:05,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:05,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:05,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:05,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:05,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:22:05,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:05,793 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:22:05,794 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2025-04-26 16:22:05,794 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1125 states and 2937 transitions. cyclomatic complexity: 1863 Second operand has 8 states, 8 states have (on average 2.75) internal successors, (in total 22), 8 states have internal predecessors, (22), 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:22:05,968 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1125 states and 2937 transitions. cyclomatic complexity: 1863. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (in total 22), 8 states have internal predecessors, (22), 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 1411 states and 3583 transitions. Complement of second has 14 states. [2025-04-26 16:22:05,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (in total 22), 8 states have internal predecessors, (22), 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:22:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2025-04-26 16:22:05,969 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 119 transitions. Stem has 14 letters. Loop has 8 letters. [2025-04-26 16:22:05,969 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:05,969 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 119 transitions. Stem has 22 letters. Loop has 8 letters. [2025-04-26 16:22:05,969 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:05,969 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 119 transitions. Stem has 14 letters. Loop has 16 letters. [2025-04-26 16:22:05,969 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:05,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1411 states and 3583 transitions. [2025-04-26 16:22:05,974 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 256 [2025-04-26 16:22:05,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1411 states to 1312 states and 3341 transitions. [2025-04-26 16:22:05,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 887 [2025-04-26 16:22:05,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 912 [2025-04-26 16:22:05,982 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1312 states and 3341 transitions. [2025-04-26 16:22:05,982 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:05,983 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1312 states and 3341 transitions. [2025-04-26 16:22:05,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states and 3341 transitions. [2025-04-26 16:22:05,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1125. [2025-04-26 16:22:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 1125 states have (on average 2.6035555555555554) internal successors, (in total 2929), 1124 states have internal predecessors, (2929), 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:22:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 2929 transitions. [2025-04-26 16:22:05,998 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1125 states and 2929 transitions. [2025-04-26 16:22:05,998 INFO L438 stractBuchiCegarLoop]: Abstraction has 1125 states and 2929 transitions. [2025-04-26 16:22:05,998 INFO L340 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-04-26 16:22:05,999 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1125 states and 2929 transitions. [2025-04-26 16:22:06,001 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 208 [2025-04-26 16:22:06,002 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:06,002 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:06,002 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:06,002 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:06,002 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[113] L43-->workerWithAssertErr0ASSERT_VIOLATIONASSERT: Formula: (or (< |v_workerWithAssertThread1of1ForFork1_i#1_3| 0) (<= v_N_4 |v_workerWithAssertThread1of1ForFork1_i#1_3|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_3|, N=v_N_4} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_3|, N=v_N_4} AuxVars[] AssignedVars[]" [2025-04-26 16:22:06,003 INFO L754 eck$LassoCheckResult]: Loop: "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" [2025-04-26 16:22:06,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:06,003 INFO L85 PathProgramCache]: Analyzing trace with hash -564632808, now seen corresponding path program 1 times [2025-04-26 16:22:06,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:06,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441848153] [2025-04-26 16:22:06,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:06,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:06,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:22:06,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:22:06,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:06,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:06,092 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:22:06,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:06,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441848153] [2025-04-26 16:22:06,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441848153] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:06,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:06,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 16:22:06,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790248248] [2025-04-26 16:22:06,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:06,092 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:22:06,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:06,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1853071129, now seen corresponding path program 8 times [2025-04-26 16:22:06,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:06,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977741061] [2025-04-26 16:22:06,093 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:06,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:06,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:06,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:06,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:06,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:06,098 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:06,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:06,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:06,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:06,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:06,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:06,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:06,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-26 16:22:06,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-26 16:22:06,180 INFO L87 Difference]: Start difference. First operand 1125 states and 2929 transitions. cyclomatic complexity: 1855 Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (in total 15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:06,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:06,297 INFO L93 Difference]: Finished difference Result 2005 states and 5187 transitions. [2025-04-26 16:22:06,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2005 states and 5187 transitions. [2025-04-26 16:22:06,304 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 384 [2025-04-26 16:22:06,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2005 states to 2005 states and 5187 transitions. [2025-04-26 16:22:06,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1266 [2025-04-26 16:22:06,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1266 [2025-04-26 16:22:06,314 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2005 states and 5187 transitions. [2025-04-26 16:22:06,314 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:06,314 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2005 states and 5187 transitions. [2025-04-26 16:22:06,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states and 5187 transitions. [2025-04-26 16:22:06,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1344. [2025-04-26 16:22:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1344 states, 1344 states have (on average 2.613095238095238) internal successors, (in total 3512), 1343 states have internal predecessors, (3512), 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:22:06,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1344 states to 1344 states and 3512 transitions. [2025-04-26 16:22:06,333 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1344 states and 3512 transitions. [2025-04-26 16:22:06,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-26 16:22:06,334 INFO L438 stractBuchiCegarLoop]: Abstraction has 1344 states and 3512 transitions. [2025-04-26 16:22:06,334 INFO L340 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-04-26 16:22:06,334 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1344 states and 3512 transitions. [2025-04-26 16:22:06,337 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 272 [2025-04-26 16:22:06,337 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:06,337 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:06,337 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:06,337 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:06,337 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[111] L40-->L41: Formula: (<= |v_workerWithAssertThread1of1ForFork1_sz#1_3| 0) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_3|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:06,338 INFO L754 eck$LassoCheckResult]: Loop: "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:06,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:06,338 INFO L85 PathProgramCache]: Analyzing trace with hash 71299386, now seen corresponding path program 1 times [2025-04-26 16:22:06,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:06,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404728096] [2025-04-26 16:22:06,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:06,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:06,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:06,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:06,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:06,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:06,342 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:06,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:06,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:06,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:06,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:06,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:06,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:06,345 INFO L85 PathProgramCache]: Analyzing trace with hash 590471527, now seen corresponding path program 9 times [2025-04-26 16:22:06,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:06,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778774076] [2025-04-26 16:22:06,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:06,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:06,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:06,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:06,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:06,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:06,348 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:06,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:06,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:06,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:06,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:06,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:06,350 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:06,350 INFO L85 PathProgramCache]: Analyzing trace with hash -399668832, now seen corresponding path program 3 times [2025-04-26 16:22:06,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:06,350 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922802307] [2025-04-26 16:22:06,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:06,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:06,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:22:06,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:22:06,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:06,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:06,436 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:22:06,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:06,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922802307] [2025-04-26 16:22:06,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922802307] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:06,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:06,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-26 16:22:06,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901267780] [2025-04-26 16:22:06,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:06,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:06,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-26 16:22:06,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-26 16:22:06,502 INFO L87 Difference]: Start difference. First operand 1344 states and 3512 transitions. cyclomatic complexity: 2233 Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (in total 24), 8 states have internal predecessors, (24), 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:22:06,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:06,638 INFO L93 Difference]: Finished difference Result 1441 states and 3708 transitions. [2025-04-26 16:22:06,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1441 states and 3708 transitions. [2025-04-26 16:22:06,643 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 272 [2025-04-26 16:22:06,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1441 states to 1395 states and 3568 transitions. [2025-04-26 16:22:06,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 936 [2025-04-26 16:22:06,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 936 [2025-04-26 16:22:06,647 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1395 states and 3568 transitions. [2025-04-26 16:22:06,647 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:06,647 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1395 states and 3568 transitions. [2025-04-26 16:22:06,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states and 3568 transitions. [2025-04-26 16:22:06,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1310. [2025-04-26 16:22:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1310 states have (on average 2.5893129770992367) internal successors, (in total 3392), 1309 states have internal predecessors, (3392), 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:22:06,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 3392 transitions. [2025-04-26 16:22:06,662 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1310 states and 3392 transitions. [2025-04-26 16:22:06,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-26 16:22:06,663 INFO L438 stractBuchiCegarLoop]: Abstraction has 1310 states and 3392 transitions. [2025-04-26 16:22:06,663 INFO L340 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-04-26 16:22:06,663 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1310 states and 3392 transitions. [2025-04-26 16:22:06,666 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2025-04-26 16:22:06,666 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:06,666 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:06,666 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:06,666 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:06,667 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[123] L55-->L56: Formula: (<= |v_workerThread1of1ForFork0_sz#1_3| 0) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_3|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_3|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:06,667 INFO L754 eck$LassoCheckResult]: Loop: "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" [2025-04-26 16:22:06,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:06,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1041360184, now seen corresponding path program 1 times [2025-04-26 16:22:06,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:06,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287001801] [2025-04-26 16:22:06,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:06,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:06,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:06,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:06,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:06,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:06,671 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:06,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:06,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:06,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:06,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:06,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:06,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:06,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1366786951, now seen corresponding path program 7 times [2025-04-26 16:22:06,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:06,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448651209] [2025-04-26 16:22:06,674 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:06,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:06,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:06,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:06,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:06,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:06,677 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:06,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:06,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:06,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:06,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:06,679 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:06,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:06,679 INFO L85 PathProgramCache]: Analyzing trace with hash 8929726, now seen corresponding path program 3 times [2025-04-26 16:22:06,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:06,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955524439] [2025-04-26 16:22:06,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:06,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:06,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:22:06,683 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:22:06,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:06,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:06,779 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:22:06,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:06,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955524439] [2025-04-26 16:22:06,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955524439] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:06,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:06,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-26 16:22:06,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615100140] [2025-04-26 16:22:06,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:06,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:06,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-26 16:22:06,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-26 16:22:06,851 INFO L87 Difference]: Start difference. First operand 1310 states and 3392 transitions. cyclomatic complexity: 2143 Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (in total 24), 8 states have internal predecessors, (24), 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:22:06,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:06,953 INFO L93 Difference]: Finished difference Result 1441 states and 3682 transitions. [2025-04-26 16:22:06,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1441 states and 3682 transitions. [2025-04-26 16:22:06,958 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 256 [2025-04-26 16:22:06,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1441 states to 1397 states and 3564 transitions. [2025-04-26 16:22:06,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 939 [2025-04-26 16:22:06,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 939 [2025-04-26 16:22:06,963 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1397 states and 3564 transitions. [2025-04-26 16:22:06,963 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:06,963 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1397 states and 3564 transitions. [2025-04-26 16:22:06,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states and 3564 transitions. [2025-04-26 16:22:06,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1310. [2025-04-26 16:22:06,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1310 states have (on average 2.5633587786259544) internal successors, (in total 3358), 1309 states have internal predecessors, (3358), 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:22:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 3358 transitions. [2025-04-26 16:22:06,979 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1310 states and 3358 transitions. [2025-04-26 16:22:06,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-26 16:22:06,980 INFO L438 stractBuchiCegarLoop]: Abstraction has 1310 states and 3358 transitions. [2025-04-26 16:22:06,980 INFO L340 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-04-26 16:22:06,980 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1310 states and 3358 transitions. [2025-04-26 16:22:06,983 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 240 [2025-04-26 16:22:06,983 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:06,983 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:06,983 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:06,983 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:06,984 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[117] L53-->L56: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:22:06,984 INFO L754 eck$LassoCheckResult]: Loop: "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" [2025-04-26 16:22:06,984 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:06,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2077142887, now seen corresponding path program 1 times [2025-04-26 16:22:06,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:06,984 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159025570] [2025-04-26 16:22:06,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:06,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:06,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:06,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:06,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:06,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:06,989 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:06,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:06,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:06,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:06,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:06,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:06,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:06,993 INFO L85 PathProgramCache]: Analyzing trace with hash 617450247, now seen corresponding path program 8 times [2025-04-26 16:22:06,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:06,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21122117] [2025-04-26 16:22:06,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:06,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:06,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:06,996 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:06,996 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:06,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:06,996 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:06,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:06,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:06,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:06,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:06,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:06,998 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1397801887, now seen corresponding path program 1 times [2025-04-26 16:22:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:06,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535327218] [2025-04-26 16:22:06,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:06,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:07,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:07,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:07,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:07,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:07,003 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:07,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:22:07,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:22:07,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:07,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:07,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:07,239 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:07,240 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:07,240 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:07,240 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:07,240 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:07,240 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:07,240 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:07,240 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:07,240 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration17_Lasso [2025-04-26 16:22:07,240 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:07,240 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:07,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:07,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:07,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:07,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:07,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:07,333 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:07,536 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:07,536 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:07,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:07,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:07,538 INFO L229 MonitoredProcess]: Starting monitored process 69 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:22:07,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-04-26 16:22:07,540 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:22:07,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:07,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:07,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:07,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:07,550 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:07,550 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:07,552 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:07,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-04-26 16:22:07,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:07,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:07,559 INFO L229 MonitoredProcess]: Starting monitored process 70 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:22:07,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-04-26 16:22:07,560 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:22:07,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:07,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:07,570 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:07,570 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:07,579 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:22:07,579 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:07,601 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:07,623 INFO L436 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-04-26 16:22:07,623 INFO L437 ModelExtractionUtils]: 23 out of 36 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:22:07,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:07,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:07,625 INFO L229 MonitoredProcess]: Starting monitored process 71 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:22:07,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-04-26 16:22:07,626 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:07,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:07,643 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:07,643 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:07,643 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerWithAssertThread1of1ForFork1_sz#1, N, cnt) = 2*workerWithAssertThread1of1ForFork1_sz#1 + 3*N - 2*cnt Supporting invariants [3*N - 2*cnt >= 0] [2025-04-26 16:22:07,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-04-26 16:22:07,652 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:07,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:07,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:22:07,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:22:07,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:07,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:07,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 16:22:07,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:07,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:07,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:07,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:07,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:07,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:07,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:07,957 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:22:07,957 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 4 loop predicates [2025-04-26 16:22:07,957 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1310 states and 3358 transitions. cyclomatic complexity: 2109 Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (in total 25), 11 states have internal predecessors, (25), 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:22:08,686 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1310 states and 3358 transitions. cyclomatic complexity: 2109. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (in total 25), 11 states have internal predecessors, (25), 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 2240 states and 5640 transitions. Complement of second has 22 states. [2025-04-26 16:22:08,686 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 11 stem states 4 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (in total 25), 11 states have internal predecessors, (25), 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:22:08,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 164 transitions. [2025-04-26 16:22:08,687 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 17 states and 164 transitions. Stem has 17 letters. Loop has 8 letters. [2025-04-26 16:22:08,687 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:08,687 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 17 states and 164 transitions. Stem has 25 letters. Loop has 8 letters. [2025-04-26 16:22:08,687 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:08,687 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 17 states and 164 transitions. Stem has 17 letters. Loop has 16 letters. [2025-04-26 16:22:08,687 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:08,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2240 states and 5640 transitions. [2025-04-26 16:22:08,694 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 432 [2025-04-26 16:22:08,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2240 states to 2142 states and 5402 transitions. [2025-04-26 16:22:08,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1294 [2025-04-26 16:22:08,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1348 [2025-04-26 16:22:08,701 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2142 states and 5402 transitions. [2025-04-26 16:22:08,701 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:08,701 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2142 states and 5402 transitions. [2025-04-26 16:22:08,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2142 states and 5402 transitions. [2025-04-26 16:22:08,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2142 to 1382. [2025-04-26 16:22:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1382 states have (on average 2.5600578871201156) internal successors, (in total 3538), 1381 states have internal predecessors, (3538), 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:22:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 3538 transitions. [2025-04-26 16:22:08,719 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1382 states and 3538 transitions. [2025-04-26 16:22:08,719 INFO L438 stractBuchiCegarLoop]: Abstraction has 1382 states and 3538 transitions. [2025-04-26 16:22:08,719 INFO L340 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-04-26 16:22:08,719 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1382 states and 3538 transitions. [2025-04-26 16:22:08,722 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 276 [2025-04-26 16:22:08,722 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:08,722 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:08,723 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:08,723 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:08,723 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:22:08,723 INFO L754 eck$LassoCheckResult]: Loop: "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:22:08,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:08,723 INFO L85 PathProgramCache]: Analyzing trace with hash 149732013, now seen corresponding path program 2 times [2025-04-26 16:22:08,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:08,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519371446] [2025-04-26 16:22:08,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:08,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:08,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-04-26 16:22:08,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:08,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:22:08,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,728 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:08,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:08,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:08,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:08,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:08,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1336743739, now seen corresponding path program 9 times [2025-04-26 16:22:08,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:08,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188918370] [2025-04-26 16:22:08,733 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:08,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:08,734 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:08,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:08,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:08,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,735 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:08,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:08,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:08,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:08,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:08,737 INFO L85 PathProgramCache]: Analyzing trace with hash 54158823, now seen corresponding path program 3 times [2025-04-26 16:22:08,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:08,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435047264] [2025-04-26 16:22:08,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:08,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:08,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:22:08,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:08,742 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:22:08,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,742 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:08,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:22:08,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:08,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:08,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:08,749 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:09,123 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:09,123 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:09,123 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:09,123 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:09,123 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:09,123 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:09,123 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:09,123 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:09,123 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration18_Lasso [2025-04-26 16:22:09,123 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:09,123 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:09,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,699 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:09,910 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-04-26 16:22:10,170 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:10,170 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:10,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:10,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:10,172 INFO L229 MonitoredProcess]: Starting monitored process 72 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:22:10,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-04-26 16:22:10,173 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:22:10,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:10,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:10,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:10,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:10,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:10,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:10,186 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:10,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-04-26 16:22:10,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:10,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:10,192 INFO L229 MonitoredProcess]: Starting monitored process 73 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:22:10,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-04-26 16:22:10,194 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:22:10,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:10,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:10,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:10,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:10,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:10,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:10,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:10,204 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:10,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2025-04-26 16:22:10,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:10,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:10,211 INFO L229 MonitoredProcess]: Starting monitored process 74 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:22:10,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-04-26 16:22:10,213 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:22:10,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:10,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:10,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:10,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:10,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:10,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:10,226 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:10,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-04-26 16:22:10,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:10,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:10,233 INFO L229 MonitoredProcess]: Starting monitored process 75 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:22:10,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-04-26 16:22:10,234 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:22:10,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:10,244 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:10,244 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:10,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:10,257 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:22:10,257 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:10,288 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:10,324 INFO L436 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-04-26 16:22:10,324 INFO L437 ModelExtractionUtils]: 29 out of 46 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-04-26 16:22:10,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:10,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:10,326 INFO L229 MonitoredProcess]: Starting monitored process 76 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:22:10,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-04-26 16:22:10,328 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:10,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-04-26 16:22:10,344 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:10,344 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:10,344 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerWithAssertThread1of1ForFork1_steal_num#1) = 3*N - 2*cnt + 2*workerWithAssertThread1of1ForFork1_steal_num#1 Supporting invariants [-2*cnt + 3*N >= 0] [2025-04-26 16:22:10,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-04-26 16:22:10,357 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:10,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:10,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:10,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:10,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:10,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-26 16:22:10,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:10,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:10,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:10,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:10,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:10,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:10,682 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:22:10,682 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 4 loop predicates [2025-04-26 16:22:10,682 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1382 states and 3538 transitions. cyclomatic complexity: 2217 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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:22:10,857 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1382 states and 3538 transitions. cyclomatic complexity: 2217. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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 1884 states and 4734 transitions. Complement of second has 18 states. [2025-04-26 16:22:10,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:10,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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:22:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2025-04-26 16:22:10,858 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 12 states and 67 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:10,858 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:10,858 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:10,871 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:10,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:10,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:10,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:10,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:10,886 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-26 16:22:10,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:11,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:11,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:11,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:11,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:11,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:11,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:11,208 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:22:11,208 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 4 loop predicates [2025-04-26 16:22:11,209 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1382 states and 3538 transitions. cyclomatic complexity: 2217 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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:22:11,373 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1382 states and 3538 transitions. cyclomatic complexity: 2217. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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 1884 states and 4734 transitions. Complement of second has 18 states. [2025-04-26 16:22:11,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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:22:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2025-04-26 16:22:11,374 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 12 states and 67 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:11,374 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:11,374 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:11,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:11,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:11,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:11,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:11,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:11,395 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-26 16:22:11,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:11,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:11,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:11,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:11,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:11,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:11,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:11,638 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:22:11,638 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 4 loop predicates [2025-04-26 16:22:11,639 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1382 states and 3538 transitions. cyclomatic complexity: 2217 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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:22:11,965 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1382 states and 3538 transitions. cyclomatic complexity: 2217. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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 2643 states and 6645 transitions. Complement of second has 24 states. [2025-04-26 16:22:11,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 10 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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:22:11,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 169 transitions. [2025-04-26 16:22:11,965 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 17 states and 169 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:11,966 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:11,966 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 17 states and 169 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:22:11,966 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:11,966 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 17 states and 169 transitions. Stem has 18 letters. Loop has 16 letters. [2025-04-26 16:22:11,966 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:11,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2643 states and 6645 transitions. [2025-04-26 16:22:11,977 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 318 [2025-04-26 16:22:11,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2643 states to 2404 states and 6048 transitions. [2025-04-26 16:22:11,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1389 [2025-04-26 16:22:11,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1581 [2025-04-26 16:22:11,988 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2404 states and 6048 transitions. [2025-04-26 16:22:11,988 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:11,988 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2404 states and 6048 transitions. [2025-04-26 16:22:11,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states and 6048 transitions. [2025-04-26 16:22:12,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1530. [2025-04-26 16:22:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1530 states, 1530 states have (on average 2.581699346405229) internal successors, (in total 3950), 1529 states have internal predecessors, (3950), 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:22:12,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 3950 transitions. [2025-04-26 16:22:12,027 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1530 states and 3950 transitions. [2025-04-26 16:22:12,027 INFO L438 stractBuchiCegarLoop]: Abstraction has 1530 states and 3950 transitions. [2025-04-26 16:22:12,027 INFO L340 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-04-26 16:22:12,027 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1530 states and 3950 transitions. [2025-04-26 16:22:12,031 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 276 [2025-04-26 16:22:12,031 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:12,031 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:12,032 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:12,032 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:12,032 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:12,032 INFO L754 eck$LassoCheckResult]: Loop: "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:12,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:12,033 INFO L85 PathProgramCache]: Analyzing trace with hash -185505215, now seen corresponding path program 2 times [2025-04-26 16:22:12,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:12,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612990420] [2025-04-26 16:22:12,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:12,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:12,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:12,037 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:12,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:12,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:12,038 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:12,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:12,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:12,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:12,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:12,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:12,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:12,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1105178277, now seen corresponding path program 10 times [2025-04-26 16:22:12,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:12,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459533697] [2025-04-26 16:22:12,042 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:12,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:12,043 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:22:12,044 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:12,044 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:12,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:12,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:12,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:12,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:12,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:12,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:12,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:12,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:12,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1725727845, now seen corresponding path program 3 times [2025-04-26 16:22:12,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:12,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305003530] [2025-04-26 16:22:12,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:12,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:12,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:22:12,054 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:12,054 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:22:12,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:12,054 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:12,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:22:12,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:12,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:12,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:12,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:12,447 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:12,447 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:12,447 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:12,447 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:12,447 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:12,447 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:12,447 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:12,447 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:12,447 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration19_Lasso [2025-04-26 16:22:12,447 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:12,447 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:12,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:12,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:12,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:12,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:12,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:12,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:12,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:12,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:13,034 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-04-26 16:22:13,381 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:13,381 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:13,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:13,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:13,383 INFO L229 MonitoredProcess]: Starting monitored process 77 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:22:13,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-04-26 16:22:13,384 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:22:13,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:13,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:13,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:13,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:13,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:13,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:13,397 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:13,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2025-04-26 16:22:13,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:13,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:13,404 INFO L229 MonitoredProcess]: Starting monitored process 78 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:22:13,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-04-26 16:22:13,406 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:22:13,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:13,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:13,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:13,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:13,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:13,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:13,419 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:13,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-04-26 16:22:13,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:13,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:13,427 INFO L229 MonitoredProcess]: Starting monitored process 79 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:22:13,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-04-26 16:22:13,428 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:22:13,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:13,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:13,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:13,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:13,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:13,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:13,441 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:13,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:13,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:13,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:13,448 INFO L229 MonitoredProcess]: Starting monitored process 80 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:22:13,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-04-26 16:22:13,450 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:22:13,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:13,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:13,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:13,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:13,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:13,459 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:13,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:13,460 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:13,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-04-26 16:22:13,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:13,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:13,467 INFO L229 MonitoredProcess]: Starting monitored process 81 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:22:13,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-04-26 16:22:13,469 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:22:13,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:13,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:13,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:13,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:13,479 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:13,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:13,481 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:13,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-04-26 16:22:13,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:13,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:13,489 INFO L229 MonitoredProcess]: Starting monitored process 82 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:22:13,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-04-26 16:22:13,491 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:22:13,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:13,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:13,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:13,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:13,502 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:13,502 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:13,504 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:13,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-04-26 16:22:13,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:13,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:13,511 INFO L229 MonitoredProcess]: Starting monitored process 83 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:22:13,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-04-26 16:22:13,513 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:22:13,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:13,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:13,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:13,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:13,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:13,523 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:13,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:13,524 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:13,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-04-26 16:22:13,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:13,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:13,530 INFO L229 MonitoredProcess]: Starting monitored process 84 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:22:13,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-04-26 16:22:13,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:22:13,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:13,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:13,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:13,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:13,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:13,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:13,546 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:13,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-04-26 16:22:13,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:13,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:13,554 INFO L229 MonitoredProcess]: Starting monitored process 85 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:22:13,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-04-26 16:22:13,555 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:22:13,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:13,566 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:13,566 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:13,566 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:13,582 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:22:13,583 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:13,614 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:13,654 INFO L436 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-04-26 16:22:13,654 INFO L437 ModelExtractionUtils]: 31 out of 46 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:22:13,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:13,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:13,656 INFO L229 MonitoredProcess]: Starting monitored process 86 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:22:13,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-04-26 16:22:13,657 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:13,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-04-26 16:22:13,674 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:13,674 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:13,675 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerThread1of1ForFork0_steal_num#1) = 3*N - 2*cnt + 2*workerThread1of1ForFork0_steal_num#1 Supporting invariants [-2*cnt + 3*N >= 0] [2025-04-26 16:22:13,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-04-26 16:22:13,685 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:13,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:13,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:13,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:13,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:13,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:13,706 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-26 16:22:13,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:14,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:14,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:14,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:14,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:14,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:14,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:14,200 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:22:14,200 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.11 stem predicates 4 loop predicates [2025-04-26 16:22:14,200 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1530 states and 3950 transitions. cyclomatic complexity: 2481 Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (in total 26), 14 states have internal predecessors, (26), 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:22:14,384 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1530 states and 3950 transitions. cyclomatic complexity: 2481. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (in total 26), 14 states have internal predecessors, (26), 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 1903 states and 4847 transitions. Complement of second has 18 states. [2025-04-26 16:22:14,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:14,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (in total 26), 14 states have internal predecessors, (26), 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:22:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2025-04-26 16:22:14,384 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 12 states and 63 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:14,385 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:14,385 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:14,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:14,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:14,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:14,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:14,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:14,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-26 16:22:14,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:14,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:14,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:14,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:14,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:14,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:14,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:14,813 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:22:14,814 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 4 loop predicates [2025-04-26 16:22:14,814 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1530 states and 3950 transitions. cyclomatic complexity: 2481 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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:22:14,979 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1530 states and 3950 transitions. cyclomatic complexity: 2481. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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 1903 states and 4847 transitions. Complement of second has 18 states. [2025-04-26 16:22:14,979 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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:22:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2025-04-26 16:22:14,979 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 12 states and 63 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:14,980 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:14,980 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:14,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:14,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:15,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:15,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:15,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:15,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-26 16:22:15,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:15,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:15,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:15,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:15,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:15,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:15,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:15,390 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:22:15,391 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 4 loop predicates [2025-04-26 16:22:15,391 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1530 states and 3950 transitions. cyclomatic complexity: 2481 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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:22:15,742 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1530 states and 3950 transitions. cyclomatic complexity: 2481. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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 2704 states and 6870 transitions. Complement of second has 31 states. [2025-04-26 16:22:15,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 10 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:15,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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:22:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 152 transitions. [2025-04-26 16:22:15,744 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 17 states and 152 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:15,744 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:15,744 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 17 states and 152 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:22:15,744 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:15,744 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 17 states and 152 transitions. Stem has 18 letters. Loop has 16 letters. [2025-04-26 16:22:15,745 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:15,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2704 states and 6870 transitions. [2025-04-26 16:22:15,754 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 318 [2025-04-26 16:22:15,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2704 states to 2457 states and 6288 transitions. [2025-04-26 16:22:15,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1474 [2025-04-26 16:22:15,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1634 [2025-04-26 16:22:15,763 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2457 states and 6288 transitions. [2025-04-26 16:22:15,763 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:15,763 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2457 states and 6288 transitions. [2025-04-26 16:22:15,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states and 6288 transitions. [2025-04-26 16:22:15,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 1670. [2025-04-26 16:22:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1670 states have (on average 2.594610778443114) internal successors, (in total 4333), 1669 states have internal predecessors, (4333), 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:22:15,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 4333 transitions. [2025-04-26 16:22:15,797 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1670 states and 4333 transitions. [2025-04-26 16:22:15,797 INFO L438 stractBuchiCegarLoop]: Abstraction has 1670 states and 4333 transitions. [2025-04-26 16:22:15,797 INFO L340 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-04-26 16:22:15,797 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1670 states and 4333 transitions. [2025-04-26 16:22:15,802 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 276 [2025-04-26 16:22:15,802 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:15,802 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:15,802 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:15,802 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:15,803 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:15,806 INFO L754 eck$LassoCheckResult]: Loop: "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:15,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:15,806 INFO L85 PathProgramCache]: Analyzing trace with hash 453697633, now seen corresponding path program 4 times [2025-04-26 16:22:15,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:15,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545223273] [2025-04-26 16:22:15,806 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:15,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:15,809 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-26 16:22:15,816 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:15,816 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:15,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:15,816 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:15,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:15,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:15,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:15,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:15,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:15,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:15,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1105178277, now seen corresponding path program 11 times [2025-04-26 16:22:15,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:15,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40437946] [2025-04-26 16:22:15,823 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:15,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:15,825 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:15,826 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:15,826 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:15,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:15,826 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:15,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:15,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:15,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:15,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:15,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:15,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:15,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1443573317, now seen corresponding path program 5 times [2025-04-26 16:22:15,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:15,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546798916] [2025-04-26 16:22:15,829 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:15,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:15,831 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:22:15,835 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:15,835 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:22:15,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:15,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:15,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:22:15,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:15,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:15,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:15,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:16,216 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:16,216 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:16,216 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:16,216 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:16,216 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:16,216 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,216 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:16,216 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:16,216 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration20_Lasso [2025-04-26 16:22:16,216 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:16,216 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:16,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:16,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:16,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:16,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:16,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:16,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:16,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:16,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:16,702 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-04-26 16:22:16,947 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:16,948 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:16,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,949 INFO L229 MonitoredProcess]: Starting monitored process 87 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:22:16,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-04-26 16:22:16,951 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:22:16,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:16,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,961 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:16,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:16,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:16,964 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-04-26 16:22:16,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,972 INFO L229 MonitoredProcess]: Starting monitored process 88 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:22:16,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-04-26 16:22:16,974 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:22:16,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:16,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:16,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:16,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:16,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:16,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:16,987 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:16,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-04-26 16:22:16,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:16,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:16,994 INFO L229 MonitoredProcess]: Starting monitored process 89 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:22:16,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-04-26 16:22:16,996 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:22:17,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:17,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:17,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:17,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:17,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:17,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:17,009 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:17,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:17,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:17,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:17,017 INFO L229 MonitoredProcess]: Starting monitored process 90 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:22:17,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-04-26 16:22:17,019 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:22:17,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:17,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:17,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:17,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:17,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:17,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:17,032 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:17,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-04-26 16:22:17,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:17,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:17,040 INFO L229 MonitoredProcess]: Starting monitored process 91 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:22:17,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-04-26 16:22:17,042 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:22:17,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:17,052 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:17,052 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:17,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:17,066 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:22:17,066 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:17,097 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:17,128 INFO L436 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-04-26 16:22:17,128 INFO L437 ModelExtractionUtils]: 29 out of 46 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-04-26 16:22:17,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:17,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:17,130 INFO L229 MonitoredProcess]: Starting monitored process 92 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:22:17,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-04-26 16:22:17,131 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:17,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-04-26 16:22:17,148 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:17,148 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:17,148 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerThread1of1ForFork0_steal_num#1) = 3*N - 2*cnt + 2*workerThread1of1ForFork0_steal_num#1 Supporting invariants [3*N - 2*cnt >= 0] [2025-04-26 16:22:17,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2025-04-26 16:22:17,158 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:17,171 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:17,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:17,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:17,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:17,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:17,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-26 16:22:17,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:17,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:17,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:17,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:17,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:17,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:17,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:17,474 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:22:17,474 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 4 loop predicates [2025-04-26 16:22:17,475 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1670 states and 4333 transitions. cyclomatic complexity: 2724 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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:22:17,626 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1670 states and 4333 transitions. cyclomatic complexity: 2724. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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 2114 states and 5429 transitions. Complement of second has 17 states. [2025-04-26 16:22:17,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 4 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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:22:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2025-04-26 16:22:17,626 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 58 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:17,626 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:17,626 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:17,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:17,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:17,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:17,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:17,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:17,650 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-26 16:22:17,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:18,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:18,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:18,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:18,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:18,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:18,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:18,064 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:22:18,064 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 4 loop predicates [2025-04-26 16:22:18,064 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1670 states and 4333 transitions. cyclomatic complexity: 2724 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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:22:18,223 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1670 states and 4333 transitions. cyclomatic complexity: 2724. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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 2114 states and 5429 transitions. Complement of second has 17 states. [2025-04-26 16:22:18,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 4 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:18,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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:22:18,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2025-04-26 16:22:18,223 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 58 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:18,223 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:18,223 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:18,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:18,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:18,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:18,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:18,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:18,250 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-26 16:22:18,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:18,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:18,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:18,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:18,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:18,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:18,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:18,606 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:22:18,606 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.10 stem predicates 4 loop predicates [2025-04-26 16:22:18,606 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1670 states and 4333 transitions. cyclomatic complexity: 2724 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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:22:19,036 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1670 states and 4333 transitions. cyclomatic complexity: 2724. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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 3421 states and 8575 transitions. Complement of second has 63 states. [2025-04-26 16:22:19,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 13 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:19,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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:22:19,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 179 transitions. [2025-04-26 16:22:19,037 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 20 states and 179 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:19,037 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:19,037 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 20 states and 179 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:22:19,037 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:19,037 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 20 states and 179 transitions. Stem has 18 letters. Loop has 16 letters. [2025-04-26 16:22:19,037 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:19,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3421 states and 8575 transitions. [2025-04-26 16:22:19,051 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 318 [2025-04-26 16:22:19,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3421 states to 2988 states and 7620 transitions. [2025-04-26 16:22:19,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1776 [2025-04-26 16:22:19,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1972 [2025-04-26 16:22:19,062 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2988 states and 7620 transitions. [2025-04-26 16:22:19,062 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:19,062 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2988 states and 7620 transitions. [2025-04-26 16:22:19,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states and 7620 transitions. [2025-04-26 16:22:19,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 1693. [2025-04-26 16:22:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1693 states have (on average 2.5930301240401654) internal successors, (in total 4390), 1692 states have internal predecessors, (4390), 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:22:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 4390 transitions. [2025-04-26 16:22:19,103 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1693 states and 4390 transitions. [2025-04-26 16:22:19,103 INFO L438 stractBuchiCegarLoop]: Abstraction has 1693 states and 4390 transitions. [2025-04-26 16:22:19,103 INFO L340 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-04-26 16:22:19,103 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1693 states and 4390 transitions. [2025-04-26 16:22:19,109 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 276 [2025-04-26 16:22:19,110 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:19,110 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:19,111 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:19,111 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:19,112 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:22:19,112 INFO L754 eck$LassoCheckResult]: Loop: "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:22:19,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:19,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1435371961, now seen corresponding path program 4 times [2025-04-26 16:22:19,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:19,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373267279] [2025-04-26 16:22:19,112 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:19,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:19,115 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-04-26 16:22:19,118 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:19,118 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:19,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:19,118 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:19,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:19,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:19,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:19,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:19,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:19,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:19,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1336743739, now seen corresponding path program 10 times [2025-04-26 16:22:19,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:19,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195594886] [2025-04-26 16:22:19,124 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:19,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:19,126 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:22:19,127 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:19,127 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:19,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:19,127 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:19,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:19,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:19,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:19,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:19,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:19,129 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:19,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1182754689, now seen corresponding path program 5 times [2025-04-26 16:22:19,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:19,129 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124134906] [2025-04-26 16:22:19,130 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:19,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:19,132 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:22:19,135 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:19,135 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:22:19,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:19,135 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:19,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:22:19,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:19,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:19,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:19,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:19,516 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:19,517 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:19,517 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:19,517 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:19,517 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:19,517 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:19,517 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:19,517 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:19,517 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration21_Lasso [2025-04-26 16:22:19,517 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:19,517 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:19,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:19,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:19,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:19,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:19,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:19,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:19,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:19,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:20,119 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-04-26 16:22:20,373 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:20,373 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:20,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:20,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:20,375 INFO L229 MonitoredProcess]: Starting monitored process 93 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:22:20,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-04-26 16:22:20,377 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:22:20,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:20,388 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:20,388 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:20,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:20,401 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:22:20,401 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:20,434 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:20,465 INFO L436 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-04-26 16:22:20,465 INFO L437 ModelExtractionUtils]: 31 out of 46 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:22:20,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:20,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:20,467 INFO L229 MonitoredProcess]: Starting monitored process 94 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:22:20,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-04-26 16:22:20,468 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:20,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:20,486 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:20,486 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:20,486 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerWithAssertThread1of1ForFork1_steal_num#1) = 3*N - 2*cnt + 2*workerWithAssertThread1of1ForFork1_steal_num#1 Supporting invariants [3*N - 2*cnt >= 0] [2025-04-26 16:22:20,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2025-04-26 16:22:20,496 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:20,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:20,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:20,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:20,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:20,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:20,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-26 16:22:20,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:20,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:20,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:20,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:20,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:20,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:20,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:20,856 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:22:20,856 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 4 loop predicates [2025-04-26 16:22:20,857 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1693 states and 4390 transitions. cyclomatic complexity: 2758 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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:22:21,017 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1693 states and 4390 transitions. cyclomatic complexity: 2758. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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 2270 states and 5767 transitions. Complement of second has 18 states. [2025-04-26 16:22:21,018 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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:22:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2025-04-26 16:22:21,018 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 12 states and 67 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:21,018 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:21,018 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:21,031 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:21,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:21,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:21,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:21,038 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-26 16:22:21,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:21,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:21,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:21,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:21,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:21,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:21,374 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:22:21,374 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.11 stem predicates 4 loop predicates [2025-04-26 16:22:21,375 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1693 states and 4390 transitions. cyclomatic complexity: 2758 Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (in total 26), 14 states have internal predecessors, (26), 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:22:21,553 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1693 states and 4390 transitions. cyclomatic complexity: 2758. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (in total 26), 14 states have internal predecessors, (26), 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 2270 states and 5767 transitions. Complement of second has 18 states. [2025-04-26 16:22:21,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 5 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (in total 26), 14 states have internal predecessors, (26), 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:22:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 67 transitions. [2025-04-26 16:22:21,554 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 12 states and 67 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:21,554 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:21,554 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:21,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:21,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:21,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:21,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:21,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-26 16:22:21,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:21,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:21,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:21,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:21,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:21,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:21,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:21,934 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:22:21,935 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 4 loop predicates [2025-04-26 16:22:21,935 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1693 states and 4390 transitions. cyclomatic complexity: 2758 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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:22:23,295 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1693 states and 4390 transitions. cyclomatic complexity: 2758. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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 5888 states and 14967 transitions. Complement of second has 87 states. [2025-04-26 16:22:23,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 33 states 26 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:23,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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:22:23,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 350 transitions. [2025-04-26 16:22:23,296 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 33 states and 350 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:23,296 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:23,296 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 33 states and 350 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:22:23,296 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:23,296 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 33 states and 350 transitions. Stem has 18 letters. Loop has 16 letters. [2025-04-26 16:22:23,297 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:23,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5888 states and 14967 transitions. [2025-04-26 16:22:23,320 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 1662 [2025-04-26 16:22:23,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5888 states to 5608 states and 14247 transitions. [2025-04-26 16:22:23,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3656 [2025-04-26 16:22:23,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3981 [2025-04-26 16:22:23,345 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5608 states and 14247 transitions. [2025-04-26 16:22:23,345 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:23,345 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5608 states and 14247 transitions. [2025-04-26 16:22:23,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5608 states and 14247 transitions. [2025-04-26 16:22:23,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5608 to 3453. [2025-04-26 16:22:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3453 states, 3453 states have (on average 2.592817839559803) internal successors, (in total 8953), 3452 states have internal predecessors, (8953), 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:22:23,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3453 states to 3453 states and 8953 transitions. [2025-04-26 16:22:23,406 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3453 states and 8953 transitions. [2025-04-26 16:22:23,406 INFO L438 stractBuchiCegarLoop]: Abstraction has 3453 states and 8953 transitions. [2025-04-26 16:22:23,406 INFO L340 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-04-26 16:22:23,406 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3453 states and 8953 transitions. [2025-04-26 16:22:23,416 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 920 [2025-04-26 16:22:23,416 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:23,416 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:23,416 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:23,417 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:23,417 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:23,417 INFO L754 eck$LassoCheckResult]: Loop: "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:23,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,417 INFO L85 PathProgramCache]: Analyzing trace with hash -403392959, now seen corresponding path program 6 times [2025-04-26 16:22:23,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862543784] [2025-04-26 16:22:23,417 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:23,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,423 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:23,428 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:23,428 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:23,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,428 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:23,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:23,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1105178277, now seen corresponding path program 12 times [2025-04-26 16:22:23,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112981562] [2025-04-26 16:22:23,433 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:23,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,436 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:23,437 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:23,437 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:23,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,437 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:23,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:23,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:23,439 INFO L85 PathProgramCache]: Analyzing trace with hash 706398107, now seen corresponding path program 7 times [2025-04-26 16:22:23,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:23,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706510139] [2025-04-26 16:22:23,439 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:23,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:23,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:22:23,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:23,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,445 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:23,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:22:23,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:23,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:23,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:23,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:23,832 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:23,832 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:23,832 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:23,832 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:23,832 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:23,832 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:23,832 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:23,832 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:23,833 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration22_Lasso [2025-04-26 16:22:23,833 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:23,833 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:23,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:23,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:23,838 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:23,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:23,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:23,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:23,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:24,383 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-04-26 16:22:24,608 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:24,608 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:24,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,610 INFO L229 MonitoredProcess]: Starting monitored process 95 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:22:24,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-04-26 16:22:24,612 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:22:24,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,625 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:24,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,631 INFO L229 MonitoredProcess]: Starting monitored process 96 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:22:24,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-04-26 16:22:24,633 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:22:24,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,645 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-04-26 16:22:24,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,652 INFO L229 MonitoredProcess]: Starting monitored process 97 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:22:24,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2025-04-26 16:22:24,653 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:22:24,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,666 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2025-04-26 16:22:24,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,673 INFO L229 MonitoredProcess]: Starting monitored process 98 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:22:24,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2025-04-26 16:22:24,674 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:22:24,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,686 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2025-04-26 16:22:24,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,693 INFO L229 MonitoredProcess]: Starting monitored process 99 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:22:24,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-04-26 16:22:24,694 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:22:24,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:24,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:24,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:24,705 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:24,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,711 INFO L229 MonitoredProcess]: Starting monitored process 100 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:22:24,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-04-26 16:22:24,713 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:22:24,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,725 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:24,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,732 INFO L229 MonitoredProcess]: Starting monitored process 101 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:22:24,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-04-26 16:22:24,733 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:22:24,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:24,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:24,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:24,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:24,746 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:24,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:24,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,752 INFO L229 MonitoredProcess]: Starting monitored process 102 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:22:24,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-04-26 16:22:24,754 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:22:24,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:24,763 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:24,763 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:24,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:24,777 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:22:24,777 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:24,807 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:24,844 INFO L436 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-04-26 16:22:24,844 INFO L437 ModelExtractionUtils]: 28 out of 46 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-04-26 16:22:24,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:24,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:24,846 INFO L229 MonitoredProcess]: Starting monitored process 103 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:22:24,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-04-26 16:22:24,847 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:24,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-04-26 16:22:24,865 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:24,865 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:24,865 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerThread1of1ForFork0_steal_num#1) = 3*N - 2*cnt + 2*workerThread1of1ForFork0_steal_num#1 Supporting invariants [3*N - 2*cnt >= 0] [2025-04-26 16:22:24,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:24,874 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:24,887 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:24,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:24,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:24,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:24,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:24,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-26 16:22:24,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:25,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:25,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:25,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:25,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:25,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:25,288 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:22:25,288 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 4 loop predicates [2025-04-26 16:22:25,288 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3453 states and 8953 transitions. cyclomatic complexity: 5621 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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:22:25,457 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3453 states and 8953 transitions. cyclomatic complexity: 5621. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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 4067 states and 10455 transitions. Complement of second has 17 states. [2025-04-26 16:22:25,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 4 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:25,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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:22:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 58 transitions. [2025-04-26 16:22:25,458 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 58 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:25,458 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:25,458 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:25,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:25,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:25,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:25,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:25,476 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-26 16:22:25,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:25,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:25,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:25,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:25,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:25,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:25,870 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:22:25,871 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 4 loop predicates [2025-04-26 16:22:25,871 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3453 states and 8953 transitions. cyclomatic complexity: 5621 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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:22:25,929 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3453 states and 8953 transitions. cyclomatic complexity: 5621. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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 3804 states and 9855 transitions. Complement of second has 5 states. [2025-04-26 16:22:25,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 3 stem states 0 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:25,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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:22:25,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2025-04-26 16:22:25,929 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:25,929 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:25,929 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:25,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:25,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:25,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:25,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:25,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:25,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-26 16:22:25,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:26,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:26,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:26,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:26,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:26,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:26,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:26,333 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:22:26,333 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 4 loop predicates [2025-04-26 16:22:26,334 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3453 states and 8953 transitions. cyclomatic complexity: 5621 Second operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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:22:26,807 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3453 states and 8953 transitions. cyclomatic complexity: 5621. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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 6362 states and 16377 transitions. Complement of second has 42 states. [2025-04-26 16:22:26,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 12 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (in total 26), 12 states have internal predecessors, (26), 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:22:26,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 205 transitions. [2025-04-26 16:22:26,808 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 19 states and 205 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:26,808 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:26,808 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 19 states and 205 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:22:26,808 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:26,808 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 19 states and 205 transitions. Stem has 18 letters. Loop has 16 letters. [2025-04-26 16:22:26,808 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:26,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6362 states and 16377 transitions. [2025-04-26 16:22:26,828 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 1046 [2025-04-26 16:22:26,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6362 states to 5835 states and 14963 transitions. [2025-04-26 16:22:26,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3448 [2025-04-26 16:22:26,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3859 [2025-04-26 16:22:26,845 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5835 states and 14963 transitions. [2025-04-26 16:22:26,845 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:26,845 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5835 states and 14963 transitions. [2025-04-26 16:22:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5835 states and 14963 transitions. [2025-04-26 16:22:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5835 to 3446. [2025-04-26 16:22:26,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3446 states, 3446 states have (on average 2.5931514799767847) internal successors, (in total 8936), 3445 states have internal predecessors, (8936), 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:22:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3446 states to 3446 states and 8936 transitions. [2025-04-26 16:22:26,943 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3446 states and 8936 transitions. [2025-04-26 16:22:26,943 INFO L438 stractBuchiCegarLoop]: Abstraction has 3446 states and 8936 transitions. [2025-04-26 16:22:26,943 INFO L340 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-04-26 16:22:26,943 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3446 states and 8936 transitions. [2025-04-26 16:22:26,953 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 922 [2025-04-26 16:22:26,954 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:26,954 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:26,954 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:26,954 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:26,954 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:26,954 INFO L754 eck$LassoCheckResult]: Loop: "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:26,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:26,955 INFO L85 PathProgramCache]: Analyzing trace with hash 149257353, now seen corresponding path program 6 times [2025-04-26 16:22:26,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:26,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617759634] [2025-04-26 16:22:26,955 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:26,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:26,957 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 18 statements into 2 equivalence classes. [2025-04-26 16:22:26,961 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:26,961 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-26 16:22:26,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:26,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:26,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:26,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:26,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:26,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:26,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:26,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:26,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1105178277, now seen corresponding path program 13 times [2025-04-26 16:22:26,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:26,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830414139] [2025-04-26 16:22:26,967 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:26,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:26,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:26,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:26,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:26,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:26,970 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:26,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:26,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:26,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:26,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:26,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:26,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:26,972 INFO L85 PathProgramCache]: Analyzing trace with hash -64698909, now seen corresponding path program 1 times [2025-04-26 16:22:26,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:26,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017195420] [2025-04-26 16:22:26,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:26,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:26,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:22:26,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:26,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:26,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:26,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:26,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:22:26,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:26,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:26,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:26,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:27,362 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:27,363 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:27,363 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:27,363 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:27,363 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:27,363 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,363 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:27,363 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:27,363 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration23_Lasso [2025-04-26 16:22:27,363 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:27,363 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:27,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:27,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:27,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:27,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:27,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:27,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:27,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:27,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:27,745 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-04-26 16:22:27,968 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:27,968 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:27,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,969 INFO L229 MonitoredProcess]: Starting monitored process 104 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:22:27,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-04-26 16:22:27,971 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:22:27,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:27,980 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:27,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:27,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:27,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:27,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:27,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:27,982 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:27,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2025-04-26 16:22:27,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:27,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:27,989 INFO L229 MonitoredProcess]: Starting monitored process 105 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:22:27,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-04-26 16:22:27,990 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:22:28,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:28,000 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:28,000 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:28,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:28,012 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:22:28,012 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:28,057 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:28,080 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:22:28,080 INFO L437 ModelExtractionUtils]: 33 out of 46 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:22:28,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:28,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:28,082 INFO L229 MonitoredProcess]: Starting monitored process 106 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:22:28,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-04-26 16:22:28,084 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:28,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2025-04-26 16:22:28,100 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:28,100 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:28,100 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerThread1of1ForFork0_steal_num#1) = 3*N - 2*cnt + 2*workerThread1of1ForFork0_steal_num#1 Supporting invariants [-2*cnt + 3*N >= 0] [2025-04-26 16:22:28,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-04-26 16:22:28,110 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:28,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:28,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:28,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:28,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:28,132 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-26 16:22:28,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:28,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:28,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:28,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:28,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:28,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:28,444 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:22:28,444 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 4 loop predicates [2025-04-26 16:22:28,444 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3446 states and 8936 transitions. cyclomatic complexity: 5611 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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:22:28,822 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3446 states and 8936 transitions. cyclomatic complexity: 5611. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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 6444 states and 16426 transitions. Complement of second has 24 states. [2025-04-26 16:22:28,823 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 18 states 11 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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:22:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 135 transitions. [2025-04-26 16:22:28,823 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 18 states and 135 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:28,823 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:28,824 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 18 states and 135 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:22:28,824 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:28,824 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 18 states and 135 transitions. Stem has 18 letters. Loop has 16 letters. [2025-04-26 16:22:28,824 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:28,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6444 states and 16426 transitions. [2025-04-26 16:22:28,855 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 922 [2025-04-26 16:22:28,873 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6444 states to 5181 states and 13283 transitions. [2025-04-26 16:22:28,873 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3122 [2025-04-26 16:22:28,877 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3424 [2025-04-26 16:22:28,877 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5181 states and 13283 transitions. [2025-04-26 16:22:28,877 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:28,877 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5181 states and 13283 transitions. [2025-04-26 16:22:28,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5181 states and 13283 transitions. [2025-04-26 16:22:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5181 to 3518. [2025-04-26 16:22:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3518 states, 3518 states have (on average 2.584991472427516) internal successors, (in total 9094), 3517 states have internal predecessors, (9094), 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:22:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3518 states to 3518 states and 9094 transitions. [2025-04-26 16:22:28,931 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3518 states and 9094 transitions. [2025-04-26 16:22:28,931 INFO L438 stractBuchiCegarLoop]: Abstraction has 3518 states and 9094 transitions. [2025-04-26 16:22:28,931 INFO L340 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-04-26 16:22:28,931 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3518 states and 9094 transitions. [2025-04-26 16:22:28,940 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 922 [2025-04-26 16:22:28,940 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:28,940 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:28,940 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:28,940 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:28,941 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:28,941 INFO L754 eck$LassoCheckResult]: Loop: "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:28,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:28,941 INFO L85 PathProgramCache]: Analyzing trace with hash 19990341, now seen corresponding path program 7 times [2025-04-26 16:22:28,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:28,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064351225] [2025-04-26 16:22:28,941 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:28,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:28,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:28,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:28,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,945 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:28,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:28,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:28,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:28,954 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:28,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1105178277, now seen corresponding path program 14 times [2025-04-26 16:22:28,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:28,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589034679] [2025-04-26 16:22:28,954 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:28,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:28,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:28,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:28,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:28,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,956 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:28,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:28,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:28,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:28,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:28,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1065866399, now seen corresponding path program 2 times [2025-04-26 16:22:28,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:28,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878122853] [2025-04-26 16:22:28,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:28,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:28,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:22:28,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:28,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:22:28,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,967 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:28,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:22:28,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:28,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:28,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:28,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:29,370 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:29,370 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:29,370 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:29,370 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:29,370 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:29,370 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:29,370 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:29,370 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:29,370 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration24_Lasso [2025-04-26 16:22:29,371 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:29,371 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:29,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:29,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:29,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:29,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:29,382 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:29,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:29,740 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:29,898 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-04-26 16:22:30,125 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:30,125 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:30,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:30,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:30,127 INFO L229 MonitoredProcess]: Starting monitored process 107 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:22:30,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-04-26 16:22:30,129 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:22:30,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:30,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:30,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:30,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:30,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:30,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:30,142 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:30,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2025-04-26 16:22:30,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:30,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:30,149 INFO L229 MonitoredProcess]: Starting monitored process 108 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:22:30,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-04-26 16:22:30,151 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:22:30,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:30,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:30,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:30,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:30,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:30,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:30,163 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:30,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2025-04-26 16:22:30,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:30,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:30,170 INFO L229 MonitoredProcess]: Starting monitored process 109 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:22:30,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-04-26 16:22:30,172 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:22:30,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:30,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:30,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:30,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:30,182 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:30,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:30,184 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:30,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2025-04-26 16:22:30,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:30,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:30,191 INFO L229 MonitoredProcess]: Starting monitored process 110 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:22:30,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-04-26 16:22:30,193 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:22:30,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:30,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:30,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:30,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:30,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:30,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:30,208 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:30,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-04-26 16:22:30,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:30,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:30,216 INFO L229 MonitoredProcess]: Starting monitored process 111 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:22:30,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-04-26 16:22:30,217 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:22:30,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:30,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:30,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:30,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:30,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:30,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:30,230 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:30,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:30,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:30,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:30,237 INFO L229 MonitoredProcess]: Starting monitored process 112 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:22:30,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-04-26 16:22:30,238 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:22:30,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:30,248 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:30,248 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:30,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:30,261 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:22:30,261 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:30,291 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:30,319 INFO L436 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-04-26 16:22:30,319 INFO L437 ModelExtractionUtils]: 36 out of 51 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:22:30,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:30,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:30,321 INFO L229 MonitoredProcess]: Starting monitored process 113 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:22:30,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-04-26 16:22:30,322 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:30,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-04-26 16:22:30,338 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:30,339 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:30,339 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerThread1of1ForFork0_steal_num#1) = 3*N - 2*cnt + 2*workerThread1of1ForFork0_steal_num#1 Supporting invariants [-2*cnt + 3*N >= 0] [2025-04-26 16:22:30,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2025-04-26 16:22:30,348 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:30,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:30,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:30,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:30,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:30,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:30,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-26 16:22:30,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:30,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:30,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:30,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:30,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:30,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:30,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:30,694 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:22:30,694 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 4 loop predicates [2025-04-26 16:22:30,694 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3518 states and 9094 transitions. cyclomatic complexity: 5697 Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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:22:31,295 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3518 states and 9094 transitions. cyclomatic complexity: 5697. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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 7391 states and 19100 transitions. Complement of second has 26 states. [2025-04-26 16:22:31,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 14 stem states 5 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (in total 26), 13 states have internal predecessors, (26), 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:22:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 150 transitions. [2025-04-26 16:22:31,296 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 20 states and 150 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:31,296 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:31,296 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 20 states and 150 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:22:31,296 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:31,296 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 20 states and 150 transitions. Stem has 18 letters. Loop has 16 letters. [2025-04-26 16:22:31,296 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:31,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7391 states and 19100 transitions. [2025-04-26 16:22:31,330 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 922 [2025-04-26 16:22:31,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7391 states to 5687 states and 14648 transitions. [2025-04-26 16:22:31,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3337 [2025-04-26 16:22:31,350 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3592 [2025-04-26 16:22:31,350 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5687 states and 14648 transitions. [2025-04-26 16:22:31,350 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:31,350 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5687 states and 14648 transitions. [2025-04-26 16:22:31,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5687 states and 14648 transitions. [2025-04-26 16:22:31,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5687 to 3377. [2025-04-26 16:22:31,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3377 states, 3377 states have (on average 2.599644655019248) internal successors, (in total 8779), 3376 states have internal predecessors, (8779), 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:22:31,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 8779 transitions. [2025-04-26 16:22:31,401 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3377 states and 8779 transitions. [2025-04-26 16:22:31,401 INFO L438 stractBuchiCegarLoop]: Abstraction has 3377 states and 8779 transitions. [2025-04-26 16:22:31,401 INFO L340 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-04-26 16:22:31,401 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3377 states and 8779 transitions. [2025-04-26 16:22:31,410 INFO L131 ngComponentsAnalysis]: Automaton has 38 accepting balls. 922 [2025-04-26 16:22:31,411 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:31,411 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:31,411 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:31,411 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:31,411 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:22:31,412 INFO L754 eck$LassoCheckResult]: Loop: "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:22:31,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:31,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1435371961, now seen corresponding path program 8 times [2025-04-26 16:22:31,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:31,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954717722] [2025-04-26 16:22:31,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:31,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:31,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:31,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:31,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:31,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,416 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:31,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:31,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:31,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:31,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:31,420 INFO L85 PathProgramCache]: Analyzing trace with hash 2064492837, now seen corresponding path program 1 times [2025-04-26 16:22:31,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:31,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324197612] [2025-04-26 16:22:31,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:31,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:31,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:31,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:31,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,425 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:31,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:31,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:31,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:31,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:31,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1833325419, now seen corresponding path program 3 times [2025-04-26 16:22:31,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:31,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247844894] [2025-04-26 16:22:31,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:31,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:31,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 2 equivalence classes. [2025-04-26 16:22:31,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:22:31,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:22:31,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,437 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:31,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:22:31,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:22:31,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:31,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:31,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:32,083 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:32,083 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:32,083 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:32,083 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:32,083 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:32,083 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:32,083 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:32,083 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:32,083 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration25_Lasso [2025-04-26 16:22:32,083 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:32,083 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:32,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:32,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:32,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:32,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:32,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:32,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:33,032 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-04-26 16:22:33,033 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-04-26 16:22:33,523 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:33,523 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:33,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:33,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:33,525 INFO L229 MonitoredProcess]: Starting monitored process 114 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:22:33,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-04-26 16:22:33,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:22:33,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:33,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:33,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:33,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:33,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:33,536 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:33,538 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:33,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-04-26 16:22:33,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:33,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:33,545 INFO L229 MonitoredProcess]: Starting monitored process 115 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:22:33,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-04-26 16:22:33,546 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:22:33,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:33,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:33,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:33,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:33,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:33,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:33,559 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:33,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2025-04-26 16:22:33,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:33,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:33,565 INFO L229 MonitoredProcess]: Starting monitored process 116 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:22:33,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-04-26 16:22:33,567 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:22:33,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:33,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:33,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:33,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:33,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:33,577 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:33,580 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:33,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:33,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:33,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:33,587 INFO L229 MonitoredProcess]: Starting monitored process 117 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:22:33,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-04-26 16:22:33,589 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:22:33,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:33,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:33,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:33,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:33,599 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:33,599 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:33,601 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:33,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:33,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:33,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:33,607 INFO L229 MonitoredProcess]: Starting monitored process 118 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:22:33,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-04-26 16:22:33,609 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:22:33,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:33,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:33,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:33,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:33,620 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:33,620 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:33,622 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:33,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:33,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:33,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:33,629 INFO L229 MonitoredProcess]: Starting monitored process 119 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:22:33,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-04-26 16:22:33,631 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:22:33,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:33,640 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:33,640 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:22:33,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:33,675 INFO L402 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2025-04-26 16:22:33,675 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:33,768 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:33,924 INFO L436 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2025-04-26 16:22:33,925 INFO L437 ModelExtractionUtils]: 51 out of 78 variables were initially zero. Simplification set additionally 21 variables to zero. [2025-04-26 16:22:33,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:33,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:33,926 INFO L229 MonitoredProcess]: Starting monitored process 120 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:22:33,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-04-26 16:22:33,928 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:33,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-04-26 16:22:33,946 INFO L439 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2025-04-26 16:22:33,947 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:33,947 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerWithAssertThread1of1ForFork1_steal_num#1) = 2*N - 1*cnt + 2*workerWithAssertThread1of1ForFork1_steal_num#1 Supporting invariants [-1*cnt + 2*N >= 0] [2025-04-26 16:22:33,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2025-04-26 16:22:33,960 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:33,972 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:33,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:33,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:33,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:33,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:33,981 WARN L254 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-26 16:22:33,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:34,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:34,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:34,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:34,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 16:22:34,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:34,415 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:22:34,416 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 7 loop predicates [2025-04-26 16:22:34,416 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3377 states and 8779 transitions. cyclomatic complexity: 5523 Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (in total 34), 17 states have internal predecessors, (34), 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:22:34,569 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3377 states and 8779 transitions. cyclomatic complexity: 5523. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (in total 34), 17 states have internal predecessors, (34), 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 4140 states and 10531 transitions. Complement of second has 16 states. [2025-04-26 16:22:34,570 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 5 stem states 4 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:34,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (in total 34), 17 states have internal predecessors, (34), 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:22:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2025-04-26 16:22:34,570 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 61 transitions. Stem has 18 letters. Loop has 16 letters. [2025-04-26 16:22:34,571 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:34,571 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:34,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:34,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:34,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:34,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:34,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-26 16:22:34,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:34,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:34,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:34,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:34,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:34,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 16:22:34,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:35,160 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:22:35,160 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.10 stem predicates 7 loop predicates [2025-04-26 16:22:35,160 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3377 states and 8779 transitions. cyclomatic complexity: 5523 Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (in total 34), 17 states have internal predecessors, (34), 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:22:35,214 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3377 states and 8779 transitions. cyclomatic complexity: 5523. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (in total 34), 17 states have internal predecessors, (34), 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 3629 states and 9399 transitions. Complement of second has 6 states. [2025-04-26 16:22:35,214 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 4 stem states 0 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:35,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (in total 34), 17 states have internal predecessors, (34), 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:22:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 29 transitions. [2025-04-26 16:22:35,215 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 29 transitions. Stem has 18 letters. Loop has 16 letters. [2025-04-26 16:22:35,215 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:35,215 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:35,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:35,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:35,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:35,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:35,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:35,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-26 16:22:35,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:35,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:35,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:35,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:35,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:35,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 16:22:35,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:35,683 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:22:35,684 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 7 loop predicates [2025-04-26 16:22:35,684 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3377 states and 8779 transitions. cyclomatic complexity: 5523 Second operand has 17 states, 17 states have (on average 2.0) internal successors, (in total 34), 16 states have internal predecessors, (34), 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:22:36,475 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3377 states and 8779 transitions. cyclomatic complexity: 5523. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (in total 34), 16 states have internal predecessors, (34), 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 10062 states and 25332 transitions. Complement of second has 49 states. [2025-04-26 16:22:36,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 28 states 12 stem states 14 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:36,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0) internal successors, (in total 34), 16 states have internal predecessors, (34), 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:22:36,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 256 transitions. [2025-04-26 16:22:36,476 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 28 states and 256 transitions. Stem has 18 letters. Loop has 16 letters. [2025-04-26 16:22:36,476 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:36,476 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 28 states and 256 transitions. Stem has 34 letters. Loop has 16 letters. [2025-04-26 16:22:36,477 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:36,477 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 28 states and 256 transitions. Stem has 18 letters. Loop has 32 letters. [2025-04-26 16:22:36,477 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:36,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10062 states and 25332 transitions. [2025-04-26 16:22:36,524 INFO L131 ngComponentsAnalysis]: Automaton has 74 accepting balls. 1294 [2025-04-26 16:22:36,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10062 states to 7871 states and 19933 transitions. [2025-04-26 16:22:36,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4384 [2025-04-26 16:22:36,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4799 [2025-04-26 16:22:36,557 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7871 states and 19933 transitions. [2025-04-26 16:22:36,557 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:36,557 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7871 states and 19933 transitions. [2025-04-26 16:22:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7871 states and 19933 transitions. [2025-04-26 16:22:36,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7871 to 4880. [2025-04-26 16:22:36,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4880 states, 4880 states have (on average 2.602254098360656) internal successors, (in total 12699), 4879 states have internal predecessors, (12699), 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:22:36,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4880 states to 4880 states and 12699 transitions. [2025-04-26 16:22:36,647 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4880 states and 12699 transitions. [2025-04-26 16:22:36,647 INFO L438 stractBuchiCegarLoop]: Abstraction has 4880 states and 12699 transitions. [2025-04-26 16:22:36,647 INFO L340 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2025-04-26 16:22:36,647 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4880 states and 12699 transitions. [2025-04-26 16:22:36,662 INFO L131 ngComponentsAnalysis]: Automaton has 54 accepting balls. 1050 [2025-04-26 16:22:36,662 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:36,662 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:36,662 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:36,663 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:36,663 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:36,663 INFO L754 eck$LassoCheckResult]: Loop: "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:36,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:36,663 INFO L85 PathProgramCache]: Analyzing trace with hash -983942109, now seen corresponding path program 8 times [2025-04-26 16:22:36,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:36,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14697716] [2025-04-26 16:22:36,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:36,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:36,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:36,673 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:36,673 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:36,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:36,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:36,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:36,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:36,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:36,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:36,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:36,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:36,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1105178277, now seen corresponding path program 15 times [2025-04-26 16:22:36,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:36,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105349215] [2025-04-26 16:22:36,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:36,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:36,679 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:36,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:36,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:36,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:36,680 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:36,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:36,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:36,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:36,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:36,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:36,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:36,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1150634877, now seen corresponding path program 9 times [2025-04-26 16:22:36,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:36,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938840982] [2025-04-26 16:22:36,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:36,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:36,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:22:36,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:36,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:22:36,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:36,688 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:36,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:22:36,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:22:36,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:36,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:36,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:37,075 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:37,076 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:37,076 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:37,076 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:37,076 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:37,076 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,076 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:37,076 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:37,076 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration26_Lasso [2025-04-26 16:22:37,076 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:37,076 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:37,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:37,607 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-04-26 16:22:37,840 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:37,840 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:37,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,842 INFO L229 MonitoredProcess]: Starting monitored process 121 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:22:37,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-04-26 16:22:37,843 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:22:37,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:37,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:37,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:37,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:37,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:37,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:37,856 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:37,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:37,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,864 INFO L229 MonitoredProcess]: Starting monitored process 122 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:22:37,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2025-04-26 16:22:37,865 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:22:37,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:37,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:37,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:37,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:37,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:37,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:37,878 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:37,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:37,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,885 INFO L229 MonitoredProcess]: Starting monitored process 123 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:22:37,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2025-04-26 16:22:37,887 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:22:37,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:37,897 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:37,897 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:37,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:37,910 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2025-04-26 16:22:37,910 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:37,941 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:37,976 INFO L436 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-04-26 16:22:37,976 INFO L437 ModelExtractionUtils]: 30 out of 46 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-04-26 16:22:37,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:37,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:37,978 INFO L229 MonitoredProcess]: Starting monitored process 124 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:22:37,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2025-04-26 16:22:37,980 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:37,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:37,996 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:37,997 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:37,997 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerThread1of1ForFork0_steal_num#1) = 1*N - 1*cnt + 1*workerThread1of1ForFork0_steal_num#1 Supporting invariants [1*N - 1*cnt >= 0] [2025-04-26 16:22:38,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2025-04-26 16:22:38,006 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:38,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:38,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:38,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:38,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:38,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:38,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:38,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:38,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:38,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:38,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:22:38,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:38,158 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:22:38,158 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2025-04-26 16:22:38,159 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4880 states and 12699 transitions. cyclomatic complexity: 7990 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (in total 26), 6 states have internal predecessors, (26), 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:22:38,285 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4880 states and 12699 transitions. cyclomatic complexity: 7990. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (in total 26), 6 states have internal predecessors, (26), 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 7408 states and 19494 transitions. Complement of second has 15 states. [2025-04-26 16:22:38,285 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 4 stem states 4 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:38,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (in total 26), 6 states have internal predecessors, (26), 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:22:38,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2025-04-26 16:22:38,286 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 84 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:38,286 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:38,286 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:38,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:38,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:38,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:38,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:38,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:38,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:38,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:38,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:38,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:38,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:22:38,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:38,452 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:22:38,453 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 3 loop predicates [2025-04-26 16:22:38,453 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4880 states and 12699 transitions. cyclomatic complexity: 7990 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (in total 26), 6 states have internal predecessors, (26), 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:22:38,578 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4880 states and 12699 transitions. cyclomatic complexity: 7990. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (in total 26), 6 states have internal predecessors, (26), 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 7408 states and 19494 transitions. Complement of second has 15 states. [2025-04-26 16:22:38,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 4 stem states 4 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (in total 26), 6 states have internal predecessors, (26), 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:22:38,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2025-04-26 16:22:38,579 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 84 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:38,579 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:38,579 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:38,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:38,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:22:38,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:22:38,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:38,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:38,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:38,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:38,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:38,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:38,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:38,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-26 16:22:38,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:38,729 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:22:38,729 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 3 loop predicates [2025-04-26 16:22:38,729 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4880 states and 12699 transitions. cyclomatic complexity: 7990 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (in total 26), 6 states have internal predecessors, (26), 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:22:38,888 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4880 states and 12699 transitions. cyclomatic complexity: 7990. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (in total 26), 6 states have internal predecessors, (26), 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 9536 states and 25061 transitions. Complement of second has 14 states. [2025-04-26 16:22:38,888 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 4 stem states 4 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:38,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (in total 26), 6 states have internal predecessors, (26), 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:22:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2025-04-26 16:22:38,888 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 107 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:22:38,888 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:38,889 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 107 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:22:38,889 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:38,889 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 107 transitions. Stem has 18 letters. Loop has 16 letters. [2025-04-26 16:22:38,889 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:38,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9536 states and 25061 transitions. [2025-04-26 16:22:38,933 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1368 [2025-04-26 16:22:38,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9536 states to 7905 states and 20298 transitions. [2025-04-26 16:22:38,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3463 [2025-04-26 16:22:38,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3908 [2025-04-26 16:22:38,965 INFO L74 IsDeterministic]: Start isDeterministic. Operand 7905 states and 20298 transitions. [2025-04-26 16:22:38,965 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:38,965 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7905 states and 20298 transitions. [2025-04-26 16:22:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7905 states and 20298 transitions. [2025-04-26 16:22:39,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7905 to 4207. [2025-04-26 16:22:39,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4207 states, 4207 states have (on average 2.5999524601854054) internal successors, (in total 10938), 4206 states have internal predecessors, (10938), 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:22:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4207 states to 4207 states and 10938 transitions. [2025-04-26 16:22:39,042 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4207 states and 10938 transitions. [2025-04-26 16:22:39,042 INFO L438 stractBuchiCegarLoop]: Abstraction has 4207 states and 10938 transitions. [2025-04-26 16:22:39,042 INFO L340 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2025-04-26 16:22:39,042 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4207 states and 10938 transitions. [2025-04-26 16:22:39,055 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 1284 [2025-04-26 16:22:39,055 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:39,055 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:39,056 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:39,056 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:39,056 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:39,056 INFO L754 eck$LassoCheckResult]: Loop: "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:39,057 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:39,057 INFO L85 PathProgramCache]: Analyzing trace with hash 880510916, now seen corresponding path program 2 times [2025-04-26 16:22:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:39,057 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261570138] [2025-04-26 16:22:39,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:39,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:39,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:39,060 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:39,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:39,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:39,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:39,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:39,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:39,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:39,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:39,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:39,063 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:39,063 INFO L85 PathProgramCache]: Analyzing trace with hash 641196653, now seen corresponding path program 2 times [2025-04-26 16:22:39,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:39,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256405766] [2025-04-26 16:22:39,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:39,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:39,066 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:39,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:39,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:39,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:39,068 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:39,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:39,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:39,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:39,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:39,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:39,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:39,071 INFO L85 PathProgramCache]: Analyzing trace with hash 170492976, now seen corresponding path program 4 times [2025-04-26 16:22:39,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:39,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449197631] [2025-04-26 16:22:39,071 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:39,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:39,073 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-26 16:22:39,077 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:22:39,077 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:39,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:39,077 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:39,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:22:39,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:22:39,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:39,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:39,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:39,493 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:39,494 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:39,494 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:39,494 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:39,494 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:39,494 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:39,494 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:39,494 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:39,494 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration27_Lasso [2025-04-26 16:22:39,494 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:39,494 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:39,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:40,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:40,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:40,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:40,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:40,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:40,312 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:22:40,313 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-04-26 16:22:40,810 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:40,810 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:40,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,812 INFO L229 MonitoredProcess]: Starting monitored process 125 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:22:40,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2025-04-26 16:22:40,814 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:22:40,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:40,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:40,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:40,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:40,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:40,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:40,826 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:40,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:40,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:40,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:40,833 INFO L229 MonitoredProcess]: Starting monitored process 126 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:22:40,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-04-26 16:22:40,834 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:22:40,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:40,845 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:40,845 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:22:40,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:40,876 INFO L402 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2025-04-26 16:22:40,876 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:40,957 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:41,068 INFO L436 ModelExtractionUtils]: Simplification made 23 calls to the SMT solver. [2025-04-26 16:22:41,068 INFO L437 ModelExtractionUtils]: 50 out of 78 variables were initially zero. Simplification set additionally 22 variables to zero. [2025-04-26 16:22:41,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,070 INFO L229 MonitoredProcess]: Starting monitored process 127 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:22:41,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-04-26 16:22:41,071 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:41,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:41,090 INFO L439 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2025-04-26 16:22:41,090 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:41,090 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerWithAssertThread1of1ForFork1_sz#1, cnt) = 3*N + 2*workerWithAssertThread1of1ForFork1_sz#1 - 2*cnt Supporting invariants [3*N - 2*cnt >= 0] [2025-04-26 16:22:41,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2025-04-26 16:22:41,102 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:41,116 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:41,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:41,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:41,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:41,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:41,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 16:22:41,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:41,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:41,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:41,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:41,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:41,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 16:22:41,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:41,430 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:22:41,430 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 6 loop predicates [2025-04-26 16:22:41,430 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4207 states and 10938 transitions. cyclomatic complexity: 6834 Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (in total 27), 12 states have internal predecessors, (27), 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:22:41,574 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4207 states and 10938 transitions. cyclomatic complexity: 6834. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (in total 27), 12 states have internal predecessors, (27), 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 6162 states and 15743 transitions. Complement of second has 17 states. [2025-04-26 16:22:41,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 6 stem states 4 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (in total 27), 12 states have internal predecessors, (27), 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:22:41,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 114 transitions. [2025-04-26 16:22:41,575 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 12 states and 114 transitions. Stem has 11 letters. Loop has 16 letters. [2025-04-26 16:22:41,575 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:41,575 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:41,587 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:41,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:41,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:41,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:41,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:41,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 16:22:41,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:41,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:41,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:41,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:41,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:41,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-26 16:22:41,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:41,930 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:22:41,930 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 7 loop predicates [2025-04-26 16:22:41,930 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4207 states and 10938 transitions. cyclomatic complexity: 6834 Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (in total 27), 13 states have internal predecessors, (27), 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:22:42,606 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4207 states and 10938 transitions. cyclomatic complexity: 6834. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (in total 27), 13 states have internal predecessors, (27), 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 6200 states and 15870 transitions. Complement of second has 35 states. [2025-04-26 16:22:42,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 21 states 6 stem states 13 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:42,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (in total 27), 13 states have internal predecessors, (27), 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:22:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 182 transitions. [2025-04-26 16:22:42,607 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 21 states and 182 transitions. Stem has 11 letters. Loop has 16 letters. [2025-04-26 16:22:42,607 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:42,607 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 21 states and 182 transitions. Stem has 27 letters. Loop has 16 letters. [2025-04-26 16:22:42,607 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:42,607 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 21 states and 182 transitions. Stem has 11 letters. Loop has 32 letters. [2025-04-26 16:22:42,607 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:42,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6200 states and 15870 transitions. [2025-04-26 16:22:42,630 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 1444 [2025-04-26 16:22:42,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6200 states to 5626 states and 14486 transitions. [2025-04-26 16:22:42,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2624 [2025-04-26 16:22:42,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2766 [2025-04-26 16:22:42,645 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5626 states and 14486 transitions. [2025-04-26 16:22:42,645 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:42,645 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5626 states and 14486 transitions. [2025-04-26 16:22:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5626 states and 14486 transitions. [2025-04-26 16:22:42,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5626 to 4533. [2025-04-26 16:22:42,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4533 states, 4533 states have (on average 2.600485329803662) internal successors, (in total 11788), 4532 states have internal predecessors, (11788), 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:22:42,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4533 states to 4533 states and 11788 transitions. [2025-04-26 16:22:42,725 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4533 states and 11788 transitions. [2025-04-26 16:22:42,725 INFO L438 stractBuchiCegarLoop]: Abstraction has 4533 states and 11788 transitions. [2025-04-26 16:22:42,725 INFO L340 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2025-04-26 16:22:42,725 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4533 states and 11788 transitions. [2025-04-26 16:22:42,733 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 1380 [2025-04-26 16:22:42,733 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:42,734 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:42,734 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:42,734 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:42,734 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:42,734 INFO L754 eck$LassoCheckResult]: Loop: "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:42,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:42,735 INFO L85 PathProgramCache]: Analyzing trace with hash 585291716, now seen corresponding path program 3 times [2025-04-26 16:22:42,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:42,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410789269] [2025-04-26 16:22:42,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:42,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:42,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:42,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:42,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:42,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:42,738 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:42,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:42,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:42,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:42,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:42,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:42,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:42,740 INFO L85 PathProgramCache]: Analyzing trace with hash -668520581, now seen corresponding path program 3 times [2025-04-26 16:22:42,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:42,740 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238903280] [2025-04-26 16:22:42,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:42,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:42,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:42,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:42,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:22:42,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:42,746 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:42,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:42,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:42,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:42,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:42,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:42,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:42,749 INFO L85 PathProgramCache]: Analyzing trace with hash 299901246, now seen corresponding path program 5 times [2025-04-26 16:22:42,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:42,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12780149] [2025-04-26 16:22:42,749 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:42,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:42,751 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-26 16:22:42,754 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:22:42,755 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:22:42,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:42,755 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:42,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:22:42,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:22:42,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:42,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:42,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:43,182 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:43,182 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:43,182 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:43,182 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:43,182 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:43,182 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:43,182 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:43,182 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:43,182 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration28_Lasso [2025-04-26 16:22:43,182 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:43,182 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:43,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:44,121 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-04-26 16:22:44,122 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-04-26 16:22:44,574 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:44,575 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:44,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,576 INFO L229 MonitoredProcess]: Starting monitored process 128 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:22:44,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-04-26 16:22:44,579 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:22:44,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:44,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:44,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:44,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:44,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:44,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:44,592 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:44,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:44,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,602 INFO L229 MonitoredProcess]: Starting monitored process 129 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:22:44,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-04-26 16:22:44,603 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:22:44,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:44,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:44,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:44,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:44,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:44,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:44,616 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:44,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:44,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,624 INFO L229 MonitoredProcess]: Starting monitored process 130 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:22:44,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-04-26 16:22:44,625 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:22:44,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:44,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:44,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:44,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:44,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:44,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:44,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:44,636 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:44,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-04-26 16:22:44,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,643 INFO L229 MonitoredProcess]: Starting monitored process 131 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:22:44,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-04-26 16:22:44,645 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:22:44,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:44,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:44,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:44,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:44,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:44,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:44,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:44,658 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:44,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2025-04-26 16:22:44,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,666 INFO L229 MonitoredProcess]: Starting monitored process 132 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:22:44,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-04-26 16:22:44,668 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:22:44,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:44,679 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:22:44,679 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:22:44,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:44,709 INFO L402 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2025-04-26 16:22:44,709 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:22:44,811 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:44,906 INFO L436 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-04-26 16:22:44,906 INFO L437 ModelExtractionUtils]: 55 out of 78 variables were initially zero. Simplification set additionally 17 variables to zero. [2025-04-26 16:22:44,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,908 INFO L229 MonitoredProcess]: Starting monitored process 133 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:22:44,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-04-26 16:22:44,909 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:44,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2025-04-26 16:22:44,927 INFO L439 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2025-04-26 16:22:44,927 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:44,927 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerWithAssertThread1of1ForFork1_sz#1, cnt) = 3*N + 2*workerWithAssertThread1of1ForFork1_sz#1 - 2*cnt Supporting invariants [3*N - 2*cnt >= 0] [2025-04-26 16:22:44,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:44,940 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:44,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:44,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:44,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:44,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:44,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:44,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 16:22:44,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:45,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:45,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:45,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:45,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 16:22:45,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:45,255 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:22:45,256 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 6 loop predicates [2025-04-26 16:22:45,256 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4533 states and 11788 transitions. cyclomatic complexity: 7372 Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (in total 27), 12 states have internal predecessors, (27), 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:22:45,449 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4533 states and 11788 transitions. cyclomatic complexity: 7372. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (in total 27), 12 states have internal predecessors, (27), 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 11798 states and 29430 transitions. Complement of second has 19 states. [2025-04-26 16:22:45,450 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 6 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:45,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (in total 27), 12 states have internal predecessors, (27), 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:22:45,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 118 transitions. [2025-04-26 16:22:45,451 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 118 transitions. Stem has 11 letters. Loop has 16 letters. [2025-04-26 16:22:45,451 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:45,451 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:45,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:45,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:45,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:45,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:45,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-26 16:22:45,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:45,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:45,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:45,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:45,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 16:22:45,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:45,743 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:22:45,744 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 6 loop predicates [2025-04-26 16:22:45,744 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4533 states and 11788 transitions. cyclomatic complexity: 7372 Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (in total 27), 12 states have internal predecessors, (27), 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:22:46,125 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4533 states and 11788 transitions. cyclomatic complexity: 7372. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (in total 27), 12 states have internal predecessors, (27), 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 12561 states and 31384 transitions. Complement of second has 25 states. [2025-04-26 16:22:46,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 6 stem states 8 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:46,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (in total 27), 12 states have internal predecessors, (27), 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:22:46,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 138 transitions. [2025-04-26 16:22:46,126 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 16 states and 138 transitions. Stem has 11 letters. Loop has 16 letters. [2025-04-26 16:22:46,126 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,126 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 16 states and 138 transitions. Stem has 27 letters. Loop has 16 letters. [2025-04-26 16:22:46,126 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,126 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 16 states and 138 transitions. Stem has 11 letters. Loop has 32 letters. [2025-04-26 16:22:46,126 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12561 states and 31384 transitions. [2025-04-26 16:22:46,183 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 1864 [2025-04-26 16:22:46,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12561 states to 11276 states and 28423 transitions. [2025-04-26 16:22:46,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3891 [2025-04-26 16:22:46,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4070 [2025-04-26 16:22:46,228 INFO L74 IsDeterministic]: Start isDeterministic. Operand 11276 states and 28423 transitions. [2025-04-26 16:22:46,228 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:46,228 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11276 states and 28423 transitions. [2025-04-26 16:22:46,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11276 states and 28423 transitions. [2025-04-26 16:22:46,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11276 to 8436. [2025-04-26 16:22:46,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8436 states, 8436 states have (on average 2.558321479374111) internal successors, (in total 21582), 8435 states have internal predecessors, (21582), 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:22:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8436 states to 8436 states and 21582 transitions. [2025-04-26 16:22:46,355 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8436 states and 21582 transitions. [2025-04-26 16:22:46,355 INFO L438 stractBuchiCegarLoop]: Abstraction has 8436 states and 21582 transitions. [2025-04-26 16:22:46,355 INFO L340 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2025-04-26 16:22:46,355 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8436 states and 21582 transitions. [2025-04-26 16:22:46,375 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 1856 [2025-04-26 16:22:46,375 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:46,375 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:46,375 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:46,375 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:46,375 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:46,376 INFO L754 eck$LassoCheckResult]: Loop: "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:46,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,376 INFO L85 PathProgramCache]: Analyzing trace with hash 62426946, now seen corresponding path program 1 times [2025-04-26 16:22:46,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881297634] [2025-04-26 16:22:46,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:46,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:46,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:46,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,379 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:46,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:46,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,381 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1027480109, now seen corresponding path program 4 times [2025-04-26 16:22:46,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536729534] [2025-04-26 16:22:46,381 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:22:46,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,389 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-26 16:22:46,391 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:46,391 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:22:46,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,391 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:46,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:46,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,395 INFO L85 PathProgramCache]: Analyzing trace with hash 790234990, now seen corresponding path program 6 times [2025-04-26 16:22:46,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78975520] [2025-04-26 16:22:46,395 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:46,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,401 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 2 equivalence classes. [2025-04-26 16:22:46,404 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:22:46,404 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-26 16:22:46,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,404 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:22:46,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:22:46,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,737 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:46,737 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:46,737 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:46,737 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:46,737 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:46,737 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,737 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:46,737 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:46,737 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration29_Lasso [2025-04-26 16:22:46,737 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:46,737 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:46,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:47,317 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:47,317 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:47,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:47,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:47,319 INFO L229 MonitoredProcess]: Starting monitored process 134 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:22:47,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-04-26 16:22:47,321 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:22:47,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:47,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:47,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:47,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:47,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:47,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:47,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:47,332 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:47,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2025-04-26 16:22:47,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:47,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:47,339 INFO L229 MonitoredProcess]: Starting monitored process 135 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:22:47,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-04-26 16:22:47,341 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:22:47,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:47,351 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:47,351 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:47,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:47,366 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:22:47,366 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:47,404 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:47,483 INFO L436 ModelExtractionUtils]: Simplification made 25 calls to the SMT solver. [2025-04-26 16:22:47,483 INFO L437 ModelExtractionUtils]: 16 out of 56 variables were initially zero. Simplification set additionally 33 variables to zero. [2025-04-26 16:22:47,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:47,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:47,485 INFO L229 MonitoredProcess]: Starting monitored process 136 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:22:47,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-04-26 16:22:47,486 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:47,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:47,502 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:22:47,502 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:47,503 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerWithAssertThread1of1ForFork1_i#1, workerThread1of1ForFork0_steal_num#1) = 1*N - 1*workerWithAssertThread1of1ForFork1_i#1 + 1*workerThread1of1ForFork0_steal_num#1 Supporting invariants [-1*workerWithAssertThread1of1ForFork1_i#1 + 1*cnt - 1 >= 0] [2025-04-26 16:22:47,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2025-04-26 16:22:47,513 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:22:47,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:47,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:47,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:47,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:47,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:47,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:22:47,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:47,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:47,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:47,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:47,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:47,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-26 16:22:47,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:47,901 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:22:47,901 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 9 loop predicates [2025-04-26 16:22:47,902 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8436 states and 21582 transitions. cyclomatic complexity: 13351 Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (in total 29), 14 states have internal predecessors, (29), 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:22:49,419 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8436 states and 21582 transitions. cyclomatic complexity: 13351. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (in total 29), 14 states have internal predecessors, (29), 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 15737 states and 39376 transitions. Complement of second has 61 states. [2025-04-26 16:22:49,420 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 34 states 6 stem states 26 non-accepting loop states 2 accepting loop states [2025-04-26 16:22:49,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (in total 29), 14 states have internal predecessors, (29), 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:22:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 237 transitions. [2025-04-26 16:22:49,420 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 34 states and 237 transitions. Stem has 13 letters. Loop has 16 letters. [2025-04-26 16:22:49,420 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:49,421 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 34 states and 237 transitions. Stem has 29 letters. Loop has 16 letters. [2025-04-26 16:22:49,421 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:49,421 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 34 states and 237 transitions. Stem has 13 letters. Loop has 32 letters. [2025-04-26 16:22:49,421 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:49,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15737 states and 39376 transitions. [2025-04-26 16:22:49,508 INFO L131 ngComponentsAnalysis]: Automaton has 52 accepting balls. 2518 [2025-04-26 16:22:49,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15737 states to 13450 states and 33793 transitions. [2025-04-26 16:22:49,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5223 [2025-04-26 16:22:49,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5377 [2025-04-26 16:22:49,561 INFO L74 IsDeterministic]: Start isDeterministic. Operand 13450 states and 33793 transitions. [2025-04-26 16:22:49,561 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:49,561 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13450 states and 33793 transitions. [2025-04-26 16:22:49,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13450 states and 33793 transitions. [2025-04-26 16:22:49,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13450 to 9720. [2025-04-26 16:22:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9720 states, 9720 states have (on average 2.558641975308642) internal successors, (in total 24870), 9719 states have internal predecessors, (24870), 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:22:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9720 states to 9720 states and 24870 transitions. [2025-04-26 16:22:49,721 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9720 states and 24870 transitions. [2025-04-26 16:22:49,721 INFO L438 stractBuchiCegarLoop]: Abstraction has 9720 states and 24870 transitions. [2025-04-26 16:22:49,721 INFO L340 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2025-04-26 16:22:49,721 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9720 states and 24870 transitions. [2025-04-26 16:22:49,748 INFO L131 ngComponentsAnalysis]: Automaton has 34 accepting balls. 2262 [2025-04-26 16:22:49,748 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:49,748 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:49,749 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:49,749 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:49,749 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:49,750 INFO L754 eck$LassoCheckResult]: Loop: "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:49,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:49,750 INFO L85 PathProgramCache]: Analyzing trace with hash -175382718, now seen corresponding path program 2 times [2025-04-26 16:22:49,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:49,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632332411] [2025-04-26 16:22:49,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:49,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:49,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:49,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:49,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:49,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:49,752 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:49,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:49,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:49,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:49,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:49,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:49,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:49,755 INFO L85 PathProgramCache]: Analyzing trace with hash -845947771, now seen corresponding path program 5 times [2025-04-26 16:22:49,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:49,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751566625] [2025-04-26 16:22:49,755 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:22:49,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:49,757 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:49,759 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:49,759 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:49,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:49,759 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:49,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:49,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:49,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:49,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:49,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:49,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:49,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1063052858, now seen corresponding path program 7 times [2025-04-26 16:22:49,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:49,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634911091] [2025-04-26 16:22:49,762 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:49,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:49,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:22:49,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:22:49,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:49,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:49,766 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:49,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:22:49,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:22:49,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:49,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:49,771 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:50,103 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:50,103 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:50,103 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:50,103 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:50,103 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:50,103 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:50,103 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:50,103 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:50,103 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration30_Lasso [2025-04-26 16:22:50,103 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:50,103 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:50,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:50,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:50,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:50,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:50,304 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:50,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:50,792 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:50,792 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:50,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:50,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:50,794 INFO L229 MonitoredProcess]: Starting monitored process 137 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:22:50,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2025-04-26 16:22:50,796 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:22:50,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:50,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:50,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:50,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:50,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:50,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:50,809 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:50,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2025-04-26 16:22:50,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:50,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:50,816 INFO L229 MonitoredProcess]: Starting monitored process 138 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:22:50,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2025-04-26 16:22:50,818 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:22:50,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:50,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:50,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:50,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:50,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:50,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:50,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:50,829 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:50,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2025-04-26 16:22:50,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:50,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:50,836 INFO L229 MonitoredProcess]: Starting monitored process 139 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:22:50,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2025-04-26 16:22:50,837 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:22:50,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:50,848 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:50,848 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:50,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:50,864 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:22:50,864 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:50,903 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:50,930 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:22:50,930 INFO L437 ModelExtractionUtils]: 47 out of 56 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:22:50,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:50,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:50,932 INFO L229 MonitoredProcess]: Starting monitored process 140 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:22:50,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2025-04-26 16:22:50,933 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:50,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2025-04-26 16:22:50,950 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:22:50,950 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:50,950 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(cnt, N) = -1*cnt + 1*N Supporting invariants [] [2025-04-26 16:22:50,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2025-04-26 16:22:50,957 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:50,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:50,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:50,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:50,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:50,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:50,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:50,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:50,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:50,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:50,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:50,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:50,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 16:22:50,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:51,090 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:22:51,090 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:22:51,091 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9720 states and 24870 transitions. cyclomatic complexity: 15381 Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:22:51,392 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9720 states and 24870 transitions. cyclomatic complexity: 15381. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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 22360 states and 55978 transitions. Complement of second has 17 states. [2025-04-26 16:22:51,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:22:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2025-04-26 16:22:51,393 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 107 transitions. Stem has 13 letters. Loop has 16 letters. [2025-04-26 16:22:51,393 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:51,393 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:51,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:51,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:22:51,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:22:51,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:51,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:51,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:51,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:51,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:51,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:51,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:51,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:51,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 16:22:51,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:51,533 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:22:51,534 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:22:51,534 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9720 states and 24870 transitions. cyclomatic complexity: 15381 Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:22:52,029 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9720 states and 24870 transitions. cyclomatic complexity: 15381. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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 30203 states and 75793 transitions. Complement of second has 27 states. [2025-04-26 16:22:52,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:22:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 149 transitions. [2025-04-26 16:22:52,030 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 14 states and 149 transitions. Stem has 13 letters. Loop has 16 letters. [2025-04-26 16:22:52,030 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:52,030 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 14 states and 149 transitions. Stem has 29 letters. Loop has 16 letters. [2025-04-26 16:22:52,030 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:52,030 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 14 states and 149 transitions. Stem has 13 letters. Loop has 32 letters. [2025-04-26 16:22:52,030 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:52,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30203 states and 75793 transitions. [2025-04-26 16:22:52,266 INFO L131 ngComponentsAnalysis]: Automaton has 94 accepting balls. 4418 [2025-04-26 16:22:52,363 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30203 states to 25986 states and 65724 transitions. [2025-04-26 16:22:52,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7460 [2025-04-26 16:22:52,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7882 [2025-04-26 16:22:52,372 INFO L74 IsDeterministic]: Start isDeterministic. Operand 25986 states and 65724 transitions. [2025-04-26 16:22:52,372 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:52,372 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25986 states and 65724 transitions. [2025-04-26 16:22:52,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25986 states and 65724 transitions. [2025-04-26 16:22:52,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25986 to 19190. [2025-04-26 16:22:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19190 states, 19190 states have (on average 2.5724335591453884) internal successors, (in total 49365), 19189 states have internal predecessors, (49365), 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:22:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19190 states to 19190 states and 49365 transitions. [2025-04-26 16:22:52,700 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19190 states and 49365 transitions. [2025-04-26 16:22:52,700 INFO L438 stractBuchiCegarLoop]: Abstraction has 19190 states and 49365 transitions. [2025-04-26 16:22:52,700 INFO L340 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2025-04-26 16:22:52,700 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19190 states and 49365 transitions. [2025-04-26 16:22:52,754 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 3462 [2025-04-26 16:22:52,754 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:52,754 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:52,755 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:52,755 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:52,755 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[103] ULTIMATE.startFINAL-->ULTIMATE.startEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:22:52,756 INFO L754 eck$LassoCheckResult]: Loop: "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" [2025-04-26 16:22:52,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:52,756 INFO L85 PathProgramCache]: Analyzing trace with hash 54885002, now seen corresponding path program 1 times [2025-04-26 16:22:52,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:52,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406587262] [2025-04-26 16:22:52,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:52,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:52,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:52,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:52,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:52,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:52,759 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:52,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:52,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:52,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:52,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:52,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:52,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:52,762 INFO L85 PathProgramCache]: Analyzing trace with hash -35364113, now seen corresponding path program 6 times [2025-04-26 16:22:52,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:52,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130196439] [2025-04-26 16:22:52,762 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:22:52,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:52,764 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:52,765 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:52,766 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:22:52,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:52,766 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:52,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:52,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:52,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:52,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:52,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:52,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:52,773 INFO L85 PathProgramCache]: Analyzing trace with hash -170022024, now seen corresponding path program 1 times [2025-04-26 16:22:52,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:52,773 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078965953] [2025-04-26 16:22:52,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:52,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:52,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:22:52,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:22:52,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:52,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:52,778 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:52,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:22:52,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:22:52,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:52,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:52,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:53,141 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:53,141 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:53,141 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:53,141 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:53,141 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:53,141 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:53,141 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:53,141 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:53,142 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration31_Lasso [2025-04-26 16:22:53,142 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:53,142 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:53,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:53,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:53,145 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:53,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:53,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:53,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:53,756 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:53,756 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:53,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:53,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:53,757 INFO L229 MonitoredProcess]: Starting monitored process 141 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:22:53,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-04-26 16:22:53,759 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:22:53,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:53,769 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:53,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:53,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:53,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:53,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:53,771 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:53,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2025-04-26 16:22:53,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:53,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:53,778 INFO L229 MonitoredProcess]: Starting monitored process 142 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:22:53,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2025-04-26 16:22:53,781 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:22:53,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:53,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:53,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:53,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:53,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:53,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:53,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:53,791 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:53,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2025-04-26 16:22:53,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:53,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:53,799 INFO L229 MonitoredProcess]: Starting monitored process 143 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:22:53,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2025-04-26 16:22:53,800 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:22:53,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:53,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:53,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:53,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:53,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:53,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:53,813 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:53,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2025-04-26 16:22:53,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:53,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:53,820 INFO L229 MonitoredProcess]: Starting monitored process 144 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:22:53,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2025-04-26 16:22:53,822 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:22:53,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:53,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:53,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:53,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:53,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:53,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:53,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:53,833 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:53,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2025-04-26 16:22:53,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:53,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:53,839 INFO L229 MonitoredProcess]: Starting monitored process 145 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:22:53,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2025-04-26 16:22:53,841 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:22:53,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:53,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:53,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:53,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:53,852 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:53,852 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:53,854 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:53,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2025-04-26 16:22:53,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:53,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:53,861 INFO L229 MonitoredProcess]: Starting monitored process 146 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:22:53,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2025-04-26 16:22:53,863 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:22:53,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:53,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:53,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:53,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:53,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:53,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:53,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:53,874 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:53,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2025-04-26 16:22:53,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:53,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:53,881 INFO L229 MonitoredProcess]: Starting monitored process 147 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:22:53,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2025-04-26 16:22:53,883 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:22:53,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:53,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:53,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:53,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:53,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:53,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:53,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:53,894 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:53,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2025-04-26 16:22:53,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:53,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:53,901 INFO L229 MonitoredProcess]: Starting monitored process 148 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:22:53,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-04-26 16:22:53,902 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:22:53,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:53,912 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:53,912 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:53,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:53,924 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:22:53,924 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:53,955 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:53,993 INFO L436 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2025-04-26 16:22:53,993 INFO L437 ModelExtractionUtils]: 31 out of 46 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-04-26 16:22:53,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:53,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:53,995 INFO L229 MonitoredProcess]: Starting monitored process 149 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:22:53,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-04-26 16:22:53,996 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:54,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2025-04-26 16:22:54,012 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:22:54,013 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:54,013 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2025-04-26 16:22:54,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2025-04-26 16:22:54,020 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:54,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:54,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:54,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:54,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:54,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:54,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:54,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:54,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:54,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:54,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:54,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:54,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:22:54,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:54,212 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:22:54,213 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:22:54,213 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19190 states and 49365 transitions. cyclomatic complexity: 30566 Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:22:54,433 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19190 states and 49365 transitions. cyclomatic complexity: 30566. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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 55629 states and 134203 transitions. Complement of second has 9 states. [2025-04-26 16:22:54,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:22:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-04-26 16:22:54,434 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 78 transitions. Stem has 16 letters. Loop has 16 letters. [2025-04-26 16:22:54,434 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:54,434 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:54,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:54,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:54,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:54,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:54,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:54,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:54,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:54,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:54,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:54,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:54,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:54,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:22:54,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:54,634 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:22:54,635 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:22:54,635 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19190 states and 49365 transitions. cyclomatic complexity: 30566 Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:22:55,117 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19190 states and 49365 transitions. cyclomatic complexity: 30566. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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 61508 states and 145739 transitions. Complement of second has 17 states. [2025-04-26 16:22:55,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:22:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 107 transitions. [2025-04-26 16:22:55,118 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 107 transitions. Stem has 16 letters. Loop has 16 letters. [2025-04-26 16:22:55,118 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:55,118 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 107 transitions. Stem has 32 letters. Loop has 16 letters. [2025-04-26 16:22:55,118 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:55,118 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 107 transitions. Stem has 16 letters. Loop has 32 letters. [2025-04-26 16:22:55,118 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:55,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61508 states and 145739 transitions. [2025-04-26 16:22:55,496 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 3462 [2025-04-26 16:22:55,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61508 states to 53681 states and 124157 transitions. [2025-04-26 16:22:55,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12197 [2025-04-26 16:22:55,790 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16709 [2025-04-26 16:22:55,791 INFO L74 IsDeterministic]: Start isDeterministic. Operand 53681 states and 124157 transitions. [2025-04-26 16:22:55,791 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:55,791 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53681 states and 124157 transitions. [2025-04-26 16:22:55,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53681 states and 124157 transitions. [2025-04-26 16:22:56,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53681 to 38305. [2025-04-26 16:22:56,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38305 states, 38305 states have (on average 2.500326328155593) internal successors, (in total 95775), 38304 states have internal predecessors, (95775), 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:22:56,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38305 states to 38305 states and 95775 transitions. [2025-04-26 16:22:56,889 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38305 states and 95775 transitions. [2025-04-26 16:22:56,889 INFO L438 stractBuchiCegarLoop]: Abstraction has 38305 states and 95775 transitions. [2025-04-26 16:22:56,889 INFO L340 stractBuchiCegarLoop]: ======== Iteration 32 ============ [2025-04-26 16:22:56,889 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38305 states and 95775 transitions. [2025-04-26 16:22:57,228 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 3462 [2025-04-26 16:22:57,228 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:57,228 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:57,229 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:57,229 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:22:57,229 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:57,229 INFO L754 eck$LassoCheckResult]: Loop: "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" [2025-04-26 16:22:57,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,229 INFO L85 PathProgramCache]: Analyzing trace with hash 40244231, now seen corresponding path program 9 times [2025-04-26 16:22:57,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,230 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591746449] [2025-04-26 16:22:57,230 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:22:57,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,231 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-04-26 16:22:57,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:57,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:22:57,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,233 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:57,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:57,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:57,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:57,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,236 INFO L85 PathProgramCache]: Analyzing trace with hash 269229373, now seen corresponding path program 7 times [2025-04-26 16:22:57,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509363826] [2025-04-26 16:22:57,236 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:22:57,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:57,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:57,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,240 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:57,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:57,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:57,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:57,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1346017981, now seen corresponding path program 8 times [2025-04-26 16:22:57,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:57,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267752578] [2025-04-26 16:22:57,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:57,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:57,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-04-26 16:22:57,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:22:57,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:22:57,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,248 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:57,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:22:57,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:22:57,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:57,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:57,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:57,612 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:57,613 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:57,613 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:57,613 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:57,613 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:57,613 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:57,613 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:57,613 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:57,613 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration32_Lasso [2025-04-26 16:22:57,613 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:57,613 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:57,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,818 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:57,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:58,376 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:58,376 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:58,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,378 INFO L229 MonitoredProcess]: Starting monitored process 150 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:22:58,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-04-26 16:22:58,380 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:22:58,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,390 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:58,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:58,390 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:58,392 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2025-04-26 16:22:58,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,400 INFO L229 MonitoredProcess]: Starting monitored process 151 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:22:58,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2025-04-26 16:22:58,401 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:22:58,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:58,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:58,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:58,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:58,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:58,414 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:58,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2025-04-26 16:22:58,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,421 INFO L229 MonitoredProcess]: Starting monitored process 152 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:22:58,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2025-04-26 16:22:58,422 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:22:58,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:58,432 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:22:58,432 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:22:58,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:58,449 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:22:58,450 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:22:58,569 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:58,623 INFO L436 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2025-04-26 16:22:58,623 INFO L437 ModelExtractionUtils]: 39 out of 61 variables were initially zero. Simplification set additionally 19 variables to zero. [2025-04-26 16:22:58,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:58,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:58,625 INFO L229 MonitoredProcess]: Starting monitored process 153 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:22:58,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2025-04-26 16:22:58,626 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:58,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2025-04-26 16:22:58,642 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:22:58,642 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:58,642 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2025-04-26 16:22:58,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2025-04-26 16:22:58,651 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:58,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:58,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:58,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:58,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:58,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:58,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:58,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:58,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:58,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:58,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:58,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:22:58,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:58,802 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:22:58,802 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:22:58,802 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38305 states and 95775 transitions. cyclomatic complexity: 58069 Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (in total 31), 7 states have internal predecessors, (31), 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:22:59,199 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38305 states and 95775 transitions. cyclomatic complexity: 58069. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (in total 31), 7 states have internal predecessors, (31), 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 83135 states and 201294 transitions. Complement of second has 9 states. [2025-04-26 16:22:59,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:59,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (in total 31), 7 states have internal predecessors, (31), 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:22:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2025-04-26 16:22:59,200 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 75 transitions. Stem has 16 letters. Loop has 16 letters. [2025-04-26 16:22:59,201 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:59,201 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:22:59,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:59,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:59,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:59,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:59,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:59,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:59,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:59,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:22:59,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:22:59,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:59,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:59,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:22:59,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:59,343 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:22:59,343 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:22:59,343 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38305 states and 95775 transitions. cyclomatic complexity: 58069 Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (in total 31), 7 states have internal predecessors, (31), 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:22:59,995 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38305 states and 95775 transitions. cyclomatic complexity: 58069. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (in total 31), 7 states have internal predecessors, (31), 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 98098 states and 236811 transitions. Complement of second has 17 states. [2025-04-26 16:22:59,995 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:59,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (in total 31), 7 states have internal predecessors, (31), 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:22:59,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 103 transitions. [2025-04-26 16:22:59,996 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 103 transitions. Stem has 16 letters. Loop has 16 letters. [2025-04-26 16:22:59,996 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:59,996 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 103 transitions. Stem has 32 letters. Loop has 16 letters. [2025-04-26 16:22:59,996 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:59,996 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 103 transitions. Stem has 16 letters. Loop has 32 letters. [2025-04-26 16:22:59,996 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:59,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98098 states and 236811 transitions. [2025-04-26 16:23:00,546 INFO L131 ngComponentsAnalysis]: Automaton has 112 accepting balls. 4006 [2025-04-26 16:23:01,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98098 states to 80143 states and 192194 transitions. [2025-04-26 16:23:01,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15601 [2025-04-26 16:23:01,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16779 [2025-04-26 16:23:01,236 INFO L74 IsDeterministic]: Start isDeterministic. Operand 80143 states and 192194 transitions. [2025-04-26 16:23:01,236 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:01,236 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80143 states and 192194 transitions. [2025-04-26 16:23:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80143 states and 192194 transitions. [2025-04-26 16:23:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80143 to 53276. [2025-04-26 16:23:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53276 states, 53276 states have (on average 2.5309144830692993) internal successors, (in total 134837), 53275 states have internal predecessors, (134837), 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:02,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53276 states to 53276 states and 134837 transitions. [2025-04-26 16:23:02,585 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53276 states and 134837 transitions. [2025-04-26 16:23:02,585 INFO L438 stractBuchiCegarLoop]: Abstraction has 53276 states and 134837 transitions. [2025-04-26 16:23:02,585 INFO L340 stractBuchiCegarLoop]: ======== Iteration 33 ============ [2025-04-26 16:23:02,585 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53276 states and 134837 transitions. [2025-04-26 16:23:03,009 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 3718 [2025-04-26 16:23:03,009 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:03,009 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:03,009 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:03,009 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:03,010 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" [2025-04-26 16:23:03,010 INFO L754 eck$LassoCheckResult]: Loop: "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" [2025-04-26 16:23:03,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:03,011 INFO L85 PathProgramCache]: Analyzing trace with hash 54885003, now seen corresponding path program 1 times [2025-04-26 16:23:03,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:03,011 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048769890] [2025-04-26 16:23:03,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:03,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:03,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:03,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:03,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:03,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,015 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:03,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:03,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:03,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:03,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:03,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:03,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1386997039, now seen corresponding path program 8 times [2025-04-26 16:23:03,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:03,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836926674] [2025-04-26 16:23:03,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:03,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:03,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:03,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:03,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:03,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,021 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:03,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:03,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:03,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:03,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:03,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:03,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1689318471, now seen corresponding path program 9 times [2025-04-26 16:23:03,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:03,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320650971] [2025-04-26 16:23:03,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:03,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:03,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 2 equivalence classes. [2025-04-26 16:23:03,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:23:03,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:23:03,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,029 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:03,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:23:03,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:23:03,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:03,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:03,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:03,360 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:03,361 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:03,361 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:03,361 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:03,361 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:03,361 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:03,361 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:03,361 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:03,361 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration33_Lasso [2025-04-26 16:23:03,361 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:03,361 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:03,362 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,364 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,366 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:03,699 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:23:04,108 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:04,109 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:04,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,113 INFO L229 MonitoredProcess]: Starting monitored process 154 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:04,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2025-04-26 16:23:04,116 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:04,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:04,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:04,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:04,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:04,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:04,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:04,130 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:04,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2025-04-26 16:23:04,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,138 INFO L229 MonitoredProcess]: Starting monitored process 155 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:04,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2025-04-26 16:23:04,139 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:04,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:04,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:04,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:04,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:04,150 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:04,150 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:04,152 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:04,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2025-04-26 16:23:04,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,159 INFO L229 MonitoredProcess]: Starting monitored process 156 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:04,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2025-04-26 16:23:04,161 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:04,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:04,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:04,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:04,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:04,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:04,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:04,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:04,173 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:04,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2025-04-26 16:23:04,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,180 INFO L229 MonitoredProcess]: Starting monitored process 157 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:04,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2025-04-26 16:23:04,182 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:04,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:04,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:04,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:04,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:04,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:04,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:04,196 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:04,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2025-04-26 16:23:04,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,204 INFO L229 MonitoredProcess]: Starting monitored process 158 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:04,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2025-04-26 16:23:04,206 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:04,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:04,216 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:23:04,216 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:23:04,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:04,234 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:23:04,234 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:04,273 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:04,312 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:23:04,312 INFO L437 ModelExtractionUtils]: 39 out of 61 variables were initially zero. Simplification set additionally 19 variables to zero. [2025-04-26 16:23:04,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:04,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:04,314 INFO L229 MonitoredProcess]: Starting monitored process 159 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:04,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2025-04-26 16:23:04,316 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:04,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2025-04-26 16:23:04,332 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:23:04,332 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:04,332 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2025-04-26 16:23:04,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2025-04-26 16:23:04,340 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:04,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:04,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:04,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:04,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:04,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:04,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:04,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:04,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:04,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:04,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:23:04,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:04,573 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:04,575 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:23:04,575 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53276 states and 134837 transitions. cyclomatic complexity: 82572 Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:04,948 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53276 states and 134837 transitions. cyclomatic complexity: 82572. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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 63268 states and 158084 transitions. Complement of second has 9 states. [2025-04-26 16:23:04,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:04,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2025-04-26 16:23:04,949 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 70 transitions. Stem has 16 letters. Loop has 16 letters. [2025-04-26 16:23:04,949 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:04,949 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:04,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:04,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:04,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:04,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:04,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:04,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:04,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:04,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:04,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:04,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:04,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:23:04,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:05,156 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:05,157 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:23:05,157 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53276 states and 134837 transitions. cyclomatic complexity: 82572 Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:05,894 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53276 states and 134837 transitions. cyclomatic complexity: 82572. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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 78381 states and 195985 transitions. Complement of second has 17 states. [2025-04-26 16:23:05,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2025-04-26 16:23:05,895 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 104 transitions. Stem has 16 letters. Loop has 16 letters. [2025-04-26 16:23:05,895 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:05,896 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 104 transitions. Stem has 32 letters. Loop has 16 letters. [2025-04-26 16:23:05,896 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:05,896 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 9 states and 104 transitions. Stem has 16 letters. Loop has 32 letters. [2025-04-26 16:23:05,896 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:05,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78381 states and 195985 transitions. [2025-04-26 16:23:06,520 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 3718 [2025-04-26 16:23:07,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78381 states to 70508 states and 175812 transitions. [2025-04-26 16:23:07,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14402 [2025-04-26 16:23:07,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15547 [2025-04-26 16:23:07,203 INFO L74 IsDeterministic]: Start isDeterministic. Operand 70508 states and 175812 transitions. [2025-04-26 16:23:07,203 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:07,203 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70508 states and 175812 transitions. [2025-04-26 16:23:07,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70508 states and 175812 transitions. [2025-04-26 16:23:08,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70508 to 62347. [2025-04-26 16:23:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62347 states, 62347 states have (on average 2.5319261552279984) internal successors, (in total 157858), 62346 states have internal predecessors, (157858), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62347 states to 62347 states and 157858 transitions. [2025-04-26 16:23:08,550 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62347 states and 157858 transitions. [2025-04-26 16:23:08,550 INFO L438 stractBuchiCegarLoop]: Abstraction has 62347 states and 157858 transitions. [2025-04-26 16:23:08,550 INFO L340 stractBuchiCegarLoop]: ======== Iteration 34 ============ [2025-04-26 16:23:08,550 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62347 states and 157858 transitions. [2025-04-26 16:23:08,782 INFO L131 ngComponentsAnalysis]: Automaton has 76 accepting balls. 3718 [2025-04-26 16:23:08,782 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:08,782 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:08,783 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:08,783 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:08,783 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" [2025-04-26 16:23:08,784 INFO L754 eck$LassoCheckResult]: Loop: "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" [2025-04-26 16:23:08,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:08,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1837927334, now seen corresponding path program 2 times [2025-04-26 16:23:08,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:08,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108176414] [2025-04-26 16:23:08,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:08,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:08,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-26 16:23:08,788 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:08,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:08,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,788 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:08,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:08,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:08,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:08,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:08,792 INFO L85 PathProgramCache]: Analyzing trace with hash 299933925, now seen corresponding path program 9 times [2025-04-26 16:23:08,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:08,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061293285] [2025-04-26 16:23:08,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:08,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:08,794 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:08,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:08,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:08,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:08,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:08,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:08,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:08,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1643791166, now seen corresponding path program 10 times [2025-04-26 16:23:08,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:08,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611527330] [2025-04-26 16:23:08,799 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:08,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:08,802 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-26 16:23:08,805 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:23:08,805 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:08,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,805 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:08,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:23:08,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:23:08,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:08,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:08,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:09,304 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:09,304 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:09,304 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:09,304 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:09,304 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:09,304 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,304 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:09,304 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:09,304 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration34_Lasso [2025-04-26 16:23:09,304 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:09,304 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:09,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:09,676 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 16:23:09,996 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:09,996 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:09,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:09,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:09,998 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:09,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2025-04-26 16:23:09,999 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:10,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:10,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:10,017 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:10,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2025-04-26 16:23:10,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,024 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2025-04-26 16:23:10,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:10,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:10,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:10,039 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:10,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2025-04-26 16:23:10,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,047 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2025-04-26 16:23:10,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:10,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,061 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:10,061 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:10,064 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:10,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:10,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,072 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2025-04-26 16:23:10,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:10,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:10,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:10,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,085 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:10,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:10,086 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:10,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2025-04-26 16:23:10,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,093 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2025-04-26 16:23:10,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:10,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:10,105 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:23:10,105 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:23:10,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:10,121 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:23:10,122 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:10,160 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:10,197 INFO L436 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-04-26 16:23:10,197 INFO L437 ModelExtractionUtils]: 47 out of 61 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-04-26 16:23:10,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:10,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:10,199 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:10,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2025-04-26 16:23:10,200 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:10,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2025-04-26 16:23:10,216 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:23:10,216 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:10,216 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2025-04-26 16:23:10,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2025-04-26 16:23:10,224 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:10,230 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:10,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:10,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:10,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:10,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:10,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:10,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:10,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:10,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:10,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:10,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:23:10,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:10,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:10,540 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:23:10,540 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62347 states and 157858 transitions. cyclomatic complexity: 96735 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (in total 30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:11,583 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62347 states and 157858 transitions. cyclomatic complexity: 96735. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (in total 30), 8 states have internal predecessors, (30), 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 147583 states and 365565 transitions. Complement of second has 15 states. [2025-04-26 16:23:11,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:11,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (in total 30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 95 transitions. [2025-04-26 16:23:11,584 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 95 transitions. Stem has 17 letters. Loop has 16 letters. [2025-04-26 16:23:11,584 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:11,584 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:11,590 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:11,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:11,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:11,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:11,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:11,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:11,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:11,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:11,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:11,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:11,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:23:11,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:23:11,924 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:23:11,924 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62347 states and 157858 transitions. cyclomatic complexity: 96735 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (in total 30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:13,455 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62347 states and 157858 transitions. cyclomatic complexity: 96735. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (in total 30), 8 states have internal predecessors, (30), 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 219635 states and 543906 transitions. Complement of second has 31 states. [2025-04-26 16:23:13,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 1 stem states 14 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (in total 30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 171 transitions. [2025-04-26 16:23:13,456 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 16 states and 171 transitions. Stem has 17 letters. Loop has 16 letters. [2025-04-26 16:23:13,456 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:13,456 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:13,462 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:13,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:23:13,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:23:13,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:13,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:13,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:13,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:13,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:13,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:13,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:13,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:13,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:23:13,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:14,034 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:14,034 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 6 loop predicates [2025-04-26 16:23:14,034 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62347 states and 157858 transitions. cyclomatic complexity: 96735 Second operand has 8 states, 8 states have (on average 3.75) internal successors, (in total 30), 8 states have internal predecessors, (30), 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:15,097 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62347 states and 157858 transitions. cyclomatic complexity: 96735. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (in total 30), 8 states have internal predecessors, (30), 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 193643 states and 482074 transitions. Complement of second has 37 states. [2025-04-26 16:23:15,098 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.75) internal successors, (in total 30), 8 states have internal predecessors, (30), 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:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2025-04-26 16:23:15,098 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 102 transitions. Stem has 17 letters. Loop has 16 letters. [2025-04-26 16:23:15,098 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:15,099 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 102 transitions. Stem has 33 letters. Loop has 16 letters. [2025-04-26 16:23:15,099 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:15,099 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 102 transitions. Stem has 17 letters. Loop has 32 letters. [2025-04-26 16:23:15,099 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:15,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 193643 states and 482074 transitions. [2025-04-26 16:23:17,155 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 8650 [2025-04-26 16:23:18,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 193643 states to 144703 states and 348257 transitions. [2025-04-26 16:23:18,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17491 [2025-04-26 16:23:18,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28449 [2025-04-26 16:23:18,202 INFO L74 IsDeterministic]: Start isDeterministic. Operand 144703 states and 348257 transitions. [2025-04-26 16:23:18,203 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:18,203 INFO L218 hiAutomatonCegarLoop]: Abstraction has 144703 states and 348257 transitions. [2025-04-26 16:23:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144703 states and 348257 transitions. [2025-04-26 16:23:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144703 to 84051. [2025-04-26 16:23:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84051 states, 84051 states have (on average 2.601349180854481) internal successors, (in total 218646), 84050 states have internal predecessors, (218646), 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:20,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84051 states to 84051 states and 218646 transitions. [2025-04-26 16:23:20,674 INFO L240 hiAutomatonCegarLoop]: Abstraction has 84051 states and 218646 transitions. [2025-04-26 16:23:20,674 INFO L438 stractBuchiCegarLoop]: Abstraction has 84051 states and 218646 transitions. [2025-04-26 16:23:20,674 INFO L340 stractBuchiCegarLoop]: ======== Iteration 35 ============ [2025-04-26 16:23:20,675 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84051 states and 218646 transitions. [2025-04-26 16:23:21,201 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 5496 [2025-04-26 16:23:21,202 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:21,202 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:21,203 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:21,203 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:21,203 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[103] ULTIMATE.startFINAL-->ULTIMATE.startEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:23:21,203 INFO L754 eck$LassoCheckResult]: Loop: "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" [2025-04-26 16:23:21,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:21,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2106627407, now seen corresponding path program 1 times [2025-04-26 16:23:21,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:21,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418938145] [2025-04-26 16:23:21,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:21,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:21,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:21,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:21,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:21,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:21,206 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:21,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:21,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:21,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:21,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:21,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:21,208 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:21,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1306328999, now seen corresponding path program 10 times [2025-04-26 16:23:21,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:21,208 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291767919] [2025-04-26 16:23:21,208 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:23:21,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:21,210 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-04-26 16:23:21,214 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:21,215 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:23:21,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:21,215 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:21,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:21,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:21,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:21,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:21,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:21,217 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:21,217 INFO L85 PathProgramCache]: Analyzing trace with hash -2119485017, now seen corresponding path program 2 times [2025-04-26 16:23:21,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:21,218 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443682044] [2025-04-26 16:23:21,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:23:21,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:21,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:23:21,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:23:21,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:21,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:21,222 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:21,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:23:21,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:23:21,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:21,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:21,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:21,505 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:21,505 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:21,505 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:21,505 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:21,505 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:21,505 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:21,505 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:21,505 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:21,505 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration35_Lasso [2025-04-26 16:23:21,505 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:21,505 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:21,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:21,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:21,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:21,815 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:21,816 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:22,394 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:22,394 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:22,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:22,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:22,396 INFO L229 MonitoredProcess]: Starting monitored process 166 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:22,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2025-04-26 16:23:22,398 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:22,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:22,408 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:23:22,408 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:23:22,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:22,425 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:23:22,425 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:22,462 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:22,488 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:23:22,488 INFO L437 ModelExtractionUtils]: 52 out of 61 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:23:22,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:22,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:22,491 INFO L229 MonitoredProcess]: Starting monitored process 167 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:22,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2025-04-26 16:23:22,492 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:22,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Ended with exit code 0 [2025-04-26 16:23:22,508 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:23:22,508 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:22,508 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2025-04-26 16:23:22,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2025-04-26 16:23:22,515 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:22,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:22,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:22,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:22,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:22,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:22,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:22,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:22,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:22,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:22,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:22,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:22,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:23:22,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:22,792 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:22,792 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:23:22,792 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84051 states and 218646 transitions. cyclomatic complexity: 136011 Second operand has 8 states, 8 states have (on average 3.25) internal successors, (in total 26), 8 states have internal predecessors, (26), 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:23,875 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84051 states and 218646 transitions. cyclomatic complexity: 136011. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (in total 26), 8 states have internal predecessors, (26), 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 191314 states and 479659 transitions. Complement of second has 15 states. [2025-04-26 16:23:23,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (in total 26), 8 states have internal predecessors, (26), 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:23,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 87 transitions. [2025-04-26 16:23:23,876 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 87 transitions. Stem has 10 letters. Loop has 16 letters. [2025-04-26 16:23:23,876 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:23,876 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 87 transitions. Stem has 26 letters. Loop has 16 letters. [2025-04-26 16:23:23,876 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:23,877 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 87 transitions. Stem has 10 letters. Loop has 32 letters. [2025-04-26 16:23:23,877 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:23,877 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191314 states and 479659 transitions. [2025-04-26 16:23:25,926 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 5496 [2025-04-26 16:23:26,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191314 states to 149228 states and 366844 transitions. [2025-04-26 16:23:26,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20024 [2025-04-26 16:23:26,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23617 [2025-04-26 16:23:26,944 INFO L74 IsDeterministic]: Start isDeterministic. Operand 149228 states and 366844 transitions. [2025-04-26 16:23:26,944 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:26,944 INFO L218 hiAutomatonCegarLoop]: Abstraction has 149228 states and 366844 transitions. [2025-04-26 16:23:27,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149228 states and 366844 transitions. [2025-04-26 16:23:29,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149228 to 95361. [2025-04-26 16:23:29,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95361 states, 95361 states have (on average 2.776176843783098) internal successors, (in total 264739), 95360 states have internal predecessors, (264739), 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:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95361 states to 95361 states and 264739 transitions. [2025-04-26 16:23:29,458 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95361 states and 264739 transitions. [2025-04-26 16:23:29,458 INFO L438 stractBuchiCegarLoop]: Abstraction has 95361 states and 264739 transitions. [2025-04-26 16:23:29,458 INFO L340 stractBuchiCegarLoop]: ======== Iteration 36 ============ [2025-04-26 16:23:29,458 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95361 states and 264739 transitions. [2025-04-26 16:23:30,239 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 5496 [2025-04-26 16:23:30,239 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:30,239 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:30,241 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:30,241 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:30,241 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:23:30,241 INFO L754 eck$LassoCheckResult]: Loop: "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:23:30,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:30,242 INFO L85 PathProgramCache]: Analyzing trace with hash 2106627410, now seen corresponding path program 1 times [2025-04-26 16:23:30,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:30,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66920792] [2025-04-26 16:23:30,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:30,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:30,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:30,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:30,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:30,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:30,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:30,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:30,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:30,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1495800057, now seen corresponding path program 11 times [2025-04-26 16:23:30,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:30,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923811983] [2025-04-26 16:23:30,248 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:23:30,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:30,250 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:30,252 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:30,252 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:23:30,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,252 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:30,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:30,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:30,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:30,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:30,256 INFO L85 PathProgramCache]: Analyzing trace with hash 447605834, now seen corresponding path program 11 times [2025-04-26 16:23:30,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:30,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733047399] [2025-04-26 16:23:30,256 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:23:30,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:30,261 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:23:30,264 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:23:30,264 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:23:30,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:30,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:23:30,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:23:30,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:30,693 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:30,694 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:30,694 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:30,694 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:30,694 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:30,694 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,694 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:30,694 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:30,694 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration36_Lasso [2025-04-26 16:23:30,694 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:30,694 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:30,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,701 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,273 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:31,273 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:31,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:31,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:31,276 INFO L229 MonitoredProcess]: Starting monitored process 168 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:31,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2025-04-26 16:23:31,278 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:31,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:31,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:31,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:31,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:31,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:31,289 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:31,294 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:31,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:31,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:31,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:31,302 INFO L229 MonitoredProcess]: Starting monitored process 169 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:31,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2025-04-26 16:23:31,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:23:31,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:31,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:31,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:31,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:31,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:31,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:31,318 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:31,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:31,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:31,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:31,325 INFO L229 MonitoredProcess]: Starting monitored process 170 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:31,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2025-04-26 16:23:31,328 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:31,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:31,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:31,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:31,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:31,339 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:31,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:31,342 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:31,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:31,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:31,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:31,457 INFO L229 MonitoredProcess]: Starting monitored process 171 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:31,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2025-04-26 16:23:31,460 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:31,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:31,470 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:31,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:31,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:31,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:31,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:31,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:31,475 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:31,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:31,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:31,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:31,483 INFO L229 MonitoredProcess]: Starting monitored process 172 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:31,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2025-04-26 16:23:31,485 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:31,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:31,496 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:23:31,496 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:23:31,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:31,512 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:23:31,512 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:23:31,559 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:31,586 INFO L436 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-04-26 16:23:31,586 INFO L437 ModelExtractionUtils]: 37 out of 51 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-04-26 16:23:31,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:31,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:31,605 INFO L229 MonitoredProcess]: Starting monitored process 173 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:31,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2025-04-26 16:23:31,607 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:31,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2025-04-26 16:23:31,623 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:23:31,623 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:31,623 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2025-04-26 16:23:31,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:31,630 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:31,637 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:31,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:31,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:31,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:31,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:31,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:31,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:31,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:31,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:31,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:23:31,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:31,889 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:31,889 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:23:31,889 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 95361 states and 264739 transitions. cyclomatic complexity: 170813 Second operand has 8 states, 8 states have (on average 3.25) internal successors, (in total 26), 8 states have internal predecessors, (26), 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:32,711 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 95361 states and 264739 transitions. cyclomatic complexity: 170813. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (in total 26), 8 states have internal predecessors, (26), 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 145242 states and 384587 transitions. Complement of second has 15 states. [2025-04-26 16:23:32,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (in total 26), 8 states have internal predecessors, (26), 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:32,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 81 transitions. [2025-04-26 16:23:32,712 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 81 transitions. Stem has 10 letters. Loop has 16 letters. [2025-04-26 16:23:32,712 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:32,712 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 81 transitions. Stem has 26 letters. Loop has 16 letters. [2025-04-26 16:23:32,712 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:32,712 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 81 transitions. Stem has 10 letters. Loop has 32 letters. [2025-04-26 16:23:32,713 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:32,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145242 states and 384587 transitions. [2025-04-26 16:23:34,028 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 5496 [2025-04-26 16:23:35,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145242 states to 120627 states and 325093 transitions. [2025-04-26 16:23:35,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17978 [2025-04-26 16:23:35,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18518 [2025-04-26 16:23:35,217 INFO L74 IsDeterministic]: Start isDeterministic. Operand 120627 states and 325093 transitions. [2025-04-26 16:23:35,217 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:35,217 INFO L218 hiAutomatonCegarLoop]: Abstraction has 120627 states and 325093 transitions. [2025-04-26 16:23:35,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120627 states and 325093 transitions. [2025-04-26 16:23:36,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120627 to 97250. [2025-04-26 16:23:37,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97250 states, 97250 states have (on average 2.7795886889460153) internal successors, (in total 270315), 97249 states have internal predecessors, (270315), 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:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97250 states to 97250 states and 270315 transitions. [2025-04-26 16:23:37,663 INFO L240 hiAutomatonCegarLoop]: Abstraction has 97250 states and 270315 transitions. [2025-04-26 16:23:37,663 INFO L438 stractBuchiCegarLoop]: Abstraction has 97250 states and 270315 transitions. [2025-04-26 16:23:37,663 INFO L340 stractBuchiCegarLoop]: ======== Iteration 37 ============ [2025-04-26 16:23:37,663 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97250 states and 270315 transitions. [2025-04-26 16:23:38,303 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 5496 [2025-04-26 16:23:38,303 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:38,303 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:38,305 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:38,305 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:38,305 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:23:38,306 INFO L754 eck$LassoCheckResult]: Loop: "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:23:38,306 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1310005900, now seen corresponding path program 3 times [2025-04-26 16:23:38,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,306 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822598820] [2025-04-26 16:23:38,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:23:38,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:38,314 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:38,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:23:38,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,315 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:38,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:38,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:38,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:38,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1951740449, now seen corresponding path program 12 times [2025-04-26 16:23:38,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,324 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499286686] [2025-04-26 16:23:38,324 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:23:38,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,328 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-04-26 16:23:38,330 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:38,330 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-26 16:23:38,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,330 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:38,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:38,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:38,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:38,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:38,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1109709204, now seen corresponding path program 12 times [2025-04-26 16:23:38,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:38,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344571489] [2025-04-26 16:23:38,343 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:23:38,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:38,349 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 3 equivalence classes. [2025-04-26 16:23:38,361 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:23:38,361 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-26 16:23:38,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,361 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:38,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:23:38,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:23:38,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:38,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:38,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:39,245 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:39,246 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:39,246 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:39,246 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:39,246 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:39,246 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:39,246 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:39,246 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:39,246 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration37_Lasso [2025-04-26 16:23:39,246 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:39,246 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:39,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:39,264 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:40,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:40,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:40,622 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-04-26 16:23:40,623 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-04-26 16:23:41,053 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:41,054 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:41,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:41,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:41,056 INFO L229 MonitoredProcess]: Starting monitored process 174 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:41,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2025-04-26 16:23:41,058 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:41,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:41,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:41,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:41,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:41,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:41,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:41,070 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:41,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2025-04-26 16:23:41,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:41,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:41,078 INFO L229 MonitoredProcess]: Starting monitored process 175 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:41,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2025-04-26 16:23:41,080 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:41,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:41,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:41,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:41,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:41,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:41,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:41,093 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:41,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2025-04-26 16:23:41,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:41,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:41,101 INFO L229 MonitoredProcess]: Starting monitored process 176 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:41,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2025-04-26 16:23:41,102 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:41,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:41,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:41,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:41,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:41,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:41,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:41,114 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:41,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2025-04-26 16:23:41,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:41,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:41,122 INFO L229 MonitoredProcess]: Starting monitored process 177 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:41,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2025-04-26 16:23:41,125 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:41,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:41,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:41,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:41,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:41,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:41,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:41,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:41,136 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:41,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2025-04-26 16:23:41,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:41,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:41,143 INFO L229 MonitoredProcess]: Starting monitored process 178 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:41,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2025-04-26 16:23:41,145 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:41,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:41,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:41,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:41,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:41,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:41,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:41,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:41,155 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:41,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:41,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:41,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:41,164 INFO L229 MonitoredProcess]: Starting monitored process 179 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:41,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2025-04-26 16:23:41,166 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:41,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:41,176 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:23:41,176 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:23:41,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:41,208 INFO L402 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2025-04-26 16:23:41,208 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:23:41,295 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:41,414 INFO L436 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2025-04-26 16:23:41,414 INFO L437 ModelExtractionUtils]: 55 out of 78 variables were initially zero. Simplification set additionally 17 variables to zero. [2025-04-26 16:23:41,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:41,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:41,416 INFO L229 MonitoredProcess]: Starting monitored process 180 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:41,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2025-04-26 16:23:41,417 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:41,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2025-04-26 16:23:41,434 INFO L439 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2025-04-26 16:23:41,434 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:41,434 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerThread1of1ForFork0_sz#1, cnt) = 3*N + 2*workerThread1of1ForFork0_sz#1 - 2*cnt Supporting invariants [-2*cnt + 3*N >= 0] [2025-04-26 16:23:41,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:41,445 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:23:41,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:41,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:41,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:41,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:41,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:41,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-26 16:23:41,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:41,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:41,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:41,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:41,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:41,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-26 16:23:41,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:41,815 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:41,815 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 7 loop predicates [2025-04-26 16:23:41,815 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97250 states and 270315 transitions. cyclomatic complexity: 174505 Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (in total 27), 13 states have internal predecessors, (27), 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:42,646 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97250 states and 270315 transitions. cyclomatic complexity: 174505. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (in total 27), 13 states have internal predecessors, (27), 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 114095 states and 313879 transitions. Complement of second has 19 states. [2025-04-26 16:23:42,646 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 6 stem states 5 non-accepting loop states 2 accepting loop states [2025-04-26 16:23:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (in total 27), 13 states have internal predecessors, (27), 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:42,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2025-04-26 16:23:42,647 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 11 letters. Loop has 16 letters. [2025-04-26 16:23:42,647 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:42,647 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:23:42,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:42,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:42,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:42,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:42,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:42,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:23:42,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:42,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:42,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:42,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:42,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:42,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-26 16:23:42,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:42,985 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:42,985 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 6 loop predicates [2025-04-26 16:23:42,986 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 97250 states and 270315 transitions. cyclomatic complexity: 174505 Second operand has 12 states, 12 states have (on average 2.25) internal successors, (in total 27), 11 states have internal predecessors, (27), 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:44,263 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 97250 states and 270315 transitions. cyclomatic complexity: 174505. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (in total 27), 11 states have internal predecessors, (27), 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 170994 states and 458636 transitions. Complement of second has 28 states. [2025-04-26 16:23:44,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 5 stem states 10 non-accepting loop states 2 accepting loop states [2025-04-26 16:23:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (in total 27), 11 states have internal predecessors, (27), 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:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 139 transitions. [2025-04-26 16:23:44,264 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 17 states and 139 transitions. Stem has 11 letters. Loop has 16 letters. [2025-04-26 16:23:44,264 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:44,264 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 17 states and 139 transitions. Stem has 27 letters. Loop has 16 letters. [2025-04-26 16:23:44,264 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:44,264 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 17 states and 139 transitions. Stem has 11 letters. Loop has 32 letters. [2025-04-26 16:23:44,264 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:44,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170994 states and 458636 transitions. [2025-04-26 16:23:45,974 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 5496 [2025-04-26 16:23:46,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170994 states to 142623 states and 383984 transitions. [2025-04-26 16:23:46,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18871 [2025-04-26 16:23:46,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19143 [2025-04-26 16:23:46,892 INFO L74 IsDeterministic]: Start isDeterministic. Operand 142623 states and 383984 transitions. [2025-04-26 16:23:46,892 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:46,892 INFO L218 hiAutomatonCegarLoop]: Abstraction has 142623 states and 383984 transitions. [2025-04-26 16:23:47,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142623 states and 383984 transitions. [2025-04-26 16:23:49,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142623 to 115232. [2025-04-26 16:23:49,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115232 states, 115232 states have (on average 2.754425853929464) internal successors, (in total 317398), 115231 states have internal predecessors, (317398), 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:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115232 states to 115232 states and 317398 transitions. [2025-04-26 16:23:50,160 INFO L240 hiAutomatonCegarLoop]: Abstraction has 115232 states and 317398 transitions. [2025-04-26 16:23:50,160 INFO L438 stractBuchiCegarLoop]: Abstraction has 115232 states and 317398 transitions. [2025-04-26 16:23:50,160 INFO L340 stractBuchiCegarLoop]: ======== Iteration 38 ============ [2025-04-26 16:23:50,160 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 115232 states and 317398 transitions. [2025-04-26 16:23:50,827 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 5496 [2025-04-26 16:23:50,828 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:50,828 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:50,828 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:50,828 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:50,829 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" [2025-04-26 16:23:50,829 INFO L754 eck$LassoCheckResult]: Loop: "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" [2025-04-26 16:23:50,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:50,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1499686904, now seen corresponding path program 1 times [2025-04-26 16:23:50,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:50,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665856509] [2025-04-26 16:23:50,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:50,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:50,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:50,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:50,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,832 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:50,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:50,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:50,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:50,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:50,835 INFO L85 PathProgramCache]: Analyzing trace with hash 624095297, now seen corresponding path program 13 times [2025-04-26 16:23:50,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:50,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640320104] [2025-04-26 16:23:50,835 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:23:50,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:50,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:50,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:50,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,838 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:50,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:50,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:50,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:50,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:50,840 INFO L85 PathProgramCache]: Analyzing trace with hash 608475720, now seen corresponding path program 13 times [2025-04-26 16:23:50,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:50,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257328583] [2025-04-26 16:23:50,840 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:23:50,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:50,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:23:50,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:23:50,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,844 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:50,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:23:50,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:23:50,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:50,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:50,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:51,344 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:51,345 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:51,345 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:51,345 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:51,345 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:51,345 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:51,345 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:51,345 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:51,345 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration38_Lasso [2025-04-26 16:23:51,345 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:51,345 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:51,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:51,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:51,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:51,931 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:51,933 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:51,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:52,180 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-04-26 16:23:52,182 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-04-26 16:23:52,640 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:52,640 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:52,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:52,642 INFO L229 MonitoredProcess]: Starting monitored process 181 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,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2025-04-26 16:23:52,644 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,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:52,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:52,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:52,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:52,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:52,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:52,656 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:52,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2025-04-26 16:23:52,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:52,663 INFO L229 MonitoredProcess]: Starting monitored process 182 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,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2025-04-26 16:23:52,665 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,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:52,675 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:23:52,675 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:23:52,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:52,738 INFO L402 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2025-04-26 16:23:52,738 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:23:52,829 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:52,963 INFO L436 ModelExtractionUtils]: Simplification made 33 calls to the SMT solver. [2025-04-26 16:23:52,963 INFO L437 ModelExtractionUtils]: 49 out of 78 variables were initially zero. Simplification set additionally 23 variables to zero. [2025-04-26 16:23:52,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:52,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:52,965 INFO L229 MonitoredProcess]: Starting monitored process 183 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,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2025-04-26 16:23:52,966 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:52,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2025-04-26 16:23:52,984 INFO L439 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2025-04-26 16:23:52,984 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:52,984 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerThread1of1ForFork0_sz#1, cnt) = 2*N + 2*workerThread1of1ForFork0_sz#1 - 1*cnt Supporting invariants [2*N - 1*cnt >= 0] [2025-04-26 16:23:52,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2025-04-26 16:23:52,997 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:23:53,011 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:53,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:53,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:53,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:53,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:23:53,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:53,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:23:53,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:23:53,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:53,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:53,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-26 16:23:53,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:53,479 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,479 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 8 loop predicates [2025-04-26 16:23:53,479 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 115232 states and 317398 transitions. cyclomatic complexity: 203892 Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (in total 28), 14 states have internal predecessors, (28), 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:54,934 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 115232 states and 317398 transitions. cyclomatic complexity: 203892. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (in total 28), 14 states have internal predecessors, (28), 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 162111 states and 434019 transitions. Complement of second has 25 states. [2025-04-26 16:23:54,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 6 stem states 8 non-accepting loop states 2 accepting loop states [2025-04-26 16:23:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (in total 28), 14 states have internal predecessors, (28), 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:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 123 transitions. [2025-04-26 16:23:54,935 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 16 states and 123 transitions. Stem has 12 letters. Loop has 16 letters. [2025-04-26 16:23:54,935 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:54,935 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 16 states and 123 transitions. Stem has 28 letters. Loop has 16 letters. [2025-04-26 16:23:54,935 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:54,935 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 16 states and 123 transitions. Stem has 12 letters. Loop has 32 letters. [2025-04-26 16:23:54,936 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:54,936 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162111 states and 434019 transitions. [2025-04-26 16:23:56,587 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 5576 [2025-04-26 16:23:57,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162111 states to 153015 states and 409835 transitions. [2025-04-26 16:23:57,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20878 [2025-04-26 16:23:57,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22473 [2025-04-26 16:23:57,579 INFO L74 IsDeterministic]: Start isDeterministic. Operand 153015 states and 409835 transitions. [2025-04-26 16:23:57,580 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:57,580 INFO L218 hiAutomatonCegarLoop]: Abstraction has 153015 states and 409835 transitions. [2025-04-26 16:23:57,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153015 states and 409835 transitions. [2025-04-26 16:24:00,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153015 to 127610. [2025-04-26 16:24:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127610 states, 127610 states have (on average 2.75000391818823) internal successors, (in total 350928), 127609 states have internal predecessors, (350928), 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:24:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127610 states to 127610 states and 350928 transitions. [2025-04-26 16:24:00,962 INFO L240 hiAutomatonCegarLoop]: Abstraction has 127610 states and 350928 transitions. [2025-04-26 16:24:00,962 INFO L438 stractBuchiCegarLoop]: Abstraction has 127610 states and 350928 transitions. [2025-04-26 16:24:00,962 INFO L340 stractBuchiCegarLoop]: ======== Iteration 39 ============ [2025-04-26 16:24:00,962 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127610 states and 350928 transitions. [2025-04-26 16:24:01,698 INFO L131 ngComponentsAnalysis]: Automaton has 35 accepting balls. 5536 [2025-04-26 16:24:01,698 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:01,698 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:01,699 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:24:01,699 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:24:01,700 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[103] ULTIMATE.startFINAL-->ULTIMATE.startEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" [2025-04-26 16:24:01,700 INFO L754 eck$LassoCheckResult]: Loop: "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" [2025-04-26 16:24:01,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:01,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1448315327, now seen corresponding path program 1 times [2025-04-26 16:24:01,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:01,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873478019] [2025-04-26 16:24:01,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:01,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:01,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:24:01,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:24:01,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:01,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:01,703 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:01,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:24:01,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:24:01,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:01,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:01,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:01,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:01,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1453807041, now seen corresponding path program 14 times [2025-04-26 16:24:01,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:01,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639718023] [2025-04-26 16:24:01,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:24:01,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:01,707 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:24:01,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:24:01,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:24:01,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:01,709 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:01,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:24:01,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:24:01,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:01,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:01,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:01,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:01,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1625338879, now seen corresponding path program 3 times [2025-04-26 16:24:01,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:01,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009153691] [2025-04-26 16:24:01,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:24:01,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:01,713 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-04-26 16:24:01,716 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:24:01,716 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:24:01,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:01,716 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:01,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:24:01,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:24:01,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:01,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:01,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:02,212 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:02,212 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:02,212 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:02,212 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:02,212 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:02,212 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:02,212 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:02,212 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:02,212 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration39_Lasso [2025-04-26 16:24:02,212 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:02,212 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:02,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:02,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:02,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:02,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:02,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:02,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:03,098 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2025-04-26 16:24:03,099 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-04-26 16:24:03,582 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:03,582 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:03,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:03,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:03,589 INFO L229 MonitoredProcess]: Starting monitored process 184 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:24:03,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2025-04-26 16:24:03,591 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:24:03,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:03,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:03,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:03,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:03,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:03,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:03,604 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:03,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2025-04-26 16:24:03,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:03,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:03,612 INFO L229 MonitoredProcess]: Starting monitored process 185 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:24:03,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2025-04-26 16:24:03,614 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:24:03,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:03,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:03,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:03,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:03,626 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:03,626 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:03,629 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:03,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:03,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:03,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:03,637 INFO L229 MonitoredProcess]: Starting monitored process 186 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:24:03,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2025-04-26 16:24:03,640 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:24:03,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:03,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:03,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:03,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:03,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:03,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:03,654 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:03,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:03,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:03,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:03,662 INFO L229 MonitoredProcess]: Starting monitored process 187 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:24:03,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2025-04-26 16:24:03,664 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:24:03,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:03,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:03,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:03,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:03,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:03,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:03,677 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:03,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:03,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:03,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:03,685 INFO L229 MonitoredProcess]: Starting monitored process 188 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:24:03,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2025-04-26 16:24:03,688 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:24:03,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:03,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:03,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:03,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:03,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:03,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:03,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:03,702 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:03,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:03,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:03,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:03,710 INFO L229 MonitoredProcess]: Starting monitored process 189 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:24:03,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2025-04-26 16:24:03,713 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:24:03,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:03,723 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2025-04-26 16:24:03,723 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 16:24:03,723 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:03,763 INFO L402 nArgumentSynthesizer]: We have 42 Motzkin's Theorem applications. [2025-04-26 16:24:03,763 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 16:24:03,875 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:03,956 INFO L436 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2025-04-26 16:24:03,956 INFO L437 ModelExtractionUtils]: 57 out of 78 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-04-26 16:24:03,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:03,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:03,958 INFO L229 MonitoredProcess]: Starting monitored process 190 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:24:03,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2025-04-26 16:24:03,959 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:03,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2025-04-26 16:24:03,978 INFO L439 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2025-04-26 16:24:03,978 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:03,978 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerThread1of1ForFork0_sz#1, cnt) = 2*N + 2*workerThread1of1ForFork0_sz#1 - 1*cnt Supporting invariants [2*N - 1*cnt >= 0] [2025-04-26 16:24:03,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Forceful destruction successful, exit code 0 [2025-04-26 16:24:03,990 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:24:04,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:04,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:24:04,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:24:04,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:04,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:04,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:24:04,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:04,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:24:04,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:24:04,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:04,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:04,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 16:24:04,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:04,494 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:24:04,494 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 8 loop predicates [2025-04-26 16:24:04,494 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 127610 states and 350928 transitions. cyclomatic complexity: 225195 Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (in total 29), 14 states have internal predecessors, (29), 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:24:07,579 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 127610 states and 350928 transitions. cyclomatic complexity: 225195. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (in total 29), 14 states have internal predecessors, (29), 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 359071 states and 973827 transitions. Complement of second has 41 states. [2025-04-26 16:24:07,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 24 states 6 stem states 16 non-accepting loop states 2 accepting loop states [2025-04-26 16:24:07,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (in total 29), 14 states have internal predecessors, (29), 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:24:07,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 201 transitions. [2025-04-26 16:24:07,580 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 24 states and 201 transitions. Stem has 13 letters. Loop has 16 letters. [2025-04-26 16:24:07,580 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:07,580 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 24 states and 201 transitions. Stem has 29 letters. Loop has 16 letters. [2025-04-26 16:24:07,580 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:07,580 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 24 states and 201 transitions. Stem has 13 letters. Loop has 32 letters. [2025-04-26 16:24:07,580 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:07,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 359071 states and 973827 transitions. [2025-04-26 16:24:11,140 INFO L131 ngComponentsAnalysis]: Automaton has 104 accepting balls. 9318 [2025-04-26 16:24:13,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 359071 states to 321903 states and 850673 transitions. [2025-04-26 16:24:13,683 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36803 [2025-04-26 16:24:13,784 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41144 [2025-04-26 16:24:13,784 INFO L74 IsDeterministic]: Start isDeterministic. Operand 321903 states and 850673 transitions. [2025-04-26 16:24:13,784 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:13,784 INFO L218 hiAutomatonCegarLoop]: Abstraction has 321903 states and 850673 transitions. [2025-04-26 16:24:14,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321903 states and 850673 transitions. [2025-04-26 16:24:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321903 to 209256. [2025-04-26 16:24:19,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209256 states, 209256 states have (on average 2.7544060863248845) internal successors, (in total 576376), 209255 states have internal predecessors, (576376), 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:24:20,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209256 states to 209256 states and 576376 transitions. [2025-04-26 16:24:20,403 INFO L240 hiAutomatonCegarLoop]: Abstraction has 209256 states and 576376 transitions. [2025-04-26 16:24:20,403 INFO L438 stractBuchiCegarLoop]: Abstraction has 209256 states and 576376 transitions. [2025-04-26 16:24:20,403 INFO L340 stractBuchiCegarLoop]: ======== Iteration 40 ============ [2025-04-26 16:24:20,403 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 209256 states and 576376 transitions. [2025-04-26 16:24:21,768 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 8994 [2025-04-26 16:24:21,768 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:24:21,768 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:24:21,769 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:24:21,769 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:24:21,770 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[]" "[89] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[]" "[132] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_8|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_10|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_8|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_8|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_10|, workerWithAssertThread1of1ForFork1_thidvar0=v_workerWithAssertThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1, workerWithAssertThread1of1ForFork1_steal_delta#1, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1, workerWithAssertThread1of1ForFork1_thidvar0]" "[129] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork0_thidvar0_2) (= 2 v_workerThread1of1ForFork0_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork0_thidvar0=v_workerThread1of1ForFork0_thidvar0_2, workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_8|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_10|, workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_8|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_8|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_8|, workerThread1of1ForFork0_thidvar1=v_workerThread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[workerThread1of1ForFork0_thidvar0, workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_delta#1, workerThread1of1ForFork0_steal_num#1, workerThread1of1ForFork0_i#1, workerThread1of1ForFork0_thidvar1]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:24:21,770 INFO L754 eck$LassoCheckResult]: Loop: "[125] L58-->L59: Formula: (and (<= 0 |v_workerThread1of1ForFork0_i#1_3|) (< |v_workerThread1of1ForFork0_i#1_3| v_N_10)) InVars {workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[]" "[126] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork0_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork0_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[A]" "[116] L53-->L54: Formula: (= |v_workerThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[109] L67-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork1_sz#1_1| |v_workerWithAssertThread1of1ForFork1_steal_num#1_5|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_7| |v_workerWithAssertThread1of1ForFork1_i#1_1|)) InVars {workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_1|, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_1|, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_5|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_sz#1, workerWithAssertThread1of1ForFork1_i#1]" "[118] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[110] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[120] L67-->L67-1: Formula: (or (and (= (+ v_cnt_51 |v_workerThread1of1ForFork0_steal_num#1_3|) v_cnt_50) (= (ite (< (+ |v_workerThread1of1ForFork0_steal_delta#1_3| v_cnt_51) v_N_33) |v_workerThread1of1ForFork0_steal_delta#1_3| (+ v_N_33 (* (- 1) v_cnt_51))) |v_workerThread1of1ForFork0_steal_num#1_3|) (= |v_workerThread1of1ForFork0_steal_x#1_4| v_cnt_51) (< v_cnt_51 v_N_33)) (and (= |v_workerThread1of1ForFork0_steal_num#1_3| 0) (<= v_N_33 v_cnt_51) (= v_cnt_51 v_cnt_50) (= |v_workerThread1of1ForFork0_steal_x#1_4| |v_workerThread1of1ForFork0_steal_x#1_3|))) InVars {workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, cnt=v_cnt_51, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_3|} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_3|, N=v_N_33, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_3|, cnt=v_cnt_50, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork0_steal_x#1, workerThread1of1ForFork0_steal_num#1]" "[112] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork1_sz#1_5|) InVars {workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork1_sz#1=|v_workerWithAssertThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[]" "[121] L67-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork0_sz#1_1| |v_workerThread1of1ForFork0_steal_num#1_5|) (= |v_workerThread1of1ForFork0_steal_x#1_7| |v_workerThread1of1ForFork0_i#1_1|)) InVars {workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_1|, workerThread1of1ForFork0_steal_num#1=|v_workerThread1of1ForFork0_steal_num#1_5|, workerThread1of1ForFork0_i#1=|v_workerThread1of1ForFork0_i#1_1|, workerThread1of1ForFork0_steal_x#1=|v_workerThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork0_sz#1, workerThread1of1ForFork0_i#1]" "[122] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork0_steal_delta#1=|v_workerThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork0_steal_delta#1]" "[114] L43-->L44: Formula: (and (< |v_workerWithAssertThread1of1ForFork1_i#1_5| v_N_5) (<= 0 |v_workerWithAssertThread1of1ForFork1_i#1_5|)) InVars {workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[]" "[115] L44-->L38: Formula: (= (store v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork1_i#1_7|) 1)) v_A_1) InVars {A=v_A_2, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork1_i#1=|v_workerWithAssertThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[A]" "[124] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork0_sz#1_5|) InVars {workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} OutVars{workerThread1of1ForFork0_sz#1=|v_workerThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[]" "[104] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_delta#1]" "[106] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_1|, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" "[108] L67-->L67-1: Formula: (or (and (<= v_N_29 v_cnt_43) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| |v_workerWithAssertThread1of1ForFork1_steal_x#1_3|) (= 0 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= v_cnt_43 v_cnt_42)) (and (< v_cnt_43 v_N_29) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| v_cnt_43) v_N_29) |v_workerWithAssertThread1of1ForFork1_steal_delta#1_3| (+ (* (- 1) v_cnt_43) v_N_29)) |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork1_steal_x#1_4| v_cnt_43) (= v_cnt_42 (+ v_cnt_43 |v_workerWithAssertThread1of1ForFork1_steal_num#1_3|)))) InVars {N=v_N_29, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_43, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_3|} OutVars{N=v_N_29, workerWithAssertThread1of1ForFork1_steal_num#1=|v_workerWithAssertThread1of1ForFork1_steal_num#1_3|, workerWithAssertThread1of1ForFork1_steal_delta#1=|v_workerWithAssertThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_42, workerWithAssertThread1of1ForFork1_steal_x#1=|v_workerWithAssertThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork1_steal_num#1, workerWithAssertThread1of1ForFork1_steal_x#1]" [2025-04-26 16:24:21,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:21,770 INFO L85 PathProgramCache]: Analyzing trace with hash -490234766, now seen corresponding path program 1 times [2025-04-26 16:24:21,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:21,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027076690] [2025-04-26 16:24:21,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:24:21,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:21,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:24:21,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:24:21,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,773 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:21,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:24:21,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:24:21,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:21,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:21,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1813206437, now seen corresponding path program 15 times [2025-04-26 16:24:21,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:21,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517036567] [2025-04-26 16:24:21,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:24:21,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:21,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:24:21,778 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:24:21,778 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:24:21,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,778 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:21,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:24:21,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:24:21,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:21,780 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:21,780 INFO L85 PathProgramCache]: Analyzing trace with hash 653739212, now seen corresponding path program 14 times [2025-04-26 16:24:21,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:24:21,780 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193328311] [2025-04-26 16:24:21,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:24:21,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:24:21,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-26 16:24:21,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:24:21,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:24:21,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,784 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:24:21,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:24:21,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:24:21,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:21,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:24:21,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:24:22,095 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:24:22,095 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:24:22,095 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:24:22,095 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:24:22,095 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:24:22,095 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,095 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:24:22,095 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:24:22,095 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration40_Lasso [2025-04-26 16:24:22,095 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:24:22,095 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:24:22,096 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:22,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:22,100 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:22,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:22,281 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:22,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:24:22,746 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:24:22,746 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:24:22,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:22,748 INFO L229 MonitoredProcess]: Starting monitored process 191 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:24:22,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2025-04-26 16:24:22,752 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:24:22,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:22,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:22,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:22,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:22,762 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:22,762 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:22,764 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:22,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2025-04-26 16:24:22,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:22,771 INFO L229 MonitoredProcess]: Starting monitored process 192 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:24:22,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2025-04-26 16:24:22,773 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:24:22,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:22,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:22,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:22,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:22,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:22,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:22,786 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:22,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2025-04-26 16:24:22,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:22,793 INFO L229 MonitoredProcess]: Starting monitored process 193 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:24:22,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2025-04-26 16:24:22,795 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:24:22,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:22,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:22,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:22,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:22,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:24:22,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:24:22,808 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:22,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2025-04-26 16:24:22,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:22,815 INFO L229 MonitoredProcess]: Starting monitored process 194 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:24:22,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2025-04-26 16:24:22,816 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:24:22,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:22,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:24:22,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:24:22,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:24:22,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:22,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:24:22,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:24:22,827 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:24:22,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2025-04-26 16:24:22,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:22,834 INFO L229 MonitoredProcess]: Starting monitored process 195 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:24:22,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2025-04-26 16:24:22,836 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:24:22,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:24:22,846 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:24:22,846 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:24:22,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:24:22,861 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:24:22,861 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:24:22,958 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:24:22,994 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:24:22,994 INFO L437 ModelExtractionUtils]: 16 out of 56 variables were initially zero. Simplification set additionally 37 variables to zero. [2025-04-26 16:24:22,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:24:22,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:24:22,995 INFO L229 MonitoredProcess]: Starting monitored process 196 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:24:22,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2025-04-26 16:24:22,997 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:24:23,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2025-04-26 16:24:23,013 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:24:23,013 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:24:23,013 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2025-04-26 16:24:23,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2025-04-26 16:24:23,021 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:24:23,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:23,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:24:23,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:24:23,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:23,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:23,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:23,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:23,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:24:23,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:24:23,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:23,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:23,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:24:23,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:23,169 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:24:23,170 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2025-04-26 16:24:23,170 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 209256 states and 576376 transitions. cyclomatic complexity: 369925 Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (in total 29), 7 states have internal predecessors, (29), 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:24:25,437 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 209256 states and 576376 transitions. cyclomatic complexity: 369925. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (in total 29), 7 states have internal predecessors, (29), 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 328485 states and 887132 transitions. Complement of second has 9 states. [2025-04-26 16:24:25,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (in total 29), 7 states have internal predecessors, (29), 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:24:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2025-04-26 16:24:25,438 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 69 transitions. Stem has 13 letters. Loop has 16 letters. [2025-04-26 16:24:25,438 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:25,438 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:24:25,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:24:25,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:24:25,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:24:25,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:25,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:25,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:24:25,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:25,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:24:25,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:24:25,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:24:25,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:24:25,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 16:24:25,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:24:25,846 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:24:25,846 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2025-04-26 16:24:25,846 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 209256 states and 576376 transitions. cyclomatic complexity: 369925 Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:24:29,426 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 209256 states and 576376 transitions. cyclomatic complexity: 369925. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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 424841 states and 1137814 transitions. Complement of second has 25 states. [2025-04-26 16:24:29,427 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2025-04-26 16:24:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (in total 29), 8 states have internal predecessors, (29), 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:24:29,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 128 transitions. [2025-04-26 16:24:29,429 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 128 transitions. Stem has 13 letters. Loop has 16 letters. [2025-04-26 16:24:29,429 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:29,429 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 128 transitions. Stem has 29 letters. Loop has 16 letters. [2025-04-26 16:24:29,429 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:29,429 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 128 transitions. Stem has 13 letters. Loop has 32 letters. [2025-04-26 16:24:29,429 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:24:29,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 424841 states and 1137814 transitions. [2025-04-26 16:24:33,534 INFO L131 ngComponentsAnalysis]: Automaton has 66 accepting balls. 8994 [2025-04-26 16:24:36,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 424841 states to 353002 states and 939877 transitions. [2025-04-26 16:24:36,249 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38672 [2025-04-26 16:24:36,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39535 [2025-04-26 16:24:36,340 INFO L74 IsDeterministic]: Start isDeterministic. Operand 353002 states and 939877 transitions. [2025-04-26 16:24:36,340 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:24:36,341 INFO L218 hiAutomatonCegarLoop]: Abstraction has 353002 states and 939877 transitions. [2025-04-26 16:24:36,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353002 states and 939877 transitions.