/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 true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -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:02:36,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:02:36,827 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:02:36,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:02:36,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:02:36,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:02:36,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:02:36,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:02:36,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:02:36,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:02:36,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:02:36,878 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:02:36,879 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:02:36,880 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:02:36,880 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:02:36,881 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:02:36,881 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:02:36,881 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:02:36,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:02:36,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:02:36,882 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:02:36,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:02:36,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:02:36,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:02:36,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:02:36,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:02:36,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:02:36,885 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:02:36,885 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:02:36,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:02:36,887 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:02:36,887 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:02:36,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:02:36,887 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:02:36,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:02:36,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:02:36,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:02:36,889 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:02:36,889 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 -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 01:02:37,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:02:37,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:02:37,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:02:37,278 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:02:37,279 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:02:37,281 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:02:37,281 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/work-steal2.bpl' [2024-02-10 01:02:37,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:02:37,313 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:02:37,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:02:37,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:02:37,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:02:37,328 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:02:37" (1/1) ... [2024-02-10 01:02:37,335 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:02:37" (1/1) ... [2024-02-10 01:02:37,373 INFO L138 Inliner]: procedures = 4, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2024-02-10 01:02:37,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:02:37,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:02:37,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:02:37,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:02:37,397 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:02:37" (1/1) ... [2024-02-10 01:02:37,397 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:02:37" (1/1) ... [2024-02-10 01:02:37,398 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:02:37" (1/1) ... [2024-02-10 01:02:37,398 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:02:37" (1/1) ... [2024-02-10 01:02:37,400 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:02:37" (1/1) ... [2024-02-10 01:02:37,404 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:02:37" (1/1) ... [2024-02-10 01:02:37,404 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:02:37" (1/1) ... [2024-02-10 01:02:37,405 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:02:37" (1/1) ... [2024-02-10 01:02:37,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:02:37,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:02:37,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:02:37,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:02:37,411 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:02:37" (1/1) ... [2024-02-10 01:02:37,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:37,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:37,454 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:02:37,474 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:02:37,519 INFO L124 BoogieDeclarations]: Specification and implementation of procedure workerWithAssert given in one single declaration [2024-02-10 01:02:37,519 INFO L130 BoogieDeclarations]: Found specification of procedure workerWithAssert [2024-02-10 01:02:37,520 INFO L138 BoogieDeclarations]: Found implementation of procedure workerWithAssert [2024-02-10 01:02:37,520 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:02:37,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:02:37,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:02:37,521 INFO L124 BoogieDeclarations]: Specification and implementation of procedure worker given in one single declaration [2024-02-10 01:02:37,521 INFO L130 BoogieDeclarations]: Found specification of procedure worker [2024-02-10 01:02:37,521 INFO L138 BoogieDeclarations]: Found implementation of procedure worker [2024-02-10 01:02:37,522 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:02:37,579 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:02:37,582 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:02:37,690 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:02:37,735 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:02:37,735 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-10 01:02:37,737 INFO L201 PluginConnector]: Adding new model work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:02:37 BoogieIcfgContainer [2024-02-10 01:02:37,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:02:37,739 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:02:37,739 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:02:37,748 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:02:37,748 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:02:37,749 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:02:37" (1/2) ... [2024-02-10 01:02:37,753 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e54e88d and model type work-steal2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:02:37, skipping insertion in model container [2024-02-10 01:02:37,753 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:02:37,753 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:02:37" (2/2) ... [2024-02-10 01:02:37,754 INFO L332 chiAutomizerObserver]: Analyzing ICFG work-steal2.bpl [2024-02-10 01:02:37,835 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-02-10 01:02:37,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 32 transitions, 72 flow [2024-02-10 01:02:37,887 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-02-10 01:02:37,887 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 01:02:37,893 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:02:37,894 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 32 transitions, 72 flow [2024-02-10 01:02:37,899 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 62 flow [2024-02-10 01:02:37,905 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:02:37,906 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:02:37,906 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:02:37,906 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:02:37,906 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:02:37,906 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:02:37,906 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:02:37,906 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:02:37,907 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 places, 28 transitions, 62 flow [2024-02-10 01:02:37,919 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:37,919 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2024-02-10 01:02:37,919 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 01:02:37,920 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:37,923 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:02:37,923 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 places, 28 transitions, 62 flow [2024-02-10 01:02:37,930 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:37,931 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2024-02-10 01:02:37,931 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-02-10 01:02:37,931 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:37,937 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [91] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[] 39#[L27]true [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 41#[L29]true [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] 43#[L29-1, L38]true [2024-02-10 01:02:37,938 INFO L750 eck$LassoCheckResult]: Loop: 43#[L29-1, L38]true [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] 46#[L39, L29-1]true [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] 48#[L67, L29-1]true [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] 50#[L29-1, L68-1]true [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] 52#[L39-1, L29-1]true [102] L39-1-->L40: Formula: true InVars {} OutVars{workerWithAssertThread1of1ForFork0_steal_delta#1=|v_workerWithAssertThread1of1ForFork0_steal_delta#1_5|} AuxVars[] AssignedVars[workerWithAssertThread1of1ForFork0_steal_delta#1] 54#[L40, L29-1]true [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[] 56#[L29-1, L43]true [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[] 58#[L44, L29-1]true [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] 43#[L29-1, L38]true [2024-02-10 01:02:37,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash 119812, now seen corresponding path program 1 times [2024-02-10 01:02:37,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:37,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100695888] [2024-02-10 01:02:37,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:37,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:38,036 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:38,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:38,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:38,057 INFO L85 PathProgramCache]: Analyzing trace with hash 2033960711, now seen corresponding path program 1 times [2024-02-10 01:02:38,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:38,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45099516] [2024-02-10 01:02:38,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:38,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:38,084 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:38,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:38,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:38,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1358358538, now seen corresponding path program 1 times [2024-02-10 01:02:38,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:38,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579447225] [2024-02-10 01:02:38,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:38,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:38,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:38,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:38,442 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:02:38,449 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:02:38,449 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:02:38,449 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:02:38,449 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:02:38,449 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:38,449 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:02:38,450 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:02:38,450 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:02:38,450 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:02:38,450 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:02:38,472 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:02:38,488 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:02:38,493 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:02:38,727 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:02:38,731 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:02:38,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:38,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:38,736 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:02:38,744 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:02:38,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:02:38,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:38,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:38,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:38,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:38,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:38,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:38,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:38,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-10 01:02:38,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:38,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:38,793 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:02:38,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:02:38,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:38,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:02:38,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:38,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:38,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:38,824 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:02:38,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:02:38,826 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:02:38,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:38,844 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:02:38,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:38,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:38,847 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:02:38,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:02:38,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:38,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:02:38,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:38,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:38,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:38,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:02:38,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:02:38,872 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:02:38,876 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:38,884 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:02:38,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:38,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:38,886 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:02:38,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:02:38,907 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:02:38,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:38,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:02:38,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:38,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:38,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:38,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:02:38,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:02:38,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:38,924 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:02:38,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:38,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:38,926 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:02:38,932 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:02:38,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:02:38,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:38,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:38,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:38,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:39,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:39,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:39,042 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:02:39,070 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-10 01:02:39,071 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 01:02:39,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:39,083 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:02:39,088 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:02:39,096 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:02:39,118 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:02:39,118 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:02:39,119 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt) = 1*N - 1*cnt Supporting invariants [] [2024-02-10 01:02:39,126 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:02:39,130 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:02:39,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:39,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:02:39,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:39,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 01:02:39,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:39,521 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:02:39,567 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:02:39,571 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:02:39,975 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:02:39,977 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:02:39,977 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:02:39,978 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 01:02:40,040 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 01:02:40,041 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:02:40,043 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:02:40,049 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:02:40,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2024-02-10 01:02:40,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 210 transitions. Stem has 3 letters. Loop has 8 letters. [2024-02-10 01:02:40,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:40,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 210 transitions. Stem has 11 letters. Loop has 8 letters. [2024-02-10 01:02:40,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:40,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 210 transitions. Stem has 3 letters. Loop has 16 letters. [2024-02-10 01:02:40,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:40,060 INFO L428 stractBuchiCegarLoop]: Abstraction has has 45 places, 553 transitions, 2314 flow [2024-02-10 01:02:40,060 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:02:40,060 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 places, 553 transitions, 2314 flow [2024-02-10 01:02:40,284 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:40,284 INFO L124 PetriNetUnfolderBase]: 878/1256 cut-off events. [2024-02-10 01:02:40,284 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-02-10 01:02:40,285 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:40,286 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [91] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[] 39#[L27]true [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 41#[L29]true [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] 43#[L29-1, L38]true [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] 148#[L38, L53, ULTIMATE.startFINAL]true [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] 150#[L54, L38, ULTIMATE.startFINAL]true [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] 152#[L67, L38, ULTIMATE.startFINAL]true [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] 154#[L68-1, L38, ULTIMATE.startFINAL]true [2024-02-10 01:02:40,287 INFO L750 eck$LassoCheckResult]: Loop: 154#[L68-1, L38, ULTIMATE.startFINAL]true [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] 157#[L54-1, L38, ULTIMATE.startFINAL]true [114] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1] 159#[L55, L38, ULTIMATE.startFINAL]true [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[] 161#[L58, L38, ULTIMATE.startFINAL]true [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[] 163#[L38, L59, ULTIMATE.startFINAL]true [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] 148#[L38, L53, ULTIMATE.startFINAL]true [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] 150#[L54, L38, ULTIMATE.startFINAL]true [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] 152#[L67, L38, ULTIMATE.startFINAL]true [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] 154#[L68-1, L38, ULTIMATE.startFINAL]true [2024-02-10 01:02:40,288 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:40,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1016450250, now seen corresponding path program 1 times [2024-02-10 01:02:40,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:40,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045658603] [2024-02-10 01:02:40,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:40,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:40,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:40,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:40,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:40,332 INFO L85 PathProgramCache]: Analyzing trace with hash -909521573, now seen corresponding path program 1 times [2024-02-10 01:02:40,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:40,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280285622] [2024-02-10 01:02:40,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:40,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:40,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:40,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:40,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:40,362 INFO L85 PathProgramCache]: Analyzing trace with hash -679740528, now seen corresponding path program 1 times [2024-02-10 01:02:40,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:40,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453851201] [2024-02-10 01:02:40,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:40,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:40,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:40,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:40,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-10 01:02:40,710 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:02:40,711 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:02:40,711 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:02:40,711 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:02:40,711 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:02:40,711 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:40,713 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:02:40,713 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:02:40,713 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:02:40,713 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:02:40,713 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:02:40,718 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:02:40,721 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:02:40,728 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:02:40,731 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:02:40,733 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:02:40,736 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:02:40,738 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:02:40,879 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:02:40,882 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:02:40,884 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:02:41,189 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:02:41,189 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:02:41,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:41,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:41,191 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:02:41,203 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:02:41,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:02:41,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:41,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:02:41,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:41,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:41,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:41,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:02:41,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:02:41,222 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:41,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-02-10 01:02:41,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:41,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:41,234 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:02:41,236 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:02:41,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:02:41,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:41,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:41,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:41,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:41,252 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:41,252 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:41,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:41,272 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:02:41,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:41,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:41,274 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:02:41,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:02:41,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:41,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:41,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:41,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:41,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:41,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:41,306 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:02:41,316 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:41,324 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:02:41,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:41,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:41,326 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:02:41,334 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:02:41,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:02:41,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:41,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:02:41,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:41,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:41,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:41,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:02:41,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:02:41,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:41,367 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:02:41,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:41,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:41,370 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:02:41,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:02:41,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:41,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:02:41,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:41,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:41,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:41,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:02:41,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:02:41,388 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:02:41,395 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:41,402 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:02:41,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:41,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:41,404 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:02:41,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:02:41,420 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:41,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:02:41,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:41,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:41,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:41,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:02:41,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:02:41,423 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:02:41,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:41,442 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:02:41,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:41,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:41,444 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:02:41,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:02:41,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:41,460 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-02-10 01:02:41,460 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-10 01:02:41,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:41,477 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:02:41,488 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2024-02-10 01:02:41,488 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-10 01:02:41,527 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:02:41,578 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-02-10 01:02:41,579 INFO L444 ModelExtractionUtils]: 22 out of 36 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-02-10 01:02:41,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:41,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:41,581 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:02:41,584 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:02:41,593 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:02:41,599 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-10 01:02:41,599 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:02:41,599 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:02:41,604 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:02:41,623 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 01:02:41,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:41,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-10 01:02:41,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:41,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-10 01:02:41,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:41,802 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:02:41,803 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:02:41,804 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:02:42,195 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:02:42,290 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:02:42,290 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:02:42,291 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:02:42,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states and 1318 transitions. [2024-02-10 01:02:42,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1318 transitions. [2024-02-10 01:02:42,308 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 01:02:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states and 1318 transitions. [2024-02-10 01:02:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1318 transitions. [2024-02-10 01:02:43,355 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 01:02:43,355 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:02:43,356 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:02:43,356 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:02:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 427 transitions. [2024-02-10 01:02:43,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 427 transitions. Stem has 7 letters. Loop has 8 letters. [2024-02-10 01:02:43,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:43,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 427 transitions. Stem has 15 letters. Loop has 8 letters. [2024-02-10 01:02:43,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:43,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 427 transitions. Stem has 7 letters. Loop has 16 letters. [2024-02-10 01:02:43,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:02:43,360 INFO L428 stractBuchiCegarLoop]: Abstraction has has 88 places, 30344 transitions, 187248 flow [2024-02-10 01:02:43,360 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:02:43,360 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 88 places, 30344 transitions, 187248 flow [2024-02-10 01:02:45,716 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 01:02:45,717 INFO L124 PetriNetUnfolderBase]: 4634/6161 cut-off events. [2024-02-10 01:02:45,717 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2024-02-10 01:02:45,717 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 01:02:45,720 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [91] $Ultimate##0-->L27: Formula: (= v_cnt_7 0) InVars {cnt=v_cnt_7} OutVars{cnt=v_cnt_7} AuxVars[] AssignedVars[] 39#[L27]true [79] L27-->L29: Formula: (<= 0 v_N_6) InVars {N=v_N_6} OutVars{N=v_N_6} AuxVars[] AssignedVars[] 41#[L29]true [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] 43#[L29-1, L38]true [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] 148#[L38, L53, ULTIMATE.startFINAL]true [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] 150#[L54, L38, ULTIMATE.startFINAL]true [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] 152#[L67, L38, ULTIMATE.startFINAL]true [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] 154#[L68-1, L38, ULTIMATE.startFINAL]true [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] 157#[L54-1, L38, ULTIMATE.startFINAL]true [114] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1] 159#[L55, L38, ULTIMATE.startFINAL]true [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] 315#[L39, L55, ULTIMATE.startFINAL]true [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] 317#[L67, L55, ULTIMATE.startFINAL]true [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[] 319#[L58, L67, ULTIMATE.startFINAL]true [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[] 321#[L67, L59, ULTIMATE.startFINAL]true [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] 323#[L67, L53, ULTIMATE.startFINAL]true [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] 325#[L67, L54, ULTIMATE.startFINAL]true [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] 327#[L54, L68-1, ULTIMATE.startFINAL]true [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] 329#[L67, L68-1, ULTIMATE.startFINAL]true [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] 331#[L68-1, L68-1, ULTIMATE.startFINAL]true [2024-02-10 01:02:45,723 INFO L750 eck$LassoCheckResult]: Loop: 331#[L68-1, L68-1, ULTIMATE.startFINAL]true [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] 334#[L54-1, L68-1, ULTIMATE.startFINAL]true [114] L54-1-->L55: Formula: true InVars {} OutVars{workerThread1of1ForFork1_steal_delta#1=|v_workerThread1of1ForFork1_steal_delta#1_5|} AuxVars[] AssignedVars[workerThread1of1ForFork1_steal_delta#1] 336#[L55, L68-1, ULTIMATE.startFINAL]true [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[] 338#[L58, L68-1, ULTIMATE.startFINAL]true [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[] 340#[L68-1, L59, ULTIMATE.startFINAL]true [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] 342#[L68-1, L53, ULTIMATE.startFINAL]true [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] 327#[L54, L68-1, ULTIMATE.startFINAL]true [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] 329#[L67, L68-1, ULTIMATE.startFINAL]true [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] 331#[L68-1, L68-1, ULTIMATE.startFINAL]true [2024-02-10 01:02:45,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:45,724 INFO L85 PathProgramCache]: Analyzing trace with hash 2146447510, now seen corresponding path program 1 times [2024-02-10 01:02:45,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:45,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068711199] [2024-02-10 01:02:45,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:45,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:45,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:45,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:45,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:45,776 INFO L85 PathProgramCache]: Analyzing trace with hash -909521573, now seen corresponding path program 2 times [2024-02-10 01:02:45,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:45,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508362994] [2024-02-10 01:02:45,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:45,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:45,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:45,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:45,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:45,817 INFO L85 PathProgramCache]: Analyzing trace with hash 2053019888, now seen corresponding path program 2 times [2024-02-10 01:02:45,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:02:45,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755758092] [2024-02-10 01:02:45,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:02:45,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:02:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:45,843 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:02:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:02:45,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:02:46,447 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:02:46,448 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:02:46,448 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:02:46,448 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:02:46,448 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:02:46,448 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:46,448 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:02:46,448 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:02:46,448 INFO L133 ssoRankerPreferences]: Filename of dumped script: work-steal2.bpl_BEv2_Iteration3_Lasso [2024-02-10 01:02:46,448 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:02:46,448 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:02:46,453 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:02:46,456 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:02:46,915 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:02:46,917 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:02:46,920 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:02:46,921 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:02:46,923 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:02:46,925 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:02:47,128 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2024-02-10 01:02:47,502 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:02:47,502 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:02:47,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:47,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:47,506 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:02:47,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:02:47,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:47,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:47,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:47,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:47,524 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:47,524 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:47,527 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:02:47,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:47,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-02-10 01:02:47,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:47,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:47,542 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:02:47,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:02:47,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:47,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:02:47,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:02:47,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:47,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:02:47,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:02:47,566 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:02:47,576 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:02:47,581 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:02:47,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:47,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:47,583 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:02:47,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:02:47,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:02:47,601 INFO L203 nArgumentSynthesizer]: 3 stem disjuncts [2024-02-10 01:02:47,602 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-10 01:02:47,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:02:47,617 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:02:47,643 INFO L401 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2024-02-10 01:02:47,643 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-10 01:02:47,696 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:02:47,772 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2024-02-10 01:02:47,773 INFO L444 ModelExtractionUtils]: 30 out of 46 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-02-10 01:02:47,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:02:47,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:02:47,774 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:02:47,781 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:02:47,789 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:02:47,815 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2024-02-10 01:02:47,815 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:02:47,815 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, cnt, workerThread1of1ForFork1_steal_num#1) = 3*N - 2*cnt + 2*workerThread1of1ForFork1_steal_num#1 Supporting invariants [-2*cnt + 3*N >= 0] [2024-02-10 01:02:47,826 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:02:47,830 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 01:02:47,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:02:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:47,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-10 01:02:47,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:02:48,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-10 01:02:48,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:02:48,336 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:02:48,337 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.9 stem predicates 4 loop predicates [2024-02-10 01:02:48,337 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 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:02:48,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2024-02-10 01:02:48,953 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 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:02:48,954 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:02:48,954 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:02:48,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states and 1318 transitions. [2024-02-10 01:02:48,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1318 transitions. [2024-02-10 01:02:48,958 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 01:02:48,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states and 1318 transitions. [2024-02-10 01:02:48,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1318 transitions. [2024-02-10 01:03:52,148 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 01:03:52,148 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:03:52,149 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:03:52,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 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:03:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 427 transitions. [2024-02-10 01:03:52,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 427 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-10 01:03:52,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:03:52,151 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-10 01:03:52,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:03:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:03:52,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-10 01:03:52,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:03:52,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:03:52,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-10 01:03:52,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:03:52,673 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:03:52,674 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.9 stem predicates 4 loop predicates [2024-02-10 01:03:52,674 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 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:03:53,266 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 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:03:53,267 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:03:53,267 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:03:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states and 1318 transitions. [2024-02-10 01:03:53,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1318 transitions. [2024-02-10 01:03:53,281 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 01:03:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states and 1318 transitions. [2024-02-10 01:03:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1318 transitions. [2024-02-10 01:04:54,315 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 01:04:54,315 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:04:54,318 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:04:54,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 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:04:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 427 transitions. [2024-02-10 01:04:54,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 427 transitions. Stem has 18 letters. Loop has 8 letters. [2024-02-10 01:04:54,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:04:54,320 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-02-10 01:04:54,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:04:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:04:54,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-10 01:04:54,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:04:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:04:54,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 8 conjunts are in the unsatisfiable core [2024-02-10 01:04:54,688 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:04:54,763 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:04:54,763 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.9 stem predicates 4 loop predicates [2024-02-10 01:04:54,764 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 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:04:56,810 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 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 396 states and 16759 transitions.140 powerset states257 rank states. The highest rank that occured is 3 [2024-02-10 01:04:56,810 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:04:56,811 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 01:04:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states and 16759 transitions. [2024-02-10 01:04:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 16759 transitions. [2024-02-10 01:04:56,861 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 01:04:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states and 16759 transitions. [2024-02-10 01:04:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 16759 transitions.