/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/work-steal2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:54:12,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:12,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:54:12,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:12,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:12,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:54:12,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:12,209 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:12,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:12,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:12,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:12,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:12,212 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:12,212 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:12,212 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:12,213 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:12,213 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:12,213 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:12,213 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:12,213 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:12,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:12,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:12,213 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:12,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:12,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:12,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:12,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:12,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:12,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:12,213 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:12,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:12,214 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:12,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:12,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:12,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:12,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:12,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:12,214 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:12,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:12,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:12,214 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:12,214 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:12,214 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:12,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:12,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:12,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:12,479 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:12,480 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:12,482 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:54:12,482 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/work-steal2.bpl' [2025-04-26 16:54:12,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:12,504 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:12,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:12,505 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:12,505 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:12,512 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:54:12" (1/1) ... [2025-04-26 16:54:12,532 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:54:12" (1/1) ... [2025-04-26 16:54:12,551 INFO L138 Inliner]: procedures = 4, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2025-04-26 16:54:12,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:12,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:12,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:12,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:12,559 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:54:12" (1/1) ... [2025-04-26 16:54:12,559 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:54:12" (1/1) ... [2025-04-26 16:54:12,560 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:54:12" (1/1) ... [2025-04-26 16:54:12,561 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:54:12" (1/1) ... [2025-04-26 16:54:12,563 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:54:12" (1/1) ... [2025-04-26 16:54:12,564 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:54:12" (1/1) ... [2025-04-26 16:54:12,566 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:54:12" (1/1) ... [2025-04-26 16:54:12,566 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:54:12" (1/1) ... [2025-04-26 16:54:12,567 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:54:12" (1/1) ... [2025-04-26 16:54:12,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:12,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:12,578 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:12,578 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:12,583 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:54:12" (1/1) ... [2025-04-26 16:54:12,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:12,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:12,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:12,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:54:12,629 INFO L124 BoogieDeclarations]: Specification and implementation of procedure workerWithAssert given in one single declaration [2025-04-26 16:54:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure workerWithAssert [2025-04-26 16:54:12,629 INFO L138 BoogieDeclarations]: Found implementation of procedure workerWithAssert [2025-04-26 16:54:12,629 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:12,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:12,629 INFO L124 BoogieDeclarations]: Specification and implementation of procedure worker given in one single declaration [2025-04-26 16:54:12,629 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2025-04-26 16:54:12,629 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2025-04-26 16:54:12,630 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:54:12,669 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:12,671 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:12,761 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:12,761 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:12,802 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:12,802 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-26 16:54:12,802 INFO L201 PluginConnector]: Adding new model work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:12 BoogieIcfgContainer [2025-04-26 16:54:12,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:12,803 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:12,803 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:12,807 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:12,807 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:12,807 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:54:12" (1/2) ... [2025-04-26 16:54:12,808 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74fd8217 and model type work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:54:12, skipping insertion in model container [2025-04-26 16:54:12,808 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:12,808 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:54:12" (2/2) ... [2025-04-26 16:54:12,809 INFO L376 chiAutomizerObserver]: Analyzing ICFG work-steal2.bpl [2025-04-26 16:54:12,857 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-26 16:54:12,889 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:12,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:12,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:12,891 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:12,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:54:12,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 32 transitions, 72 flow [2025-04-26 16:54:12,975 INFO L116 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-04-26 16:54:12,978 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-26 16:54:12,983 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:54:12,983 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 32 transitions, 72 flow [2025-04-26 16:54:12,987 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 62 flow [2025-04-26 16:54:12,988 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 31 places, 28 transitions, 62 flow [2025-04-26 16:54:12,992 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:13,113 WARN L140 AmpleReduction]: Number of pruned transitions: 51 [2025-04-26 16:54:13,115 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:54:13,116 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 2 [2025-04-26 16:54:13,116 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:34 [2025-04-26 16:54:13,116 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:40 [2025-04-26 16:54:13,116 WARN L145 AmpleReduction]: Times succ was already a loop node:5 [2025-04-26 16:54:13,116 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:2 [2025-04-26 16:54:13,116 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:13,118 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 77 states, 75 states have (on average 1.2933333333333332) internal successors, (in total 97), 76 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:54:13,123 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:13,123 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:13,123 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:13,123 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:13,124 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:13,124 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:13,124 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:13,124 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:13,125 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 77 states, 75 states have (on average 1.2933333333333332) internal successors, (in total 97), 76 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:54:13,134 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 55 [2025-04-26 16:54:13,134 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:13,134 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:13,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:54:13,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:13,138 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:13,139 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 77 states, 75 states have (on average 1.2933333333333332) internal successors, (in total 97), 76 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have 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:54:13,141 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 55 [2025-04-26 16:54:13,141 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:13,141 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:13,141 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:54:13,141 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:13,145 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[]" "[107] L41-->workerWithAssertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:54:13,146 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:54:13,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:13,150 INFO L85 PathProgramCache]: Analyzing trace with hash -458295403, now seen corresponding path program 1 times [2025-04-26 16:54:13,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:13,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042215468] [2025-04-26 16:54:13,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:13,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:13,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:13,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:13,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,210 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:13,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:13,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:13,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:13,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:13,234 INFO L85 PathProgramCache]: Analyzing trace with hash -602664729, now seen corresponding path program 1 times [2025-04-26 16:54:13,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:13,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76114258] [2025-04-26 16:54:13,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:13,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:13,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:13,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:13,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,260 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:13,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:13,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:13,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:13,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:13,279 INFO L85 PathProgramCache]: Analyzing trace with hash -244566917, now seen corresponding path program 1 times [2025-04-26 16:54:13,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:13,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330622884] [2025-04-26 16:54:13,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:13,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:13,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:13,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:13,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,300 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:13,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:13,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:13,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:13,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:13,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:13,618 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:13,618 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:13,618 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:13,619 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:13,619 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:13,619 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,620 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:13,620 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:13,620 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:13,621 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:13,621 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:13,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:13,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:13,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:13,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:13,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:13,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:13,672 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:13,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:13,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:13,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:13,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:13,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:13,850 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:13,852 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:13,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,855 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:54:13,857 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:54:13,858 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:54:13,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:13,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,873 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:13,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:13,875 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:13,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,883 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:54:13,884 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:54:13,885 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:54:13,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:13,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:13,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:13,898 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,903 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:54:13,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,905 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:54:13,906 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:54:13,907 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:54:13,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:13,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:13,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:13,918 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,924 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:54:13,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,926 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:54:13,927 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:54:13,929 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:54:13,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:13,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:13,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:13,941 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:13,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,949 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:54:13,950 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:54:13,952 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:54:13,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:13,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:13,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:13,964 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,970 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:54:13,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,972 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:54:13,973 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:54:13,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:54:13,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:13,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:13,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:13,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:13,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:13,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:13,989 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:13,995 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:54:13,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:13,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:13,997 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:54:13,998 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:54:13,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:54:14,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:14,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:14,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:14,012 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:14,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,019 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:54:14,020 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:54:14,022 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:54:14,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,036 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,042 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:54:14,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,044 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:54:14,046 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:54:14,047 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:54:14,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,061 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:14,067 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:54:14,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,070 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:54:14,071 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:54:14,072 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:54:14,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:14,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:14,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:14,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:14,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:14,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:14,098 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:14,110 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:54:14,110 INFO L437 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:54:14,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:14,113 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:54:14,115 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:54:14,116 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:14,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:54:14,132 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:14,132 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:14,132 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2025-04-26 16:54:14,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:14,140 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:14,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:54:14,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:54:14,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:14,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:14,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:14,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:14,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:14,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:14,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:14,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:14,400 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:54:14,418 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:54:14,420 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 77 states, 75 states have (on average 1.2933333333333332) internal successors, (in total 97), 76 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (in total 14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:14,543 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 77 states, 75 states have (on average 1.2933333333333332) internal successors, (in total 97), 76 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (in total 14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 112 states and 137 transitions. Complement of second has 8 states. [2025-04-26 16:54:14,545 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:54:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (in total 14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:14,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2025-04-26 16:54:14,554 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 6 letters. Loop has 8 letters. [2025-04-26 16:54:14,555 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:14,555 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 14 letters. Loop has 8 letters. [2025-04-26 16:54:14,555 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:14,555 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 46 transitions. Stem has 6 letters. Loop has 16 letters. [2025-04-26 16:54:14,555 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:14,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 137 transitions. [2025-04-26 16:54:14,561 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2025-04-26 16:54:14,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 50 states and 56 transitions. [2025-04-26 16:54:14,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2025-04-26 16:54:14,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-04-26 16:54:14,568 INFO L74 IsDeterministic]: Start isDeterministic. Operand 50 states and 56 transitions. [2025-04-26 16:54:14,569 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:14,569 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-04-26 16:54:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 56 transitions. [2025-04-26 16:54:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-04-26 16:54:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.12) internal successors, (in total 56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have 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:54:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2025-04-26 16:54:14,586 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-04-26 16:54:14,586 INFO L438 stractBuchiCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-04-26 16:54:14,586 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:54:14,586 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 56 transitions. [2025-04-26 16:54:14,587 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2025-04-26 16:54:14,587 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:14,587 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:14,587 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:14,587 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:14,588 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]" "[117] L53-->L56: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[119] L56-->workerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:54:14,588 INFO L754 eck$LassoCheckResult]: Loop: "[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]" [2025-04-26 16:54:14,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1959722199, now seen corresponding path program 1 times [2025-04-26 16:54:14,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,588 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450387618] [2025-04-26 16:54:14,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:14,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:14,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,594 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:14,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:14,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,597 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1352694905, now seen corresponding path program 1 times [2025-04-26 16:54:14,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210332335] [2025-04-26 16:54:14,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:14,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:14,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,607 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:14,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:14,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,617 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash -995669411, now seen corresponding path program 1 times [2025-04-26 16:54:14,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:14,617 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825321912] [2025-04-26 16:54:14,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:14,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:14,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:54:14,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:54:14,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,631 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:14,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:54:14,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:54:14,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:14,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:14,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:14,774 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:14,775 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:14,775 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:14,775 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:14,775 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:14,775 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:14,775 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:14,775 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:14,775 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:54:14,775 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:14,775 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:14,776 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,787 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,792 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:14,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,029 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:15,030 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:15,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,032 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:54:15,033 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:54:15,035 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:54:15,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,049 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,055 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:54:15,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,057 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:54:15,058 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:54:15,062 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:54:15,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,075 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:15,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:15,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:15,077 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:54:15,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,085 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:54:15,086 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:54:15,087 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:54:15,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:15,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:15,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:15,099 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,105 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:54:15,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,107 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:54:15,108 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:54:15,109 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:54:15,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:15,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:15,123 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:15,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,131 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:54:15,132 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:54:15,134 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:54:15,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:15,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:15,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:15,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:15,149 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:15,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:15,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,156 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:54:15,157 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:54:15,158 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:54:15,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:15,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:15,168 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:54:15,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:15,188 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:54:15,188 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:54:15,211 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:15,246 INFO L436 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-04-26 16:54:15,246 INFO L437 ModelExtractionUtils]: 15 out of 31 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-04-26 16:54:15,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:15,248 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:54:15,250 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:54:15,251 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:15,268 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:54:15,269 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:54:15,269 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:15,269 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(cnt, N) = -1*cnt + 1*N Supporting invariants [] [2025-04-26 16:54:15,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:54:15,276 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:15,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:15,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:15,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:15,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:15,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:15,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:15,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:15,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:15,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:54:15,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:15,561 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:54:15,562 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:54:15,562 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 56 transitions. cyclomatic complexity: 10 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (in total 16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:54:15,653 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 56 transitions. cyclomatic complexity: 10. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (in total 16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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 68 states and 77 transitions. Complement of second has 8 states. [2025-04-26 16:54:15,654 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:54:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (in total 16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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:54:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2025-04-26 16:54:15,654 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 8 letters. Loop has 8 letters. [2025-04-26 16:54:15,655 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,655 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 16 letters. Loop has 8 letters. [2025-04-26 16:54:15,655 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,655 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 8 letters. Loop has 16 letters. [2025-04-26 16:54:15,655 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:15,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 77 transitions. [2025-04-26 16:54:15,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:15,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 32 states and 34 transitions. [2025-04-26 16:54:15,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2025-04-26 16:54:15,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2025-04-26 16:54:15,656 INFO L74 IsDeterministic]: Start isDeterministic. Operand 32 states and 34 transitions. [2025-04-26 16:54:15,657 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:15,657 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-04-26 16:54:15,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 34 transitions. [2025-04-26 16:54:15,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-04-26 16:54:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.0625) internal successors, (in total 34), 31 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:54:15,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2025-04-26 16:54:15,661 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-04-26 16:54:15,661 INFO L438 stractBuchiCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-04-26 16:54:15,661 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:54:15,661 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 34 transitions. [2025-04-26 16:54:15,661 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:15,662 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:15,662 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:15,662 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:15,662 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:15,662 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]" "[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[]" [2025-04-26 16:54:15,662 INFO L754 eck$LassoCheckResult]: Loop: "[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]" [2025-04-26 16:54:15,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,663 INFO L85 PathProgramCache]: Analyzing trace with hash 621845136, now seen corresponding path program 1 times [2025-04-26 16:54:15,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267764188] [2025-04-26 16:54:15,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:15,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:15,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:15,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,669 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:15,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:15,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1352694905, now seen corresponding path program 2 times [2025-04-26 16:54:15,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273232587] [2025-04-26 16:54:15,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:15,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:15,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:15,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,686 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:15,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:15,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,698 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:15,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1049616618, now seen corresponding path program 1 times [2025-04-26 16:54:15,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:15,699 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018524486] [2025-04-26 16:54:15,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:15,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:15,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:54:15,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:54:15,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,711 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:15,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:54:15,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:54:15,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:15,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:15,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:15,817 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:15,817 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:15,817 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:15,817 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:15,818 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:15,818 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:15,818 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:15,818 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:15,818 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:54:15,818 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:15,818 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:15,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:15,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,025 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:16,025 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:16,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,029 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:54:16,030 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:54:16,030 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:54:16,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:16,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:16,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:16,041 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:16,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:16,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,049 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:54:16,050 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:54:16,051 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:54:16,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:16,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:16,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:16,062 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:16,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:54:16,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,070 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:54:16,070 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:54:16,071 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:54:16,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,081 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:54:16,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,091 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:54:16,091 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:54:16,110 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:16,145 INFO L436 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2025-04-26 16:54:16,145 INFO L437 ModelExtractionUtils]: 16 out of 31 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-04-26 16:54:16,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,147 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:54:16,148 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:54:16,149 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:16,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:54:16,166 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:54:16,166 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:16,166 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2025-04-26 16:54:16,173 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:54:16,174 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:16,184 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:16,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:16,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:16,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:16,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,360 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:54:16,360 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:54:16,361 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 34 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (in total 17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:16,432 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 34 transitions. cyclomatic complexity: 4. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (in total 17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 52 states and 58 transitions. Complement of second has 9 states. [2025-04-26 16:54:16,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:54:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (in total 17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:16,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2025-04-26 16:54:16,433 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 9 letters. Loop has 8 letters. [2025-04-26 16:54:16,434 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,434 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 17 letters. Loop has 8 letters. [2025-04-26 16:54:16,434 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,434 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 9 letters. Loop has 16 letters. [2025-04-26 16:54:16,434 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:16,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 58 transitions. [2025-04-26 16:54:16,435 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:16,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 47 states and 52 transitions. [2025-04-26 16:54:16,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-04-26 16:54:16,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2025-04-26 16:54:16,435 INFO L74 IsDeterministic]: Start isDeterministic. Operand 47 states and 52 transitions. [2025-04-26 16:54:16,435 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:16,435 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-04-26 16:54:16,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 52 transitions. [2025-04-26 16:54:16,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-04-26 16:54:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.1111111111111112) internal successors, (in total 50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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:54:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-04-26 16:54:16,440 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-04-26 16:54:16,441 INFO L438 stractBuchiCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-04-26 16:54:16,441 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:54:16,441 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 50 transitions. [2025-04-26 16:54:16,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:16,441 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:16,441 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:16,441 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:16,441 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:16,442 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]" "[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[]" "[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:54:16,442 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:54:16,442 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2097330152, now seen corresponding path program 1 times [2025-04-26 16:54:16,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814922506] [2025-04-26 16:54:16,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:16,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:16,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:16,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,451 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:16,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:16,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,460 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1105178277, now seen corresponding path program 2 times [2025-04-26 16:54:16,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290735237] [2025-04-26 16:54:16,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:16,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,465 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:16,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:16,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:16,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:16,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:16,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,479 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,480 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,480 INFO L85 PathProgramCache]: Analyzing trace with hash -834915774, now seen corresponding path program 1 times [2025-04-26 16:54:16,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,480 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937872144] [2025-04-26 16:54:16,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:16,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:54:16,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:54:16,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,498 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:54:16,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:54:16,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,687 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:16,688 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:16,688 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:16,688 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:16,688 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:16,688 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,688 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:16,688 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:16,688 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:54:16,688 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:16,688 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:16,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:17,162 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:17,162 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:17,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:17,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,164 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:54:17,165 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:54:17,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:54:17,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:17,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:17,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:17,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:17,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:17,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:17,179 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:17,184 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:54:17,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:17,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,186 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:54:17,188 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:54:17,189 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:54:17,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:17,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:17,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:17,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:17,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:17,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:17,199 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:17,200 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:17,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:54:17,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:17,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,207 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:54:17,208 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:54:17,209 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:54:17,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:17,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:17,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:17,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:17,219 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:17,219 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:17,222 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:17,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:17,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:17,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,229 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:54:17,230 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:54:17,231 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:54:17,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:17,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:17,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:17,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:17,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:17,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:17,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:17,241 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:17,247 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:54:17,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:17,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,248 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:54:17,249 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:54:17,250 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:54:17,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:17,260 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:17,260 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:54:17,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:17,273 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:54:17,273 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:54:17,294 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:17,318 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:54:17,318 INFO L437 ModelExtractionUtils]: 23 out of 36 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:54:17,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:17,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:17,320 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:54:17,321 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:54:17,322 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:17,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:17,344 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:54:17,344 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:17,344 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(cnt, workerThread1of1ForFork0_steal_num#1, N) = -2*cnt + 2*workerThread1of1ForFork0_steal_num#1 + 3*N Supporting invariants [-2*cnt + 3*N >= 0] [2025-04-26 16:54:17,350 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:54:17,357 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:17,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:17,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:54:17,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:54:17,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:17,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:54:17,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:17,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:17,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:17,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:17,446 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-26 16:54:17,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:17,531 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:54:17,532 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 5 loop predicates [2025-04-26 16:54:17,532 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 50 transitions. cyclomatic complexity: 8 Second operand has 9 states, 9 states have (on average 2.0) internal successors, (in total 18), 8 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:54:17,734 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 50 transitions. cyclomatic complexity: 8. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (in total 18), 8 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 66 states and 73 transitions. Complement of second has 17 states. [2025-04-26 16:54:17,734 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:54:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (in total 18), 8 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:54:17,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 29 transitions. [2025-04-26 16:54:17,735 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 29 transitions. Stem has 10 letters. Loop has 8 letters. [2025-04-26 16:54:17,735 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:17,735 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 29 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:54:17,735 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:17,735 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 29 transitions. Stem has 10 letters. Loop has 16 letters. [2025-04-26 16:54:17,736 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:17,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 73 transitions. [2025-04-26 16:54:17,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:17,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 73 transitions. [2025-04-26 16:54:17,738 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2025-04-26 16:54:17,738 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-04-26 16:54:17,738 INFO L74 IsDeterministic]: Start isDeterministic. Operand 66 states and 73 transitions. [2025-04-26 16:54:17,738 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:17,738 INFO L218 hiAutomatonCegarLoop]: Abstraction has 66 states and 73 transitions. [2025-04-26 16:54:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 73 transitions. [2025-04-26 16:54:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2025-04-26 16:54:17,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.1147540983606556) internal successors, (in total 68), 60 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have 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:54:17,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2025-04-26 16:54:17,740 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 68 transitions. [2025-04-26 16:54:17,740 INFO L438 stractBuchiCegarLoop]: Abstraction has 61 states and 68 transitions. [2025-04-26 16:54:17,740 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:54:17,740 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 68 transitions. [2025-04-26 16:54:17,740 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:17,740 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:17,740 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:17,741 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:17,741 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:17,741 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]" "[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[]" "[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:54:17,741 INFO L754 eck$LassoCheckResult]: Loop: "[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]" [2025-04-26 16:54:17,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:17,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1260298558, now seen corresponding path program 1 times [2025-04-26 16:54:17,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:17,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867139008] [2025-04-26 16:54:17,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:17,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:17,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:54:17,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:54:17,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:17,865 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:54:17,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:17,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867139008] [2025-04-26 16:54:17,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867139008] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:17,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:17,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:54:17,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616429169] [2025-04-26 16:54:17,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:17,869 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:54:17,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:17,870 INFO L85 PathProgramCache]: Analyzing trace with hash 501272935, now seen corresponding path program 3 times [2025-04-26 16:54:17,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:17,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848619227] [2025-04-26 16:54:17,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:17,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:17,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:17,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:17,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:54:17,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,875 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:17,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:17,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:17,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:17,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:17,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:17,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:17,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 16:54:17,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-26 16:54:17,955 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. cyclomatic complexity: 11 Second operand has 6 states, 5 states have (on average 2.8) internal successors, (in total 14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:18,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:18,011 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2025-04-26 16:54:18,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 80 transitions. [2025-04-26 16:54:18,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:18,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 80 transitions. [2025-04-26 16:54:18,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2025-04-26 16:54:18,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2025-04-26 16:54:18,013 INFO L74 IsDeterministic]: Start isDeterministic. Operand 72 states and 80 transitions. [2025-04-26 16:54:18,013 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:18,013 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 80 transitions. [2025-04-26 16:54:18,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 80 transitions. [2025-04-26 16:54:18,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2025-04-26 16:54:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.123076923076923) internal successors, (in total 73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have 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:54:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2025-04-26 16:54:18,015 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 73 transitions. [2025-04-26 16:54:18,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 16:54:18,016 INFO L438 stractBuchiCegarLoop]: Abstraction has 65 states and 73 transitions. [2025-04-26 16:54:18,016 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:54:18,017 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 73 transitions. [2025-04-26 16:54:18,017 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:18,017 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:18,017 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:18,017 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:18,017 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:18,018 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]" "[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[]" "[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]" "[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:54:18,018 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:54:18,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:18,018 INFO L85 PathProgramCache]: Analyzing trace with hash -834915786, now seen corresponding path program 1 times [2025-04-26 16:54:18,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:18,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505306837] [2025-04-26 16:54:18,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:18,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:18,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:54:18,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:54:18,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:18,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:18,027 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:18,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:54:18,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:54:18,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:18,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:18,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:18,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:18,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1336743739, now seen corresponding path program 3 times [2025-04-26 16:54:18,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:18,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941328102] [2025-04-26 16:54:18,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:18,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:18,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:18,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:18,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:54:18,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:18,042 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:18,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:18,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:18,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:18,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:18,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:18,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:18,048 INFO L85 PathProgramCache]: Analyzing trace with hash 834815088, now seen corresponding path program 1 times [2025-04-26 16:54:18,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:18,048 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124618170] [2025-04-26 16:54:18,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:18,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:18,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:18,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:18,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:18,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:18,061 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:18,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:18,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:18,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:18,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:18,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:18,325 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:18,326 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:18,326 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:18,326 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:18,326 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:18,326 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:18,326 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:18,326 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:18,326 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:54:18,326 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:18,326 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:18,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,330 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:18,737 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:18,737 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:18,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:18,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:18,739 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:54:18,740 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:54:18,741 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:54:18,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:18,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:18,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:18,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:18,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:18,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:18,754 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:18,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:18,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:18,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:18,761 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:54:18,762 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:54:18,763 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:54:18,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:18,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:18,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:18,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:18,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:18,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:18,776 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:18,783 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:54:18,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:18,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:18,785 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:54:18,786 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:54:18,786 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:54:18,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:18,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:18,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:18,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:18,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:18,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:18,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:18,798 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:18,803 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:54:18,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:18,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:18,805 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:54:18,805 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:54:18,806 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:54:18,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:18,816 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:18,816 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:54:18,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:18,828 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:54:18,829 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:54:18,854 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:18,875 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:54:18,875 INFO L437 ModelExtractionUtils]: 28 out of 41 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 16:54:18,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:18,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:18,877 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:54:18,879 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:54:18,880 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:18,896 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:54:18,897 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:54:18,897 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:18,897 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:54:18,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 16:54:18,906 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:18,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:18,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:54:18,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:54:18,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:18,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:18,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 16:54:18,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:19,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:19,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:19,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:19,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:19,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:54:19,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:19,236 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:54:19,236 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 4 loop predicates [2025-04-26 16:54:19,236 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 73 transitions. cyclomatic complexity: 12 Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (in total 26), 11 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:54:19,538 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 73 transitions. cyclomatic complexity: 12. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (in total 26), 11 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 114 states and 127 transitions. Complement of second has 20 states. [2025-04-26 16:54:19,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 9 stem states 4 non-accepting loop states 2 accepting loop states [2025-04-26 16:54:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (in total 26), 11 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:54:19,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2025-04-26 16:54:19,539 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 38 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:54:19,540 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:19,540 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 38 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:54:19,540 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:19,540 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 38 transitions. Stem has 18 letters. Loop has 16 letters. [2025-04-26 16:54:19,540 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:19,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 127 transitions. [2025-04-26 16:54:19,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:19,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 104 states and 115 transitions. [2025-04-26 16:54:19,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 61 [2025-04-26 16:54:19,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 69 [2025-04-26 16:54:19,542 INFO L74 IsDeterministic]: Start isDeterministic. Operand 104 states and 115 transitions. [2025-04-26 16:54:19,542 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:19,542 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 115 transitions. [2025-04-26 16:54:19,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 115 transitions. [2025-04-26 16:54:19,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 76. [2025-04-26 16:54:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.118421052631579) internal successors, (in total 85), 75 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have 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:54:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2025-04-26 16:54:19,544 INFO L240 hiAutomatonCegarLoop]: Abstraction has 76 states and 85 transitions. [2025-04-26 16:54:19,545 INFO L438 stractBuchiCegarLoop]: Abstraction has 76 states and 85 transitions. [2025-04-26 16:54:19,545 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:54:19,545 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 85 transitions. [2025-04-26 16:54:19,545 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:19,545 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:19,545 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:19,545 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:19,545 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:19,546 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]" "[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[]" "[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]" "[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:54:19,546 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:54:19,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:19,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1821623330, now seen corresponding path program 1 times [2025-04-26 16:54:19,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:19,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498111963] [2025-04-26 16:54:19,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:19,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:19,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:54:19,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:54:19,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:19,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:19,553 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:19,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:54:19,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:54:19,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:19,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:19,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:19,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:19,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1105178277, now seen corresponding path program 4 times [2025-04-26 16:54:19,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:19,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41574303] [2025-04-26 16:54:19,565 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:54:19,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:19,568 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:54:19,570 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:54:19,570 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:54:19,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:19,571 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:19,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:19,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:19,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:19,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:19,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:19,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:19,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1770153084, now seen corresponding path program 2 times [2025-04-26 16:54:19,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:19,575 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332472525] [2025-04-26 16:54:19,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:19,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:19,577 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:54:19,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:19,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:54:19,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:19,582 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:19,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:19,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:19,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:19,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:19,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:19,844 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:19,845 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:19,845 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:19,845 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:19,845 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:19,845 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:19,845 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:19,845 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:19,845 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration7_Lasso [2025-04-26 16:54:19,845 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:19,845 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:19,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:19,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:19,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:19,851 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:19,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:19,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:19,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:19,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:19,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:19,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:20,253 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:20,253 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:20,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:20,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:20,258 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:54:20,260 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:54:20,260 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:54:20,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:20,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:20,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:20,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:20,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:20,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:20,275 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:20,281 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:54:20,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:20,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:20,283 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:54:20,284 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:54:20,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:54:20,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:20,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:20,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:20,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:20,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:20,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:20,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:20,302 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:20,307 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:54:20,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:20,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:20,310 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:54:20,311 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:54:20,312 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:54:20,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:20,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:20,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:20,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:20,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:20,323 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:20,325 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:20,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 16:54:20,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:20,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:20,332 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:54:20,332 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:54:20,334 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:54:20,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:20,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:20,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:20,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:20,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:20,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:20,347 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:20,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2025-04-26 16:54:20,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:20,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:20,354 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:54:20,354 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:54:20,355 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:54:20,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:20,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:20,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:20,365 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:20,365 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:20,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:20,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:20,366 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:20,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:20,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:20,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:20,373 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:54:20,374 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:54:20,375 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:54:20,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:20,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:20,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:20,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:20,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:20,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:20,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:20,386 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:20,391 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:54:20,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:20,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:20,393 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:54:20,394 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:54:20,395 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:54:20,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:20,405 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:20,405 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:54:20,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:20,420 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:54:20,420 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:54:20,445 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:20,465 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:54:20,466 INFO L437 ModelExtractionUtils]: 21 out of 36 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:54:20,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:20,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:20,468 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:54:20,468 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:54:20,469 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:20,485 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:54:20,486 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:54:20,486 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:20,486 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(cnt, N, workerThread1of1ForFork0_steal_num#1) = -2*cnt + 3*N + 2*workerThread1of1ForFork0_steal_num#1 Supporting invariants [-2*cnt + 3*N >= 0] [2025-04-26 16:54:20,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2025-04-26 16:54:20,495 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:20,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:20,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:54:20,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:54:20,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:20,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:20,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 16:54:20,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:20,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:20,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:20,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:20,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:20,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:54:20,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:20,839 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:54:20,840 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 4 loop predicates [2025-04-26 16:54:20,840 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 85 transitions. cyclomatic complexity: 13 Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (in total 26), 11 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:54:21,124 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 85 transitions. cyclomatic complexity: 13. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (in total 26), 11 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 144 states and 158 transitions. Complement of second has 20 states. [2025-04-26 16:54:21,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 9 stem states 4 non-accepting loop states 2 accepting loop states [2025-04-26 16:54:21,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (in total 26), 11 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:54:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2025-04-26 16:54:21,126 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 38 transitions. Stem has 18 letters. Loop has 8 letters. [2025-04-26 16:54:21,126 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:21,126 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 38 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:54:21,126 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:21,126 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 38 transitions. Stem has 18 letters. Loop has 16 letters. [2025-04-26 16:54:21,126 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:21,126 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 158 transitions. [2025-04-26 16:54:21,127 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:21,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 123 states and 136 transitions. [2025-04-26 16:54:21,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 78 [2025-04-26 16:54:21,128 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 83 [2025-04-26 16:54:21,128 INFO L74 IsDeterministic]: Start isDeterministic. Operand 123 states and 136 transitions. [2025-04-26 16:54:21,128 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:21,128 INFO L218 hiAutomatonCegarLoop]: Abstraction has 123 states and 136 transitions. [2025-04-26 16:54:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 136 transitions. [2025-04-26 16:54:21,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 81. [2025-04-26 16:54:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.123456790123457) internal successors, (in total 91), 80 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:54:21,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2025-04-26 16:54:21,131 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81 states and 91 transitions. [2025-04-26 16:54:21,131 INFO L438 stractBuchiCegarLoop]: Abstraction has 81 states and 91 transitions. [2025-04-26 16:54:21,131 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:54:21,131 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 91 transitions. [2025-04-26 16:54:21,132 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:21,132 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:21,132 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:21,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:21,132 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:21,133 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]" "[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[]" "[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]" "[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:54:21,133 INFO L754 eck$LassoCheckResult]: Loop: "[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]" [2025-04-26 16:54:21,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash 335503000, now seen corresponding path program 1 times [2025-04-26 16:54:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:21,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929185628] [2025-04-26 16:54:21,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:21,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:21,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:54:21,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:54:21,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:21,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:21,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:21,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929185628] [2025-04-26 16:54:21,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929185628] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:54:21,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140395905] [2025-04-26 16:54:21,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:21,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:54:21,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:21,305 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:54:21,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-04-26 16:54:21,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:54:21,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:54:21,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:21,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:21,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 16:54:21,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:21,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:54:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:21,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140395905] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:54:21,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:54:21,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 21 [2025-04-26 16:54:21,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97325093] [2025-04-26 16:54:21,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:54:21,701 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:54:21,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:21,701 INFO L85 PathProgramCache]: Analyzing trace with hash 501272935, now seen corresponding path program 5 times [2025-04-26 16:54:21,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:21,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893853887] [2025-04-26 16:54:21,701 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:54:21,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:21,703 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:21,706 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:21,706 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:21,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:21,706 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:21,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:21,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:21,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:21,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:21,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:21,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:21,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-26 16:54:21,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-04-26 16:54:21,784 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. cyclomatic complexity: 14 Second operand has 23 states, 22 states have (on average 2.5454545454545454) internal successors, (in total 56), 22 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have 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:54:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:22,127 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2025-04-26 16:54:22,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 163 transitions. [2025-04-26 16:54:22,128 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 39 [2025-04-26 16:54:22,129 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 149 states and 163 transitions. [2025-04-26 16:54:22,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2025-04-26 16:54:22,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2025-04-26 16:54:22,129 INFO L74 IsDeterministic]: Start isDeterministic. Operand 149 states and 163 transitions. [2025-04-26 16:54:22,129 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:22,129 INFO L218 hiAutomatonCegarLoop]: Abstraction has 149 states and 163 transitions. [2025-04-26 16:54:22,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 163 transitions. [2025-04-26 16:54:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 103. [2025-04-26 16:54:22,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 1.1067961165048543) internal successors, (in total 114), 102 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have 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:54:22,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2025-04-26 16:54:22,135 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103 states and 114 transitions. [2025-04-26 16:54:22,135 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-26 16:54:22,136 INFO L438 stractBuchiCegarLoop]: Abstraction has 103 states and 114 transitions. [2025-04-26 16:54:22,136 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:54:22,136 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 114 transitions. [2025-04-26 16:54:22,136 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:22,136 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:22,137 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:22,137 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:22,137 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:22,138 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]" "[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[]" "[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]" "[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:54:22,138 INFO L754 eck$LassoCheckResult]: Loop: "[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]" [2025-04-26 16:54:22,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:22,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1233452936, now seen corresponding path program 1 times [2025-04-26 16:54:22,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:22,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957460236] [2025-04-26 16:54:22,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:22,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:22,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:54:22,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:54:22,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:22,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:22,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:22,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957460236] [2025-04-26 16:54:22,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957460236] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:54:22,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574312906] [2025-04-26 16:54:22,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:22,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:54:22,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:22,253 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:54:22,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-04-26 16:54:22,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:54:22,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:54:22,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:22,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:22,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 16:54:22,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:22,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:54:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:22,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574312906] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:54:22,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:54:22,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8] total 21 [2025-04-26 16:54:22,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824495961] [2025-04-26 16:54:22,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:54:22,591 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:54:22,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:22,591 INFO L85 PathProgramCache]: Analyzing trace with hash 501272935, now seen corresponding path program 6 times [2025-04-26 16:54:22,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:22,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210733409] [2025-04-26 16:54:22,591 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:54:22,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:22,594 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:22,597 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:22,597 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:54:22,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:22,597 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:22,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:22,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:22,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:22,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:22,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:22,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:22,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-26 16:54:22,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-04-26 16:54:22,660 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. cyclomatic complexity: 16 Second operand has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (in total 65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:54:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:23,033 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2025-04-26 16:54:23,033 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 149 transitions. [2025-04-26 16:54:23,034 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2025-04-26 16:54:23,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 135 states and 149 transitions. [2025-04-26 16:54:23,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2025-04-26 16:54:23,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2025-04-26 16:54:23,035 INFO L74 IsDeterministic]: Start isDeterministic. Operand 135 states and 149 transitions. [2025-04-26 16:54:23,035 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:23,035 INFO L218 hiAutomatonCegarLoop]: Abstraction has 135 states and 149 transitions. [2025-04-26 16:54:23,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 149 transitions. [2025-04-26 16:54:23,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 111. [2025-04-26 16:54:23,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.1081081081081081) internal successors, (in total 123), 110 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have 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:54:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2025-04-26 16:54:23,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 123 transitions. [2025-04-26 16:54:23,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-26 16:54:23,043 INFO L438 stractBuchiCegarLoop]: Abstraction has 111 states and 123 transitions. [2025-04-26 16:54:23,043 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:54:23,043 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 123 transitions. [2025-04-26 16:54:23,043 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:23,043 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:23,043 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:23,044 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:23,044 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:23,044 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]" "[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[]" "[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]" "[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]" "[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:54:23,044 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:54:23,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:23,044 INFO L85 PathProgramCache]: Analyzing trace with hash 834815100, now seen corresponding path program 3 times [2025-04-26 16:54:23,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:23,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147608012] [2025-04-26 16:54:23,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:23,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:23,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:54:23,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:23,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-26 16:54:23,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:23,058 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:23,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:23,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:23,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:23,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:23,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:23,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:23,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1105178277, now seen corresponding path program 7 times [2025-04-26 16:54:23,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:23,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292872526] [2025-04-26 16:54:23,067 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:54:23,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:23,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:23,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:23,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:23,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:23,075 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:23,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:23,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:23,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:23,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:23,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:23,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:23,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2017454806, now seen corresponding path program 4 times [2025-04-26 16:54:23,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:23,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477793459] [2025-04-26 16:54:23,080 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:54:23,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:23,084 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-04-26 16:54:23,093 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:54:23,093 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:54:23,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:23,094 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:23,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:54:23,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:54:23,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:23,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:23,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:23,402 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:23,402 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:23,402 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:23,402 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:23,402 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:23,402 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,402 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:23,402 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:23,402 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration10_Lasso [2025-04-26 16:54:23,402 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:23,402 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:23,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,570 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,572 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,574 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:23,866 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:23,866 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:23,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,868 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:54:23,869 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:54:23,871 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:54:23,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:23,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:23,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:23,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:23,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:23,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:23,884 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:23,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:23,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,891 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:54:23,892 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:54:23,893 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:54:23,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:23,903 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:23,903 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:54:23,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:23,917 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:54:23,917 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:54:23,942 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:23,964 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 16:54:23,965 INFO L437 ModelExtractionUtils]: 22 out of 36 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-04-26 16:54:23,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:23,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:23,967 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:54:23,968 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:54:23,969 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:23,986 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:54:23,986 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:54:23,986 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:23,986 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerThread1of1ForFork0_steal_num#1, cnt) = 3*N + 2*workerThread1of1ForFork0_steal_num#1 - 2*cnt Supporting invariants [3*N - 2*cnt >= 0] [2025-04-26 16:54:23,993 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:54:23,996 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:54:24,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:24,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:24,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:24,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:24,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:24,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-26 16:54:24,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:24,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:24,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:24,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:24,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:24,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:54:24,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:24,509 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:54:24,510 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.12 stem predicates 4 loop predicates [2025-04-26 16:54:24,510 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 123 transitions. cyclomatic complexity: 18 Second operand has 16 states, 16 states have (on average 2.125) internal successors, (in total 34), 15 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:54:24,684 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 123 transitions. cyclomatic complexity: 18. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (in total 34), 15 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 143 states and 156 transitions. Complement of second has 16 states. [2025-04-26 16:54:24,685 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:54:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.125) internal successors, (in total 34), 15 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:54:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2025-04-26 16:54:24,686 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 28 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:54:24,686 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:24,686 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:54:24,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:24,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:24,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:24,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:24,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:24,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-26 16:54:24,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:25,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:25,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:25,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:25,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:25,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:54:25,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:25,152 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:54:25,153 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:54:25,153 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 123 transitions. cyclomatic complexity: 18 Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (in total 34), 14 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:54:25,330 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 123 transitions. cyclomatic complexity: 18. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (in total 34), 14 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 143 states and 156 transitions. Complement of second has 15 states. [2025-04-26 16:54:25,330 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:54:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (in total 34), 14 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:54:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2025-04-26 16:54:25,331 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 28 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:54:25,331 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:25,331 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:54:25,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:25,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:25,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:25,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:25,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:25,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-26 16:54:25,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:25,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:25,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:25,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:25,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:25,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:54:25,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:25,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:54:25,794 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.11 stem predicates 4 loop predicates [2025-04-26 16:54:25,794 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 123 transitions. cyclomatic complexity: 18 Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (in total 34), 14 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:54:26,695 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 123 transitions. cyclomatic complexity: 18. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (in total 34), 14 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 191 states and 209 transitions. Complement of second has 30 states. [2025-04-26 16:54:26,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 14 stem states 4 non-accepting loop states 2 accepting loop states [2025-04-26 16:54:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (in total 34), 14 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:54:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 64 transitions. [2025-04-26 16:54:26,696 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 20 states and 64 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:54:26,697 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:26,697 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 20 states and 64 transitions. Stem has 34 letters. Loop has 8 letters. [2025-04-26 16:54:26,697 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:26,697 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 20 states and 64 transitions. Stem has 26 letters. Loop has 16 letters. [2025-04-26 16:54:26,697 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:26,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 191 states and 209 transitions. [2025-04-26 16:54:26,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:26,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 191 states to 146 states and 160 transitions. [2025-04-26 16:54:26,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2025-04-26 16:54:26,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2025-04-26 16:54:26,699 INFO L74 IsDeterministic]: Start isDeterministic. Operand 146 states and 160 transitions. [2025-04-26 16:54:26,699 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:26,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 146 states and 160 transitions. [2025-04-26 16:54:26,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states and 160 transitions. [2025-04-26 16:54:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2025-04-26 16:54:26,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.1018518518518519) internal successors, (in total 119), 107 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have 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:54:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2025-04-26 16:54:26,706 INFO L240 hiAutomatonCegarLoop]: Abstraction has 108 states and 119 transitions. [2025-04-26 16:54:26,706 INFO L438 stractBuchiCegarLoop]: Abstraction has 108 states and 119 transitions. [2025-04-26 16:54:26,706 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:54:26,706 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 119 transitions. [2025-04-26 16:54:26,711 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:26,711 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:26,711 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:26,711 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:26,711 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:26,712 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]" "[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[]" "[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]" "[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]" "[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:54:26,712 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:54:26,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:26,712 INFO L85 PathProgramCache]: Analyzing trace with hash 131724892, now seen corresponding path program 2 times [2025-04-26 16:54:26,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:26,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544348601] [2025-04-26 16:54:26,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:26,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:26,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:54:26,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:26,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:54:26,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:26,722 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:26,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:26,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:26,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:26,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:26,728 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:26,728 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1105178277, now seen corresponding path program 8 times [2025-04-26 16:54:26,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:26,728 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138720010] [2025-04-26 16:54:26,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:26,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:26,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:26,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:26,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:26,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:26,733 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:26,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:26,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:26,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:26,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:26,738 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:26,738 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:26,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1408744630, now seen corresponding path program 5 times [2025-04-26 16:54:26,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:26,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196689179] [2025-04-26 16:54:26,739 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:54:26,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:26,743 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 3 equivalence classes. [2025-04-26 16:54:26,755 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:54:26,755 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-26 16:54:26,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:26,755 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:26,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:54:26,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:54:26,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:26,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:26,767 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:27,044 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:27,044 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:27,044 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:27,044 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:27,044 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:27,044 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,044 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:27,044 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:27,044 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration11_Lasso [2025-04-26 16:54:27,044 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:27,044 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:27,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:27,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:27,049 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:27,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:27,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:27,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:27,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:27,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:27,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:27,460 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:27,460 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:27,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,462 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:54:27,462 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:54:27,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:27,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:27,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:27,476 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:27,482 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:54:27,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,484 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:54:27,484 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:54:27,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:54:27,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:27,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:27,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:27,497 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:27,502 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:54:27,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,504 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:54:27,505 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:54:27,505 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:54:27,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,516 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:27,516 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:27,518 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:27,523 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:54:27,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,525 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:54:27,526 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:54:27,527 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:54:27,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,537 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:27,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:27,539 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:27,544 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:54:27,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,546 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:54:27,547 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:54:27,548 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:54:27,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,559 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:27,559 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:27,561 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:27,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-04-26 16:54:27,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,569 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:54:27,570 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:54:27,571 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:54:27,581 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:27,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:27,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:27,583 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:27,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:27,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,590 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:54:27,591 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:54:27,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:54:27,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,602 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:27,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:27,604 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:27,609 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:54:27,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,611 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:54:27,612 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:54:27,613 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:54:27,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:27,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:27,631 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:27,637 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:54:27,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,639 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:54:27,642 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:54:27,643 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:54:27,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,653 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:27,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:27,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:27,657 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:27,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:27,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,666 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:54:27,668 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:54:27,669 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:54:27,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:27,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:27,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:27,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:27,683 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:27,689 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:54:27,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,691 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:54:27,692 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:54:27,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:54:27,704 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:27,704 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:27,704 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:54:27,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:27,716 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:54:27,716 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:54:27,742 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:27,782 INFO L436 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2025-04-26 16:54:27,782 INFO L437 ModelExtractionUtils]: 23 out of 41 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-04-26 16:54:27,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:27,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:27,785 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:54:27,786 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:54:27,787 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:27,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:27,806 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:54:27,806 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:27,806 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:54:27,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:27,818 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:54:27,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:27,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:27,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:27,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:27,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:27,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-26 16:54:27,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:28,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:28,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:28,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:28,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:28,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:54:28,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:28,185 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:54:28,185 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:54:28,186 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 108 states and 119 transitions. cyclomatic complexity: 17 Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (in total 34), 14 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:54:28,618 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 108 states and 119 transitions. cyclomatic complexity: 17. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (in total 34), 14 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 186 states and 204 transitions. Complement of second has 24 states. [2025-04-26 16:54:28,619 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 13 stem states 4 non-accepting loop states 2 accepting loop states [2025-04-26 16:54:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (in total 34), 14 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:54:28,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 46 transitions. [2025-04-26 16:54:28,619 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 19 states and 46 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:54:28,619 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:28,620 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 19 states and 46 transitions. Stem has 34 letters. Loop has 8 letters. [2025-04-26 16:54:28,620 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:28,620 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 19 states and 46 transitions. Stem has 26 letters. Loop has 16 letters. [2025-04-26 16:54:28,620 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:28,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 186 states and 204 transitions. [2025-04-26 16:54:28,621 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:28,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 186 states to 172 states and 188 transitions. [2025-04-26 16:54:28,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2025-04-26 16:54:28,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2025-04-26 16:54:28,623 INFO L74 IsDeterministic]: Start isDeterministic. Operand 172 states and 188 transitions. [2025-04-26 16:54:28,623 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:28,623 INFO L218 hiAutomatonCegarLoop]: Abstraction has 172 states and 188 transitions. [2025-04-26 16:54:28,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states and 188 transitions. [2025-04-26 16:54:28,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 116. [2025-04-26 16:54:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.103448275862069) internal successors, (in total 128), 115 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have 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:54:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2025-04-26 16:54:28,626 INFO L240 hiAutomatonCegarLoop]: Abstraction has 116 states and 128 transitions. [2025-04-26 16:54:28,626 INFO L438 stractBuchiCegarLoop]: Abstraction has 116 states and 128 transitions. [2025-04-26 16:54:28,626 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 16:54:28,626 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 128 transitions. [2025-04-26 16:54:28,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:28,626 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:28,626 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:28,626 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:28,626 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:28,628 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]" "[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[]" "[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]" "[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]" "[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:54:28,628 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:54:28,628 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:28,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1770153072, now seen corresponding path program 6 times [2025-04-26 16:54:28,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:28,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889705168] [2025-04-26 16:54:28,629 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:54:28,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:28,631 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:54:28,635 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:28,635 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-26 16:54:28,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:28,635 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:28,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:28,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:28,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:28,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:28,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:28,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:28,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1336743739, now seen corresponding path program 4 times [2025-04-26 16:54:28,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:28,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442764749] [2025-04-26 16:54:28,640 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:54:28,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:28,642 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:54:28,643 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:54:28,643 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:54:28,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:28,643 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:28,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:28,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:28,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:28,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:28,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:28,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:28,645 INFO L85 PathProgramCache]: Analyzing trace with hash 473406634, now seen corresponding path program 7 times [2025-04-26 16:54:28,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:28,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659175912] [2025-04-26 16:54:28,646 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:54:28,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:28,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:54:28,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:54:28,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:28,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:28,651 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:28,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:54:28,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:54:28,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:28,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:28,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:28,980 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:28,980 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:28,980 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:28,980 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:28,980 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:28,980 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:28,980 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:28,980 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:28,980 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration12_Lasso [2025-04-26 16:54:28,981 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:28,981 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:28,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:28,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:28,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:28,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:28,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:28,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:28,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:28,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:28,994 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:28,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:29,375 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:29,375 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:29,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:29,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:29,377 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:54:29,378 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:54:29,379 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:54:29,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:29,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:29,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:29,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:29,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:29,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:29,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:29,390 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:29,395 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:54:29,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:29,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:29,396 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:54:29,397 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:54:29,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:54:29,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:29,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:29,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:29,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:29,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:29,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:29,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:29,409 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:29,414 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:54:29,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:29,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:29,416 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:54:29,416 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:54:29,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:29,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:29,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:29,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:29,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:29,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:29,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:29,430 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:29,435 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:54:29,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:29,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:29,437 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:54:29,444 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:54:29,445 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:54:29,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:29,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:29,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:29,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:29,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:29,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:29,458 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:29,463 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:54:29,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:29,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:29,465 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:54:29,467 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:54:29,468 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:54:29,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:29,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:29,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:29,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:29,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:29,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:29,481 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:29,486 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:54:29,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:29,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:29,488 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:54:29,489 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:54:29,489 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:54:29,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:29,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:29,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:29,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:29,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:29,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:29,502 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:29,507 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:54:29,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:29,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:29,510 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:54:29,510 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:54:29,511 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:54:29,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:29,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:29,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:29,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:29,522 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:29,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:29,524 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:29,530 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:54:29,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:29,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:29,532 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:54:29,533 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:54:29,534 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:54:29,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:29,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:29,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:29,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:29,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:29,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:29,546 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:29,552 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:54:29,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:29,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:29,554 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:54:29,554 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:54:29,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:54:29,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:29,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:29,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:29,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:29,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:29,566 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:29,568 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:29,573 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:54:29,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:29,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:29,575 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:54:29,576 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:54:29,577 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:54:29,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:29,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:29,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:29,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:29,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:29,588 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:29,590 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:29,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:29,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:29,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:29,597 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:54:29,598 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:54:29,599 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:54:29,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:29,608 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:29,608 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:54:29,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:29,619 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:54:29,619 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:54:29,645 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:29,673 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:54:29,673 INFO L437 ModelExtractionUtils]: 20 out of 36 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-04-26 16:54:29,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:29,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:29,676 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:54:29,677 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:54:29,678 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:29,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:29,694 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:54:29,694 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:29,694 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(cnt, workerWithAssertThread1of1ForFork1_steal_num#1, N) = -2*cnt + 2*workerWithAssertThread1of1ForFork1_steal_num#1 + 3*N Supporting invariants [-2*cnt + 3*N >= 0] [2025-04-26 16:54:29,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-04-26 16:54:29,704 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:54:29,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:29,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:29,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:29,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:29,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:29,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-26 16:54:29,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:30,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:30,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:30,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:30,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:30,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:54:30,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:30,132 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:54:30,133 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:54:30,133 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 116 states and 128 transitions. cyclomatic complexity: 18 Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (in total 34), 13 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:54:30,278 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 116 states and 128 transitions. cyclomatic complexity: 18. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (in total 34), 13 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 153 states and 167 transitions. Complement of second has 15 states. [2025-04-26 16:54:30,279 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:54:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (in total 34), 13 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:54:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2025-04-26 16:54:30,279 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 10 states and 28 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:54:30,279 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:30,279 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:54:30,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:30,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:30,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:30,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:30,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:30,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-26 16:54:30,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:30,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:30,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:30,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:30,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:30,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:54:30,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:30,629 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:54:30,630 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.12 stem predicates 4 loop predicates [2025-04-26 16:54:30,630 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 116 states and 128 transitions. cyclomatic complexity: 18 Second operand has 16 states, 16 states have (on average 2.125) internal successors, (in total 34), 15 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:54:30,794 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 116 states and 128 transitions. cyclomatic complexity: 18. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (in total 34), 15 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 153 states and 167 transitions. Complement of second has 16 states. [2025-04-26 16:54:30,794 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:54:30,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.125) internal successors, (in total 34), 15 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:54:30,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2025-04-26 16:54:30,795 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 11 states and 28 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:54:30,795 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:30,795 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:54:30,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:30,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:30,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:30,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:30,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:30,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-26 16:54:30,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:31,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:31,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:31,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:31,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:31,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:54:31,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:31,238 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:54:31,238 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.12 stem predicates 4 loop predicates [2025-04-26 16:54:31,238 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 116 states and 128 transitions. cyclomatic complexity: 18 Second operand has 16 states, 16 states have (on average 2.125) internal successors, (in total 34), 15 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:54:31,720 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 116 states and 128 transitions. cyclomatic complexity: 18. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (in total 34), 15 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 200 states and 217 transitions. Complement of second has 29 states. [2025-04-26 16:54:31,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 13 stem states 4 non-accepting loop states 2 accepting loop states [2025-04-26 16:54:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.125) internal successors, (in total 34), 15 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:54:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 59 transitions. [2025-04-26 16:54:31,721 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 19 states and 59 transitions. Stem has 26 letters. Loop has 8 letters. [2025-04-26 16:54:31,721 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:31,721 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 19 states and 59 transitions. Stem has 34 letters. Loop has 8 letters. [2025-04-26 16:54:31,723 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:31,723 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 19 states and 59 transitions. Stem has 26 letters. Loop has 16 letters. [2025-04-26 16:54:31,723 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:31,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 217 transitions. [2025-04-26 16:54:31,724 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:31,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 164 states and 180 transitions. [2025-04-26 16:54:31,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2025-04-26 16:54:31,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2025-04-26 16:54:31,725 INFO L74 IsDeterministic]: Start isDeterministic. Operand 164 states and 180 transitions. [2025-04-26 16:54:31,725 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:31,725 INFO L218 hiAutomatonCegarLoop]: Abstraction has 164 states and 180 transitions. [2025-04-26 16:54:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 180 transitions. [2025-04-26 16:54:31,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 143. [2025-04-26 16:54:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 143 states have (on average 1.1118881118881119) internal successors, (in total 159), 142 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have 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:54:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2025-04-26 16:54:31,728 INFO L240 hiAutomatonCegarLoop]: Abstraction has 143 states and 159 transitions. [2025-04-26 16:54:31,728 INFO L438 stractBuchiCegarLoop]: Abstraction has 143 states and 159 transitions. [2025-04-26 16:54:31,728 INFO L340 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-04-26 16:54:31,728 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 159 transitions. [2025-04-26 16:54:31,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:31,731 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:31,731 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:31,731 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:31,731 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:31,732 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]" "[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[]" "[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]" "[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]" "[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[]" [2025-04-26 16:54:31,732 INFO L754 eck$LassoCheckResult]: Loop: "[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[]" "[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[]" [2025-04-26 16:54:31,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:31,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1562238477, now seen corresponding path program 1 times [2025-04-26 16:54:31,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:31,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192981183] [2025-04-26 16:54:31,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:31,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:31,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 16:54:31,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 16:54:31,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:31,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:31,739 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:31,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 16:54:31,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 16:54:31,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:31,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:31,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:31,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:31,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1996127547, now seen corresponding path program 5 times [2025-04-26 16:54:31,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:31,745 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371496403] [2025-04-26 16:54:31,745 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:54:31,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:31,748 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:31,752 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:31,752 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:31,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:31,752 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:31,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:31,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:31,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:31,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:31,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:31,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:31,755 INFO L85 PathProgramCache]: Analyzing trace with hash 316443949, now seen corresponding path program 8 times [2025-04-26 16:54:31,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:31,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910231773] [2025-04-26 16:54:31,755 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:31,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:31,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-26 16:54:31,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-26 16:54:31,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:54:31,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:31,762 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:31,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-26 16:54:31,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-26 16:54:31,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:31,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:31,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:32,003 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:32,003 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:32,003 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:32,003 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:32,003 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:32,003 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,003 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:32,003 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:32,003 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration13_Lasso [2025-04-26 16:54:32,003 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:32,003 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:32,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:32,202 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:32,202 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:32,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,204 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:54:32,205 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:54:32,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:54:32,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:32,216 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:32,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:32,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:32,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:32,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:32,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:32,217 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:32,222 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:54:32,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,224 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:54:32,224 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:54:32,225 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:54:32,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:32,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:32,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:32,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:32,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:32,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:32,238 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:32,243 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:54:32,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,245 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:54:32,246 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:54:32,247 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:54:32,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:32,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:32,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:32,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:32,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:32,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:32,260 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:32,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:32,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,267 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:54:32,267 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:54:32,268 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:54:32,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:32,278 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:32,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:32,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:32,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:32,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:32,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:32,279 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:32,284 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:54:32,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,286 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:54:32,286 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:54:32,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:54:32,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:32,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:32,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:32,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:32,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:32,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:32,300 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:32,305 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:54:32,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,307 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:54:32,307 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:54:32,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:54:32,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:32,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:32,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:32,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:32,319 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:32,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:32,321 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:32,326 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:54:32,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,329 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:54:32,329 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:54:32,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:54:32,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:32,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:32,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:32,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:32,343 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:32,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:32,351 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:32,359 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:54:32,359 INFO L437 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. [2025-04-26 16:54:32,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:32,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,361 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:54:32,362 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:54:32,363 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:32,380 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:54:32,380 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:32,380 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:32,380 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(cnt, N) = -1*cnt + 1*N Supporting invariants [] [2025-04-26 16:54:32,386 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:54:32,388 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:32,394 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:32,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 16:54:32,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 16:54:32,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:32,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:32,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:32,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:32,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:32,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:32,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:32,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:32,509 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:54:32,510 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:54:32,510 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 159 transitions. cyclomatic complexity: 23 Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (in total 28), 6 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:54:32,561 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 159 transitions. cyclomatic complexity: 23. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (in total 28), 6 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 208 states and 231 transitions. Complement of second has 9 states. [2025-04-26 16:54:32,562 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:54:32,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (in total 28), 6 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:54:32,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2025-04-26 16:54:32,562 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 30 letters. Loop has 8 letters. [2025-04-26 16:54:32,562 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:32,562 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 38 letters. Loop has 8 letters. [2025-04-26 16:54:32,562 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:32,562 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 30 transitions. Stem has 30 letters. Loop has 16 letters. [2025-04-26 16:54:32,563 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:32,563 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 208 states and 231 transitions. [2025-04-26 16:54:32,564 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:32,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 208 states to 171 states and 190 transitions. [2025-04-26 16:54:32,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2025-04-26 16:54:32,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 110 [2025-04-26 16:54:32,564 INFO L74 IsDeterministic]: Start isDeterministic. Operand 171 states and 190 transitions. [2025-04-26 16:54:32,565 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:32,565 INFO L218 hiAutomatonCegarLoop]: Abstraction has 171 states and 190 transitions. [2025-04-26 16:54:32,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 190 transitions. [2025-04-26 16:54:32,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 152. [2025-04-26 16:54:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 152 states have (on average 1.125) internal successors, (in total 171), 151 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have 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:54:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 171 transitions. [2025-04-26 16:54:32,569 INFO L240 hiAutomatonCegarLoop]: Abstraction has 152 states and 171 transitions. [2025-04-26 16:54:32,569 INFO L438 stractBuchiCegarLoop]: Abstraction has 152 states and 171 transitions. [2025-04-26 16:54:32,569 INFO L340 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-04-26 16:54:32,569 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 171 transitions. [2025-04-26 16:54:32,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2025-04-26 16:54:32,569 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:32,569 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:32,572 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:32,572 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:32,572 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]" "[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[]" "[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]" "[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]" "[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:54:32,572 INFO L754 eck$LassoCheckResult]: Loop: "[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]" [2025-04-26 16:54:32,573 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:32,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1611523026, now seen corresponding path program 1 times [2025-04-26 16:54:32,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:32,573 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667181748] [2025-04-26 16:54:32,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:32,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:32,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 16:54:32,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 16:54:32,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:32,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:32,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:32,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667181748] [2025-04-26 16:54:32,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667181748] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:54:32,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491360944] [2025-04-26 16:54:32,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:32,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:54:32,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:32,726 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:54:32,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2025-04-26 16:54:32,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 16:54:32,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 16:54:32,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:32,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:32,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-26 16:54:32,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:33,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:54:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:33,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491360944] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:54:33,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:54:33,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 32 [2025-04-26 16:54:33,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383622435] [2025-04-26 16:54:33,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:54:33,255 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:54:33,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:33,256 INFO L85 PathProgramCache]: Analyzing trace with hash 501272935, now seen corresponding path program 9 times [2025-04-26 16:54:33,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:33,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806045247] [2025-04-26 16:54:33,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:33,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:33,257 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:33,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:33,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:54:33,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,259 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:33,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:33,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:33,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:33,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:33,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:33,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:33,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-26 16:54:33,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2025-04-26 16:54:33,328 INFO L87 Difference]: Start difference. First operand 152 states and 171 transitions. cyclomatic complexity: 27 Second operand has 34 states, 33 states have (on average 2.696969696969697) internal successors, (in total 89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have 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:54:34,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:34,239 INFO L93 Difference]: Finished difference Result 202 states and 224 transitions. [2025-04-26 16:54:34,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 224 transitions. [2025-04-26 16:54:34,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2025-04-26 16:54:34,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 202 states and 224 transitions. [2025-04-26 16:54:34,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 130 [2025-04-26 16:54:34,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2025-04-26 16:54:34,241 INFO L74 IsDeterministic]: Start isDeterministic. Operand 202 states and 224 transitions. [2025-04-26 16:54:34,241 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:34,241 INFO L218 hiAutomatonCegarLoop]: Abstraction has 202 states and 224 transitions. [2025-04-26 16:54:34,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states and 224 transitions. [2025-04-26 16:54:34,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 133. [2025-04-26 16:54:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 133 states have (on average 1.112781954887218) internal successors, (in total 148), 132 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have 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:54:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 148 transitions. [2025-04-26 16:54:34,244 INFO L240 hiAutomatonCegarLoop]: Abstraction has 133 states and 148 transitions. [2025-04-26 16:54:34,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-26 16:54:34,244 INFO L438 stractBuchiCegarLoop]: Abstraction has 133 states and 148 transitions. [2025-04-26 16:54:34,244 INFO L340 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-04-26 16:54:34,244 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 148 transitions. [2025-04-26 16:54:34,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2025-04-26 16:54:34,245 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:34,245 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:34,245 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:34,245 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:34,246 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]" "[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[]" "[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]" "[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]" "[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]" "[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:54:34,246 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:54:34,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:34,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2017454794, now seen corresponding path program 9 times [2025-04-26 16:54:34,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:34,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362936802] [2025-04-26 16:54:34,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:34,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:34,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-04-26 16:54:34,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:54:34,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-26 16:54:34,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,255 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:34,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:54:34,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:54:34,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:34,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:34,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1336743739, now seen corresponding path program 6 times [2025-04-26 16:54:34,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:34,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880007370] [2025-04-26 16:54:34,262 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:54:34,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:34,263 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:34,264 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:34,264 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-26 16:54:34,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:34,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:34,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:34,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:34,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:34,267 INFO L85 PathProgramCache]: Analyzing trace with hash 270412036, now seen corresponding path program 10 times [2025-04-26 16:54:34,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:34,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600502531] [2025-04-26 16:54:34,267 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:54:34,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:34,269 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-26 16:54:34,275 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 16:54:34,277 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:54:34,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,278 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:34,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 16:54:34,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 16:54:34,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:34,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:34,287 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:34,669 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:34,669 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:34,669 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:34,669 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:34,670 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:34,670 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:34,670 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:34,670 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:34,670 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration15_Lasso [2025-04-26 16:54:34,670 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:34,670 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:34,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,836 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:34,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:35,162 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:35,162 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:35,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:35,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:35,164 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:54:35,165 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:54:35,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:54:35,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:35,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:35,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:35,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:35,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:35,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:35,178 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:35,184 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:54:35,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:35,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:35,186 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:54:35,187 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:54:35,187 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:54:35,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:35,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:35,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:35,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:35,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:35,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:35,200 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:35,207 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:54:35,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:35,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:35,209 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:54:35,210 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:54:35,212 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:54:35,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:35,223 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:35,223 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:54:35,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:35,244 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:54:35,245 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:54:35,270 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:35,295 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:54:35,295 INFO L437 ModelExtractionUtils]: 21 out of 36 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:54:35,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:35,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:35,298 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:54:35,300 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:54:35,301 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:35,319 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:54:35,319 INFO L439 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2025-04-26 16:54:35,319 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:35,319 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(workerWithAssertThread1of1ForFork1_steal_num#1, N, cnt) = 2*workerWithAssertThread1of1ForFork1_steal_num#1 + 3*N - 2*cnt Supporting invariants [3*N - 2*cnt >= 0] [2025-04-26 16:54:35,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:35,331 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-04-26 16:54:35,348 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:35,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:54:35,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:54:35,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:35,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:35,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-26 16:54:35,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:35,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:35,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:35,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:35,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:35,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:54:35,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:36,078 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:54:36,079 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.16 stem predicates 4 loop predicates [2025-04-26 16:54:36,079 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 148 transitions. cyclomatic complexity: 21 Second operand has 20 states, 20 states have (on average 2.1) internal successors, (in total 42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:54:36,516 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 148 transitions. cyclomatic complexity: 21. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (in total 42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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 161 states and 178 transitions. Complement of second has 20 states. [2025-04-26 16:54:36,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 9 stem states 4 non-accepting loop states 2 accepting loop states [2025-04-26 16:54:36,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.1) internal successors, (in total 42), 19 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:54:36,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 37 transitions. [2025-04-26 16:54:36,517 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 34 letters. Loop has 8 letters. [2025-04-26 16:54:36,517 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:36,517 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:54:36,529 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:36,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:54:36,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:54:36,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:36,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:36,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-26 16:54:36,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:37,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:37,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:37,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:37,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:37,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:54:37,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:37,113 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:54:37,114 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.15 stem predicates 4 loop predicates [2025-04-26 16:54:37,114 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 148 transitions. cyclomatic complexity: 21 Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (in total 42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:54:37,506 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 148 transitions. cyclomatic complexity: 21. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (in total 42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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 161 states and 178 transitions. Complement of second has 20 states. [2025-04-26 16:54:37,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 9 stem states 4 non-accepting loop states 2 accepting loop states [2025-04-26 16:54:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (in total 42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:54:37,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 37 transitions. [2025-04-26 16:54:37,507 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 15 states and 37 transitions. Stem has 34 letters. Loop has 8 letters. [2025-04-26 16:54:37,507 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:37,507 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:54:37,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:37,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 16:54:37,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 16:54:37,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:37,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:37,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-26 16:54:37,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:37,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:37,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:37,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:37,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:37,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-26 16:54:37,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:37,831 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:54:37,832 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 4 loop predicates [2025-04-26 16:54:37,832 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 133 states and 148 transitions. cyclomatic complexity: 21 Second operand has 12 states, 12 states have (on average 3.5) internal successors, (in total 42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:54:38,659 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 133 states and 148 transitions. cyclomatic complexity: 21. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (in total 42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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 189 states and 209 transitions. Complement of second has 31 states. [2025-04-26 16:54:38,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 13 stem states 4 non-accepting loop states 2 accepting loop states [2025-04-26 16:54:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (in total 42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:54:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 53 transitions. [2025-04-26 16:54:38,661 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 19 states and 53 transitions. Stem has 34 letters. Loop has 8 letters. [2025-04-26 16:54:38,662 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:38,662 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 19 states and 53 transitions. Stem has 42 letters. Loop has 8 letters. [2025-04-26 16:54:38,662 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:38,662 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 19 states and 53 transitions. Stem has 34 letters. Loop has 16 letters. [2025-04-26 16:54:38,662 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:38,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 209 transitions. [2025-04-26 16:54:38,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2025-04-26 16:54:38,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 173 states and 191 transitions. [2025-04-26 16:54:38,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2025-04-26 16:54:38,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2025-04-26 16:54:38,664 INFO L74 IsDeterministic]: Start isDeterministic. Operand 173 states and 191 transitions. [2025-04-26 16:54:38,664 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:38,664 INFO L218 hiAutomatonCegarLoop]: Abstraction has 173 states and 191 transitions. [2025-04-26 16:54:38,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states and 191 transitions. [2025-04-26 16:54:38,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 111. [2025-04-26 16:54:38,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.1261261261261262) internal successors, (in total 125), 110 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have 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:54:38,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2025-04-26 16:54:38,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 125 transitions. [2025-04-26 16:54:38,666 INFO L438 stractBuchiCegarLoop]: Abstraction has 111 states and 125 transitions. [2025-04-26 16:54:38,666 INFO L340 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-04-26 16:54:38,666 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 125 transitions. [2025-04-26 16:54:38,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2025-04-26 16:54:38,667 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:38,667 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:38,667 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:38,667 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:54:38,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]" "[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]" "[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[]" "[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]" "[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]" "[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:54:38,668 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]" "[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]" "[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:54:38,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:38,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1770153072, now seen corresponding path program 11 times [2025-04-26 16:54:38,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:38,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908320584] [2025-04-26 16:54:38,668 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-26 16:54:38,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:38,670 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-26 16:54:38,674 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:38,674 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:54:38,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:38,674 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:38,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:38,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:38,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:38,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:38,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:38,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:38,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1048788331, now seen corresponding path program 1 times [2025-04-26 16:54:38,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:38,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046893830] [2025-04-26 16:54:38,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:38,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:38,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:54:38,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:54:38,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:38,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:38,689 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:38,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:54:38,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:54:38,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:38,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:38,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:38,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:38,695 INFO L85 PathProgramCache]: Analyzing trace with hash 996043012, now seen corresponding path program 12 times [2025-04-26 16:54:38,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:38,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395264022] [2025-04-26 16:54:38,696 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-26 16:54:38,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:38,698 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 42 statements into 4 equivalence classes. [2025-04-26 16:54:38,713 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 16:54:38,713 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-26 16:54:38,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:38,713 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:38,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 16:54:38,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 16:54:38,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:38,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:38,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:39,152 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:39,152 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:39,152 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:39,152 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:39,152 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:39,152 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,152 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:39,152 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:39,152 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration16_Lasso [2025-04-26 16:54:39,152 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:39,152 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:39,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,155 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,386 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,388 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:39,841 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:39,841 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:39,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,843 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:54:39,845 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:54:39,845 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:54:39,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:39,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:39,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:39,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:39,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:39,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:39,858 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:39,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:39,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,865 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:54:39,866 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:54:39,867 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:54:39,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:39,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:39,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:39,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:39,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:39,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:39,880 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:39,886 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:54:39,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,888 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:54:39,889 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:54:39,889 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:54:39,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:39,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:39,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:39,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:39,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:39,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:39,903 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:39,909 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:54:39,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:39,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:39,911 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:54:39,912 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:54:39,913 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:54:39,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:39,923 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 16:54:39,923 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:54:39,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:39,941 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 16:54:39,941 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:54:39,983 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:40,021 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:54:40,022 INFO L437 ModelExtractionUtils]: 35 out of 51 variables were initially zero. Simplification set additionally 13 variables to zero. [2025-04-26 16:54:40,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:40,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:40,024 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:54:40,025 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:54:40,027 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:40,049 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:54:40,049 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:54:40,049 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:40,049 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2025-04-26 16:54:40,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2025-04-26 16:54:40,059 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:40,068 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:40,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:40,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:40,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:40,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:40,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:40,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:54:40,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:54:40,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:40,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:54:40,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:40,289 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:54:40,290 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:54:40,290 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 125 transitions. cyclomatic complexity: 19 Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (in total 38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:54:40,364 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 125 transitions. cyclomatic complexity: 19. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (in total 38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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 225 states and 249 transitions. Complement of second has 11 states. [2025-04-26 16:54:40,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (in total 38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:54:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2025-04-26 16:54:40,365 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 26 letters. Loop has 16 letters. [2025-04-26 16:54:40,365 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:40,365 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:54:40,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:40,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:54:40,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:54:40,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:40,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:40,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:40,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-26 16:54:40,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-26 16:54:40,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:40,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-26 16:54:40,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:40,535 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:54:40,535 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:54:40,535 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 125 transitions. cyclomatic complexity: 19 Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (in total 38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:54:40,669 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 125 transitions. cyclomatic complexity: 19. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (in total 38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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 205 states and 233 transitions. Complement of second has 14 states. [2025-04-26 16:54:40,670 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:54:40,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (in total 38), 7 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:54:40,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2025-04-26 16:54:40,670 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 26 letters. Loop has 16 letters. [2025-04-26 16:54:40,670 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:40,670 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 42 letters. Loop has 16 letters. [2025-04-26 16:54:40,671 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:40,671 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 26 letters. Loop has 32 letters. [2025-04-26 16:54:40,671 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:40,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205 states and 233 transitions. [2025-04-26 16:54:40,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-04-26 16:54:40,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205 states to 171 states and 193 transitions. [2025-04-26 16:54:40,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2025-04-26 16:54:40,673 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-04-26 16:54:40,673 INFO L74 IsDeterministic]: Start isDeterministic. Operand 171 states and 193 transitions. [2025-04-26 16:54:40,673 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:40,673 INFO L218 hiAutomatonCegarLoop]: Abstraction has 171 states and 193 transitions. [2025-04-26 16:54:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states and 193 transitions. [2025-04-26 16:54:40,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 161. [2025-04-26 16:54:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 161 states have (on average 1.1304347826086956) internal successors, (in total 182), 160 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have 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:54:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 182 transitions. [2025-04-26 16:54:40,676 INFO L240 hiAutomatonCegarLoop]: Abstraction has 161 states and 182 transitions. [2025-04-26 16:54:40,676 INFO L438 stractBuchiCegarLoop]: Abstraction has 161 states and 182 transitions. [2025-04-26 16:54:40,676 INFO L340 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-04-26 16:54:40,676 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 161 states and 182 transitions. [2025-04-26 16:54:40,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2025-04-26 16:54:40,676 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:40,676 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:40,677 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:40,677 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:40,677 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]" "[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[]" "[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]" "[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]" "[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]" [2025-04-26 16:54:40,677 INFO L754 eck$LassoCheckResult]: Loop: "[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]" [2025-04-26 16:54:40,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:40,678 INFO L85 PathProgramCache]: Analyzing trace with hash -380735006, now seen corresponding path program 13 times [2025-04-26 16:54:40,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:40,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369103342] [2025-04-26 16:54:40,678 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-26 16:54:40,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:40,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:54:40,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:54:40,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:40,685 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:40,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:54:40,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:54:40,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:40,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:40,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:40,691 INFO L85 PathProgramCache]: Analyzing trace with hash 501272935, now seen corresponding path program 10 times [2025-04-26 16:54:40,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:40,691 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203730161] [2025-04-26 16:54:40,691 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:54:40,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:40,693 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:54:40,694 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:54:40,694 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:54:40,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:40,694 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:40,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:40,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:40,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:40,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:40,697 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:40,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1582551624, now seen corresponding path program 14 times [2025-04-26 16:54:40,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:40,697 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477263773] [2025-04-26 16:54:40,697 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:40,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:40,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-04-26 16:54:40,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-04-26 16:54:40,704 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:54:40,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:40,704 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:40,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-26 16:54:40,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-26 16:54:40,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:40,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:40,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:40,978 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:40,978 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:40,978 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:40,978 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:40,978 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:40,978 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:40,978 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:40,978 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:40,978 INFO L132 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_petrified1_Iteration17_Lasso [2025-04-26 16:54:40,978 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:40,978 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:40,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:41,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:41,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:41,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:41,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:41,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:41,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:41,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:41,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:41,257 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:41,258 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:41,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:41,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:41,259 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:54:41,260 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:54:41,261 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:54:41,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:41,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:41,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:41,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:41,272 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:41,272 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:41,274 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:41,279 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:54:41,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:41,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:41,281 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:54:41,281 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:54:41,282 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:54:41,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:41,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:41,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:41,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:41,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:41,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:41,297 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:41,303 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:54:41,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:41,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:41,305 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:54:41,306 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:54:41,307 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:54:41,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:41,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:41,317 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 16:54:41,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:41,325 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 16:54:41,325 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 16:54:41,346 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:41,372 INFO L436 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-04-26 16:54:41,372 INFO L437 ModelExtractionUtils]: 18 out of 31 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-04-26 16:54:41,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:41,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:41,374 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:54:41,375 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:54:41,376 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:41,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2025-04-26 16:54:41,391 INFO L439 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2025-04-26 16:54:41,392 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:41,392 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(cnt, N) = -1*cnt + 1*N Supporting invariants [] [2025-04-26 16:54:41,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:41,402 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2025-04-26 16:54:41,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:41,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:54:41,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:54:41,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:41,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:41,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:41,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:41,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:41,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:41,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:41,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:41,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:41,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:41,530 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:54:41,531 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:54:41,531 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 161 states and 182 transitions. cyclomatic complexity: 30 Second operand has 5 states, 5 states have (on average 6.0) internal successors, (in total 30), 5 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:54:41,580 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 161 states and 182 transitions. cyclomatic complexity: 30. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (in total 30), 5 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 184 states and 206 transitions. Complement of second has 9 states. [2025-04-26 16:54:41,581 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:54:41,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (in total 30), 5 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:54:41,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2025-04-26 16:54:41,581 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 33 letters. Loop has 8 letters. [2025-04-26 16:54:41,581 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:41,581 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:54:41,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:41,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:54:41,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:54:41,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:41,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:41,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:41,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:41,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:41,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:41,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:41,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:41,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:41,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:41,705 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:54:41,705 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2025-04-26 16:54:41,706 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 161 states and 182 transitions. cyclomatic complexity: 30 Second operand has 5 states, 5 states have (on average 6.0) internal successors, (in total 30), 5 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:54:41,786 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 161 states and 182 transitions. cyclomatic complexity: 30. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (in total 30), 5 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 184 states and 206 transitions. Complement of second has 11 states. [2025-04-26 16:54:41,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:41,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (in total 30), 5 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:54:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2025-04-26 16:54:41,790 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 33 letters. Loop has 8 letters. [2025-04-26 16:54:41,790 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:41,790 INFO L699 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-04-26 16:54:41,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:41,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:54:41,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:54:41,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:41,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:41,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:41,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:41,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:41,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:41,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:41,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:41,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:41,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:41,943 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:54:41,943 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 4 loop predicates [2025-04-26 16:54:41,943 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 161 states and 182 transitions. cyclomatic complexity: 30 Second operand has 5 states, 5 states have (on average 6.0) internal successors, (in total 30), 5 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:54:41,996 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 161 states and 182 transitions. cyclomatic complexity: 30. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (in total 30), 5 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 214 states and 239 transitions. Complement of second has 8 states. [2025-04-26 16:54:41,996 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:54:41,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (in total 30), 5 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:54:41,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2025-04-26 16:54:41,996 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 33 letters. Loop has 8 letters. [2025-04-26 16:54:41,997 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:41,997 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 41 letters. Loop has 8 letters. [2025-04-26 16:54:41,997 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:41,997 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 33 letters. Loop has 16 letters. [2025-04-26 16:54:41,997 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:41,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 239 transitions. [2025-04-26 16:54:41,998 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:41,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 0 states and 0 transitions. [2025-04-26 16:54:41,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:41,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:41,998 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:41,998 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:41,998 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:41,998 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:41,998 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:41,998 INFO L340 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-04-26 16:54:41,998 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:41,998 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:41,998 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:42,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:42,011 INFO L201 PluginConnector]: Adding new model work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:42 BoogieIcfgContainer [2025-04-26 16:54:42,011 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:42,011 INFO L158 Benchmark]: Toolchain (without parser) took 29507.17ms. Allocated memory was 159.4MB in the beginning and 364.9MB in the end (delta: 205.5MB). Free memory was 87.3MB in the beginning and 156.1MB in the end (delta: -68.8MB). Peak memory consumption was 140.7MB. Max. memory is 8.0GB. [2025-04-26 16:54:42,012 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.85ms. Allocated memory is still 159.4MB. Free memory was 88.4MB in the beginning and 88.2MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:42,012 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.46ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 84.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:42,012 INFO L158 Benchmark]: Boogie Preprocessor took 23.72ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 83.9MB in the end (delta: 810.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:42,012 INFO L158 Benchmark]: RCFGBuilder took 224.06ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 70.7MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-26 16:54:42,012 INFO L158 Benchmark]: BuchiAutomizer took 29207.95ms. Allocated memory was 159.4MB in the beginning and 364.9MB in the end (delta: 205.5MB). Free memory was 70.5MB in the beginning and 156.1MB in the end (delta: -85.6MB). Peak memory consumption was 123.9MB. Max. memory is 8.0GB. [2025-04-26 16:54:42,013 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.85ms. Allocated memory is still 159.4MB. Free memory was 88.4MB in the beginning and 88.2MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.46ms. Allocated memory is still 159.4MB. Free memory was 87.3MB in the beginning and 84.9MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.72ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 83.9MB in the end (delta: 810.4kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 224.06ms. Allocated memory is still 159.4MB. Free memory was 83.7MB in the beginning and 70.7MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * BuchiAutomizer took 29207.95ms. Allocated memory was 159.4MB in the beginning and 364.9MB in the end (delta: 205.5MB). Free memory was 70.5MB in the beginning and 156.1MB in the end (delta: -85.6MB). Peak memory consumption was 123.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 29.1s and 18 iterations. TraceHistogramMax:3. Analysis of lassos took 14.1s. Construction of modules took 1.2s. Büchi inclusion checks took 13.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 14. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 429 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [8, 1, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1791 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1782 mSDsluCounter, 2302 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1775 mSDsCounter, 268 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2788 IncrementalHoareTripleChecker+Invalid, 3056 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 268 mSolverCounterUnsat, 527 mSDtfsCounter, 2788 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU4 SILI0 SILT0 lasso13 LassoPreprocessingBenchmarks: Lassos: inital135 mio100 ax100 hnf100 lsp182 ukn40 mio100 lsp91 div100 bol100 ite100 ukn100 eq175 hnf94 smp90 dnf349 smp46 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 96ms VariablesStem: 5 VariablesLoop: 9 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 231, Number of transitions in reduction automaton: 97, Number of states in reduction automaton: 77, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (4 trivial, 9 deterministic, 4 nondeterministic). One deterministic module has affine ranking function N + -1 * cnt and consists of 5 locations. One deterministic module has affine ranking function N + -1 * cnt and consists of 5 locations. One deterministic module has affine ranking function N + -1 * cnt and consists of 5 locations. One deterministic module has affine ranking function -2 * cnt + 3 * N + 2 * num and consists of 11 locations. One deterministic module has affine ranking function -2 * cnt + 3 * N + num * 2 and consists of 15 locations. One deterministic module has affine ranking function -2 * cnt + 3 * N + 2 * num and consists of 15 locations. One deterministic module has affine ranking function -2 * cnt + 3 * N + 2 * num and consists of 19 locations. One deterministic module has affine ranking function N + -1 * cnt and consists of 5 locations. One deterministic module has affine ranking function N + -1 * cnt and consists of 8 locations. One nondeterministic module has affine ranking function -2 * cnt + 3 * N + 2 * num and consists of 20 locations. One nondeterministic module has affine ranking function -2 * cnt + 3 * N + num * 2 and consists of 19 locations. One nondeterministic module has affine ranking function -2 * cnt + 3 * N + num * 2 and consists of 19 locations. One nondeterministic module has affine ranking function N + -1 * cnt and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 34 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:54:42,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2025-04-26 16:54:42,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:42,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:42,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...