/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/work-steal2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:37:42,703 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:37:42,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 01:37:42,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:37:42,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:37:42,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:37:42,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:37:42,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:37:42,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:37:42,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:37:42,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:37:42,798 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:37:42,798 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:37:42,799 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:37:42,799 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:37:42,799 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:37:42,799 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:37:42,799 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:37:42,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:37:42,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:37:42,800 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:37:42,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:37:42,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:37:42,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:37:42,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:37:42,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:37:42,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:37:42,802 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:37:42,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:37:42,802 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:37:42,803 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:37:42,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:37:42,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:37:42,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:37:42,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:37:42,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:37:42,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:37:42,804 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:37:42,804 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 01:37:43,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:37:43,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:37:43,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:37:43,071 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:37:43,072 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:37:43,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/work-steal2.bpl [2024-02-10 01:37:43,073 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/work-steal2.bpl' [2024-02-10 01:37:43,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:37:43,097 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:37:43,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:37:43,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:37:43,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:37:43,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:43" (1/1) ... [2024-02-10 01:37:43,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:43" (1/1) ... [2024-02-10 01:37:43,158 INFO L138 Inliner]: procedures = 4, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2024-02-10 01:37:43,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:37:43,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:37:43,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:37:43,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:37:43,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:43" (1/1) ... [2024-02-10 01:37:43,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:43" (1/1) ... [2024-02-10 01:37:43,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:43" (1/1) ... [2024-02-10 01:37:43,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:43" (1/1) ... [2024-02-10 01:37:43,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:43" (1/1) ... [2024-02-10 01:37:43,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:43" (1/1) ... [2024-02-10 01:37:43,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:43" (1/1) ... [2024-02-10 01:37:43,208 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:43" (1/1) ... [2024-02-10 01:37:43,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:37:43,214 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:37:43,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:37:43,215 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:37:43,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:43" (1/1) ... [2024-02-10 01:37:43,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:43,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:43,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:43,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 01:37:43,294 INFO L124 BoogieDeclarations]: Specification and implementation of procedure workerWithAssert given in one single declaration [2024-02-10 01:37:43,294 INFO L130 BoogieDeclarations]: Found specification of procedure workerWithAssert [2024-02-10 01:37:43,294 INFO L138 BoogieDeclarations]: Found implementation of procedure workerWithAssert [2024-02-10 01:37:43,294 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:37:43,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:37:43,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:37:43,295 INFO L124 BoogieDeclarations]: Specification and implementation of procedure worker given in one single declaration [2024-02-10 01:37:43,295 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2024-02-10 01:37:43,295 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2024-02-10 01:37:43,295 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:37:43,338 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:37:43,340 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:37:43,437 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:37:43,473 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:37:43,473 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-10 01:37:43,475 INFO L201 PluginConnector]: Adding new model work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:37:43 BoogieIcfgContainer [2024-02-10 01:37:43,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:37:43,476 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:37:43,476 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:37:43,484 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:37:43,485 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:37:43,485 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:43" (1/2) ... [2024-02-10 01:37:43,486 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55b82485 and model type work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:37:43, skipping insertion in model container [2024-02-10 01:37:43,486 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:37:43,486 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:37:43" (2/2) ... [2024-02-10 01:37:43,488 INFO L332 chiAutomizerObserver]: Analyzing ICFG work-steal2.bpl [2024-02-10 01:37:43,549 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-10 01:37:43,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 32 transitions, 72 flow [2024-02-10 01:37:43,591 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-02-10 01:37:43,591 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 01:37:43,595 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 45 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. [2024-02-10 01:37:43,595 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 32 transitions, 72 flow [2024-02-10 01:37:43,598 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 62 flow [2024-02-10 01:37:43,603 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:37:43,603 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:37:43,603 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:37:43,604 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:37:43,611 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:37:43,611 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:37:43,611 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:37:43,611 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:37:43,611 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:37:43,612 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 31 places, 28 transitions, 62 flow [2024-02-10 01:37:43,643 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 234 states, 232 states have (on average 2.663793103448276) internal successors, (618), 233 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:43,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 234 states, 232 states have (on average 2.663793103448276) internal successors, (618), 233 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:43,676 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 216 [2024-02-10 01:37:43,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:37:43,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:37:43,684 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:37:43,685 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:37:43,685 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 31 places, 28 transitions, 62 flow [2024-02-10 01:37:43,700 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 234 states, 232 states have (on average 2.663793103448276) internal successors, (618), 233 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:43,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 234 states, 232 states have (on average 2.663793103448276) internal successors, (618), 233 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:43,719 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 216 [2024-02-10 01:37:43,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:37:43,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:37:43,724 INFO L748 eck$LassoCheckResult]: Stem: Black: 506#[$Ultimate##0]don't care [91] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[] 509#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 511#[L29]don't care [121] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_8|, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_10|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_10|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_sz#1, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] 513#[L29-1, L38]don't care [2024-02-10 01:37:43,725 INFO L750 eck$LassoCheckResult]: Loop: 513#[L29-1, L38]don't care [96] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1] 517#[L29-1, L39]don't care [98] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] 531#[L29-1, L67]don't care [100] L67-->L68-1: Formula: (or (and (= |v_workerWithAssertThread1of1ForFork0_steal_num#1_3| 0) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_4| |v_workerWithAssertThread1of1ForFork0_steal_x#1_3|) (= v_cnt_Out_2 v_cnt_In_1) (<= v_N_In_1 v_cnt_In_1)) (and (= (+ |v_workerWithAssertThread1of1ForFork0_steal_num#1_3| v_cnt_In_1) v_cnt_Out_2) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3| v_cnt_In_1) v_N_In_1) |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3| (+ (* (- 1) v_cnt_In_1) v_N_In_1)) |v_workerWithAssertThread1of1ForFork0_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_4| v_cnt_In_1) (< v_cnt_In_1 v_N_In_1))) InVars {workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_In_1, cnt=v_cnt_In_1, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_3|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_In_1, cnt=v_cnt_Out_2, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] 559#[L29-1, L68-1]don't care [101] L68-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_7| |v_workerWithAssertThread1of1ForFork0_i#1_1|) (= |v_workerWithAssertThread1of1ForFork0_steal_num#1_5| |v_workerWithAssertThread1of1ForFork0_sz#1_1|)) InVars {workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_5|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_5|, workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_1|, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_sz#1, workerWithAssertThread1of1ForFork0_i#1] 597#[L29-1, L39-1]don't care [102] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1] 639#[L29-1, L40]don't care [104] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork0_sz#1_5|) InVars {workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[] 681#[L29-1, L43]don't care [106] L43-->L44: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) (< |v_workerWithAssertThread1of1ForFork0_i#1_5| v_N_5)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[] 727#[L29-1, L44]don't care [107] L44-->L38: Formula: (= v_A_1 (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_7|) 1))) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[A] 513#[L29-1, L38]don't care [2024-02-10 01:37:43,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:43,730 INFO L85 PathProgramCache]: Analyzing trace with hash 119812, now seen corresponding path program 1 times [2024-02-10 01:37:43,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:43,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966775577] [2024-02-10 01:37:43,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:43,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:43,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:43,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:43,845 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:43,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2033960711, now seen corresponding path program 1 times [2024-02-10 01:37:43,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:43,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186137844] [2024-02-10 01:37:43,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:43,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:43,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:43,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:43,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:43,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1358358538, now seen corresponding path program 1 times [2024-02-10 01:37:43,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:43,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170111885] [2024-02-10 01:37:43,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:43,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:43,919 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:43,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:44,139 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:37:44,140 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:37:44,140 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:37:44,140 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:37:44,140 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:37:44,140 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:44,140 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:37:44,140 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:37:44,140 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:37:44,140 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:37:44,141 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:37:44,154 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:44,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:44,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:44,371 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:37:44,374 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:37:44,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:44,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:44,378 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:44,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:44,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:44,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:44,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:44,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:44,402 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:44,402 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:44,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-10 01:37:44,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:44,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-10 01:37:44,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:44,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:44,441 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:44,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-10 01:37:44,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:44,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:44,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:37:44,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:44,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:44,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:44,457 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:37:44,457 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:37:44,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:44,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:44,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:44,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:44,473 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:44,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:44,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:44,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:37:44,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:44,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:44,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:44,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:37:44,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:37:44,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-10 01:37:44,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:44,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:44,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:44,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:44,507 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:44,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-10 01:37:44,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 [2024-02-10 01:37:44,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:44,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:37:44,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:44,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:44,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:44,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:37:44,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:37:44,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:44,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:44,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:44,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:44,548 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:44,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:44,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:44,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:44,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:44,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:44,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-10 01:37:44,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:44,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:44,604 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:37:44,619 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-10 01:37:44,619 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 01:37:44,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:44,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:44,623 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:44,626 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:37:44,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-10 01:37:44,635 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:37:44,635 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:37:44,635 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2024-02-10 01:37:44,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:44,649 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:37:44,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:44,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:37:44,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:44,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 01:37:44,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:37:44,928 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 [2024-02-10 01:37:44,929 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:45,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-02-10 01:37:45,223 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 637 transitions.8 powerset states6 rank states. The highest rank that occured is 1 [2024-02-10 01:37:45,224 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:37:45,225 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:37:45,231 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:37:45,231 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:37:45,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2024-02-10 01:37:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2024-02-10 01:37:45,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 210 transitions. Stem has 3 letters. Loop has 8 letters. [2024-02-10 01:37:45,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:45,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 210 transitions. Stem has 11 letters. Loop has 8 letters. [2024-02-10 01:37:45,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:45,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 210 transitions. Stem has 3 letters. Loop has 16 letters. [2024-02-10 01:37:45,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:45,239 INFO L428 stractBuchiCegarLoop]: Abstraction has has 59 places, 1106 transitions, 4628 flow [2024-02-10 01:37:45,239 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:37:45,239 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:37:45,239 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 59 places, 1106 transitions, 4628 flow [2024-02-10 01:37:45,296 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 881 states, 860 states have (on average 2.9569767441860466) internal successors, (2543), 880 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:45,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 881 states, 860 states have (on average 2.9569767441860466) internal successors, (2543), 880 states have internal predecessors, (2543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:45,311 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 416 [2024-02-10 01:37:45,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:37:45,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:37:45,313 INFO L748 eck$LassoCheckResult]: Stem: Black: 1059#[$Ultimate##0]don't care [91] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[] Black: 1062#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] Black: 1067#[L29]don't care [121] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_8|, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_10|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_10|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_sz#1, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] Black: 1075#[L29-1, L38]don't care [124] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_8|, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_8|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_10|, workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_sz#1, workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_num#1, workerThread1of1ForFork1_steal_delta#1] Black: 1078#[ULTIMATE.startFINAL, L53, L38]don't care [108] L53-->L54: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1] Black: 1098#[ULTIMATE.startFINAL, L54, L38]don't care [110] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_num#1] Black: 1181#[ULTIMATE.startFINAL, L67, L38]don't care [112] L67-->L68-1: Formula: (or (and (< v_cnt_In_3 v_N_In_3) (= (ite (< (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_In_3) v_N_In_3) |v_workerThread1of1ForFork1_steal_delta#1_3| (+ v_N_In_3 (* (- 1) v_cnt_In_3))) |v_workerThread1of1ForFork1_steal_num#1_3|) (= v_cnt_In_3 |v_workerThread1of1ForFork1_steal_x#1_4|) (= (+ |v_workerThread1of1ForFork1_steal_num#1_3| v_cnt_In_3) v_cnt_Out_6)) (and (= v_cnt_Out_6 v_cnt_In_3) (<= v_N_In_3 v_cnt_In_3) (= |v_workerThread1of1ForFork1_steal_x#1_4| |v_workerThread1of1ForFork1_steal_x#1_3|) (= |v_workerThread1of1ForFork1_steal_num#1_3| 0))) InVars {N=v_N_In_3, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_In_3, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} OutVars{workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_3|, N=v_N_In_3, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_Out_6, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_num#1] 1317#[ULTIMATE.startFINAL, L38, L68-1]don't care [2024-02-10 01:37:45,314 INFO L750 eck$LassoCheckResult]: Loop: 1317#[ULTIMATE.startFINAL, L38, L68-1]don't care [113] L68-1-->L54-1: Formula: (and (= |v_workerThread1of1ForFork1_sz#1_1| |v_workerThread1of1ForFork1_steal_num#1_5|) (= |v_workerThread1of1ForFork1_i#1_1| |v_workerThread1of1ForFork1_steal_x#1_7|)) InVars {workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_5|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_7|} OutVars{workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_1|, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_1|, workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_5|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_7|} AuxVars[] AssignedVars[workerThread1of1ForFork1_sz#1, workerThread1of1ForFork1_i#1] Black: 1473#[ULTIMATE.startFINAL, L38, L54-1]don't care [114] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1] 1628#[ULTIMATE.startFINAL, L55, L38]don't care [116] L55-->L58: Formula: (< 0 |v_workerThread1of1ForFork1_sz#1_5|) InVars {workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_5|} OutVars{workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_5|} AuxVars[] AssignedVars[] Black: 1777#[ULTIMATE.startFINAL, L58, L38]don't care [117] L58-->L59: Formula: (and (< |v_workerThread1of1ForFork1_i#1_3| v_N_10) (<= 0 |v_workerThread1of1ForFork1_i#1_3|)) InVars {workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|, N=v_N_10} OutVars{workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_3|, N=v_N_10} AuxVars[] AssignedVars[] 1953#[ULTIMATE.startFINAL, L38, L59]don't care [118] L59-->L53: Formula: (= (store v_A_4 |v_workerThread1of1ForFork1_i#1_5| (+ (select v_A_4 |v_workerThread1of1ForFork1_i#1_5|) 1)) v_A_3) InVars {A=v_A_4, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} OutVars{A=v_A_3, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_5|} AuxVars[] AssignedVars[A] Black: 2221#[ULTIMATE.startFINAL, L53, L38]don't care [108] L53-->L54: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1] 2522#[ULTIMATE.startFINAL, L54, L38]don't care [110] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_num#1] Black: 2747#[ULTIMATE.startFINAL, L67, L38]don't care [112] L67-->L68-1: Formula: (or (and (< v_cnt_In_3 v_N_In_3) (= (ite (< (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_In_3) v_N_In_3) |v_workerThread1of1ForFork1_steal_delta#1_3| (+ v_N_In_3 (* (- 1) v_cnt_In_3))) |v_workerThread1of1ForFork1_steal_num#1_3|) (= v_cnt_In_3 |v_workerThread1of1ForFork1_steal_x#1_4|) (= (+ |v_workerThread1of1ForFork1_steal_num#1_3| v_cnt_In_3) v_cnt_Out_6)) (and (= v_cnt_Out_6 v_cnt_In_3) (<= v_N_In_3 v_cnt_In_3) (= |v_workerThread1of1ForFork1_steal_x#1_4| |v_workerThread1of1ForFork1_steal_x#1_3|) (= |v_workerThread1of1ForFork1_steal_num#1_3| 0))) InVars {N=v_N_In_3, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_In_3, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} OutVars{workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_3|, N=v_N_In_3, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_Out_6, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_num#1] 1317#[ULTIMATE.startFINAL, L38, L68-1]don't care [2024-02-10 01:37:45,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:45,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1016450250, now seen corresponding path program 1 times [2024-02-10 01:37:45,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:45,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491111823] [2024-02-10 01:37:45,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:45,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:45,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:45,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:45,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:45,328 INFO L85 PathProgramCache]: Analyzing trace with hash -909521573, now seen corresponding path program 1 times [2024-02-10 01:37:45,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:45,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310597566] [2024-02-10 01:37:45,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:45,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:45,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:45,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:45,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:45,343 INFO L85 PathProgramCache]: Analyzing trace with hash -679740528, now seen corresponding path program 1 times [2024-02-10 01:37:45,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:45,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52590462] [2024-02-10 01:37:45,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:45,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:45,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:45,365 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:45,571 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:37:45,571 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:37:45,571 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:37:45,571 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:37:45,571 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:37:45,571 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:45,571 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:37:45,571 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:37:45,572 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:37:45,572 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:37:45,572 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:37:45,576 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:45,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:45,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:45,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:45,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:45,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:45,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:45,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:45,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:45,734 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:46,029 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:37:46,029 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:37:46,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:46,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:46,031 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:46,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:46,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:46,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:37:46,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:46,042 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:46,042 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:46,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:37:46,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:37:46,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-10 01:37:46,056 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:46,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:46,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:46,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:46,077 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:46,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:46,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:46,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:46,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:46,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:46,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-10 01:37:46,092 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:46,092 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:46,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:46,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:46,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:46,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:46,111 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:46,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:46,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-10 01:37:46,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:46,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:46,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:46,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:46,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:46,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:46,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:46,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:46,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:46,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:46,168 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:46,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:46,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:46,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:37:46,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:46,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:46,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:46,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:37:46,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:37:46,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-10 01:37:46,196 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:46,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:46,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:46,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:46,204 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:46,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:46,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:46,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:37:46,216 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:46,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:46,216 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:46,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:37:46,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:37:46,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-10 01:37:46,226 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:46,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:46,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:46,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:46,235 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:46,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 01:37:46,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:46,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:46,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:37:46,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:46,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:46,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:46,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:37:46,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:37:46,245 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:46,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:46,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:46,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:46,251 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:46,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 01:37:46,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:46,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:46,261 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-02-10 01:37:46,261 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-10 01:37:46,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:46,282 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2024-02-10 01:37:46,282 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-10 01:37:46,316 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:37:46,353 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-02-10 01:37:46,353 INFO L444 ModelExtractionUtils]: 22 out of 36 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-02-10 01:37:46,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:46,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:46,355 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:46,360 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:37:46,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-10 01:37:46,383 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-10 01:37:46,383 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:37:46,383 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, workerThread1of1ForFork1_steal_num#1, cnt) = 3*N + 2*workerThread1of1ForFork1_steal_num#1 - 2*cnt Supporting invariants [-2*cnt + 3*N >= 0] [2024-02-10 01:37:46,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:46,395 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 01:37:46,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:46,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-10 01:37:46,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:46,468 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-10 01:37:46,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:46,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:37:46,526 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 4 loop predicates [2024-02-10 01:37:46,526 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:46,885 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 1318 transitions.16 powerset states13 rank states. The highest rank that occured is 1 [2024-02-10 01:37:46,885 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:37:46,885 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:37:46,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:47,444 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:37:47,444 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:37:47,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 4 stem states 9 non-accepting loop states 2 accepting loop states [2024-02-10 01:37:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 427 transitions. [2024-02-10 01:37:47,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 427 transitions. Stem has 7 letters. Loop has 8 letters. [2024-02-10 01:37:47,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:47,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 427 transitions. Stem has 15 letters. Loop has 8 letters. [2024-02-10 01:37:47,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:47,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 427 transitions. Stem has 7 letters. Loop has 16 letters. [2024-02-10 01:37:47,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:47,448 INFO L428 stractBuchiCegarLoop]: Abstraction has has 117 places, 91888 transitions, 567108 flow [2024-02-10 01:37:47,448 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:37:47,448 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:37:47,448 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 117 places, 91888 transitions, 567108 flow [2024-02-10 01:37:57,918 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 2863 states, 2766 states have (on average 3.588575560375994) internal successors, (9926), 2862 states have internal predecessors, (9926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:57,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2863 states, 2766 states have (on average 3.588575560375994) internal successors, (9926), 2862 states have internal predecessors, (9926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:57,948 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 416 [2024-02-10 01:37:57,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:37:57,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:37:57,950 INFO L748 eck$LassoCheckResult]: Stem: Black: 3489#[$Ultimate##0]don't care [91] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[] Black: 3492#[L27]don't care [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] Black: 3503#[L29]don't care [121] L29-->L38: Formula: (= v_workerWithAssertThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_thidvar0=v_workerWithAssertThread1of1ForFork0_thidvar0_2, workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_8|, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_10|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_8|, workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_8|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_10|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_thidvar0, workerWithAssertThread1of1ForFork0_sz#1, workerWithAssertThread1of1ForFork0_i#1, workerWithAssertThread1of1ForFork0_steal_delta#1, workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] Black: 3522#[L29-1, L38]don't care [96] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1] Black: 3528#[L29-1, L39]don't care [124] L29-1-->L53: Formula: (and (= 2 v_workerThread1of1ForFork1_thidvar0_2) (= 2 v_workerThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{workerThread1of1ForFork1_sz#1=|v_workerThread1of1ForFork1_sz#1_8|, workerThread1of1ForFork1_i#1=|v_workerThread1of1ForFork1_i#1_8|, workerThread1of1ForFork1_thidvar1=v_workerThread1of1ForFork1_thidvar1_2, workerThread1of1ForFork1_thidvar0=v_workerThread1of1ForFork1_thidvar0_2, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_10|, workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_8|, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_8|} AuxVars[] AssignedVars[workerThread1of1ForFork1_sz#1, workerThread1of1ForFork1_i#1, workerThread1of1ForFork1_thidvar1, workerThread1of1ForFork1_thidvar0, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_num#1, workerThread1of1ForFork1_steal_delta#1] Black: 3561#[L53, ULTIMATE.startFINAL, L39]don't care [108] L53-->L54: Formula: (= |v_workerThread1of1ForFork1_steal_delta#1_1| 1) InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1] Black: 3694#[L54, ULTIMATE.startFINAL, L39]don't care [110] L54-->L67: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_1|, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_1|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_num#1] Black: 3991#[ULTIMATE.startFINAL, L67, L39]don't care [112] L67-->L68-1: Formula: (or (and (< v_cnt_In_3 v_N_In_3) (= (ite (< (+ |v_workerThread1of1ForFork1_steal_delta#1_3| v_cnt_In_3) v_N_In_3) |v_workerThread1of1ForFork1_steal_delta#1_3| (+ v_N_In_3 (* (- 1) v_cnt_In_3))) |v_workerThread1of1ForFork1_steal_num#1_3|) (= v_cnt_In_3 |v_workerThread1of1ForFork1_steal_x#1_4|) (= (+ |v_workerThread1of1ForFork1_steal_num#1_3| v_cnt_In_3) v_cnt_Out_6)) (and (= v_cnt_Out_6 v_cnt_In_3) (<= v_N_In_3 v_cnt_In_3) (= |v_workerThread1of1ForFork1_steal_x#1_4| |v_workerThread1of1ForFork1_steal_x#1_3|) (= |v_workerThread1of1ForFork1_steal_num#1_3| 0))) InVars {N=v_N_In_3, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_In_3, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_3|} OutVars{workerThread1of1ForFork1_steal_num#1=|v_workerThread1of1ForFork1_steal_num#1_3|, N=v_N_In_3, workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_3|, cnt=v_cnt_Out_6, workerThread1of1ForFork1_steal_x#1=|v_workerThread1of1ForFork1_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerThread1of1ForFork1_steal_x#1, workerThread1of1ForFork1_steal_num#1] Black: 4417#[L68-1, ULTIMATE.startFINAL, L39]don't care [98] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] Black: 4829#[L68-1, ULTIMATE.startFINAL, L67]don't care [100] L67-->L68-1: Formula: (or (and (= |v_workerWithAssertThread1of1ForFork0_steal_num#1_3| 0) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_4| |v_workerWithAssertThread1of1ForFork0_steal_x#1_3|) (= v_cnt_Out_2 v_cnt_In_1) (<= v_N_In_1 v_cnt_In_1)) (and (= (+ |v_workerWithAssertThread1of1ForFork0_steal_num#1_3| v_cnt_In_1) v_cnt_Out_2) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3| v_cnt_In_1) v_N_In_1) |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3| (+ (* (- 1) v_cnt_In_1) v_N_In_1)) |v_workerWithAssertThread1of1ForFork0_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_4| v_cnt_In_1) (< v_cnt_In_1 v_N_In_1))) InVars {workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_In_1, cnt=v_cnt_In_1, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_3|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_In_1, cnt=v_cnt_Out_2, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] 5242#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-10 01:37:57,950 INFO L750 eck$LassoCheckResult]: Loop: 5242#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [101] L68-1-->L39-1: Formula: (and (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_7| |v_workerWithAssertThread1of1ForFork0_i#1_1|) (= |v_workerWithAssertThread1of1ForFork0_steal_num#1_5| |v_workerWithAssertThread1of1ForFork0_sz#1_1|)) InVars {workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_5|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_7|} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_5|, workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_1|, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_7|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_sz#1, workerWithAssertThread1of1ForFork0_i#1] Black: 5711#[L68-1, ULTIMATE.startFINAL, L39-1]don't care [102] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1] 6340#[L40, L68-1, ULTIMATE.startFINAL]don't care [104] L40-->L43: Formula: (< 0 |v_workerWithAssertThread1of1ForFork0_sz#1_5|) InVars {workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_5|} OutVars{workerWithAssertThread1of1ForFork0_sz#1=|v_workerWithAssertThread1of1ForFork0_sz#1_5|} AuxVars[] AssignedVars[] Black: 7234#[L68-1, L43, ULTIMATE.startFINAL]don't care [106] L43-->L44: Formula: (and (<= 0 |v_workerWithAssertThread1of1ForFork0_i#1_5|) (< |v_workerWithAssertThread1of1ForFork0_i#1_5| v_N_5)) InVars {workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|, N=v_N_5} OutVars{workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_5|, N=v_N_5} AuxVars[] AssignedVars[] 8129#[L44, L68-1, ULTIMATE.startFINAL]don't care [107] L44-->L38: Formula: (= v_A_1 (store v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_7| (+ (select v_A_2 |v_workerWithAssertThread1of1ForFork0_i#1_7|) 1))) InVars {A=v_A_2, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, workerWithAssertThread1of1ForFork0_i#1=|v_workerWithAssertThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[A] Black: 8963#[L68-1, ULTIMATE.startFINAL, L38]don't care [96] L38-->L39: Formula: (= |v_workerWithAssertThread1of1ForFork0_steal_delta#1_1| 1) InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1] 9794#[L68-1, ULTIMATE.startFINAL, L39]don't care [98] L39-->L67: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_1|, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_1|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] Black: 10409#[L68-1, ULTIMATE.startFINAL, L67]don't care [100] L67-->L68-1: Formula: (or (and (= |v_workerWithAssertThread1of1ForFork0_steal_num#1_3| 0) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_4| |v_workerWithAssertThread1of1ForFork0_steal_x#1_3|) (= v_cnt_Out_2 v_cnt_In_1) (<= v_N_In_1 v_cnt_In_1)) (and (= (+ |v_workerWithAssertThread1of1ForFork0_steal_num#1_3| v_cnt_In_1) v_cnt_Out_2) (= (ite (< (+ |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3| v_cnt_In_1) v_N_In_1) |v_workerWithAssertThread1of1ForFork0_steal_delta#1_3| (+ (* (- 1) v_cnt_In_1) v_N_In_1)) |v_workerWithAssertThread1of1ForFork0_steal_num#1_3|) (= |v_workerWithAssertThread1of1ForFork0_steal_x#1_4| v_cnt_In_1) (< v_cnt_In_1 v_N_In_1))) InVars {workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_In_1, cnt=v_cnt_In_1, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_3|} OutVars{workerWithAssertThread1of1ForFork0_steal_num#1=|v_workerWithAssertThread1of1ForFork0_steal_num#1_3|, workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_3|, N=v_N_In_1, cnt=v_cnt_Out_2, workerWithAssertThread1of1ForFork0_steal_x#1=|v_workerWithAssertThread1of1ForFork0_steal_x#1_4|} AuxVars[] AssignedVars[cnt, workerWithAssertThread1of1ForFork0_steal_num#1, workerWithAssertThread1of1ForFork0_steal_x#1] 5242#[L68-1, ULTIMATE.startFINAL, L68-1]don't care [2024-02-10 01:37:57,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:57,950 INFO L85 PathProgramCache]: Analyzing trace with hash -173989680, now seen corresponding path program 1 times [2024-02-10 01:37:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357018720] [2024-02-10 01:37:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:57,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:57,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:57,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:57,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1532400443, now seen corresponding path program 2 times [2024-02-10 01:37:57,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:57,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538127449] [2024-02-10 01:37:57,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:57,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:57,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:57,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:57,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:57,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1859291894, now seen corresponding path program 1 times [2024-02-10 01:37:57,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:57,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758054977] [2024-02-10 01:37:57,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:57,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:57,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:58,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:58,288 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:37:58,288 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:37:58,288 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:37:58,288 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:37:58,288 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:37:58,288 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:58,288 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:37:58,288 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:37:58,288 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration3_Lasso [2024-02-10 01:37:58,288 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:37:58,289 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:37:58,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:58,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:58,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:58,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:58,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:58,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:58,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:58,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:58,837 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2024-02-10 01:37:59,145 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:37:59,145 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:37:59,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:59,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:59,146 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:59,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-02-10 01:37:59,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:59,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:59,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:37:59,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:59,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:59,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:59,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:37:59,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:37:59,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:59,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-02-10 01:37:59,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:59,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:59,175 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:59,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-02-10 01:37:59,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:59,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:59,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:59,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:59,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:59,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:59,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:59,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:59,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:59,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:59,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:59,213 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:59,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-02-10 01:37:59,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:59,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:59,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:59,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:59,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:59,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:59,224 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:59,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:59,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:59,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:59,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:59,245 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:59,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-02-10 01:37:59,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 [2024-02-10 01:37:59,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:59,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:59,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:59,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:59,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:59,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:59,270 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:59,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-02-10 01:37:59,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:59,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:59,275 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:59,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-02-10 01:37:59,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:59,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:59,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:37:59,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:59,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:59,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:59,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:37:59,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:37:59,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:59,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-02-10 01:37:59,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:59,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:59,302 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:59,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-02-10 01:37:59,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 [2024-02-10 01:37:59,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:59,314 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-10 01:37:59,314 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-10 01:37:59,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:59,333 INFO L401 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2024-02-10 01:37:59,333 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-10 01:37:59,366 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:37:59,399 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-02-10 01:37:59,399 INFO L444 ModelExtractionUtils]: 32 out of 46 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-02-10 01:37:59,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:59,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:59,405 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:59,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-02-10 01:37:59,408 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:37:59,429 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-10 01:37:59,429 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:37:59,429 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerWithAssertThread1of1ForFork0_steal_num#1) = 3*N - 2*cnt + 2*workerWithAssertThread1of1ForFork0_steal_num#1 Supporting invariants [-2*cnt + 3*N >= 0] [2024-02-10 01:37:59,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:59,439 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 01:37:59,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:59,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-10 01:37:59,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:59,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-10 01:37:59,596 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:37:59,653 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 4 loop predicates [2024-02-10 01:37:59,655 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:38:00,141 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 1624 transitions.20 powerset states16 rank states. The highest rank that occured is 1 [2024-02-10 01:38:00,142 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:38:00,142 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:38:02,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0