/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:37:12,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:37:12,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 01:37:12,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:37:12,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:37:12,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:37:12,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:37:12,451 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:37:12,451 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:37:12,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:37:12,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:37:12,453 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:37:12,453 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:37:12,453 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:37:12,454 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:37:12,454 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:37:12,454 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:37:12,454 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:37:12,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:37:12,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:37:12,455 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:37:12,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:37:12,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:37:12,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:37:12,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:37:12,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:37:12,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:37:12,458 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:37:12,458 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:37:12,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:37:12,459 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:37:12,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:37:12,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:37:12,460 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:37:12,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:37:12,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:37:12,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:37:12,462 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:37:12,462 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 01:37:12,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:37:12,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:37:12,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:37:12,844 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:37:12,846 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:37:12,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl [2024-02-10 01:37:12,849 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl' [2024-02-10 01:37:12,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:37:12,890 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:37:12,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:37:12,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:37:12,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:37:12,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:12" (1/1) ... [2024-02-10 01:37:12,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:12" (1/1) ... [2024-02-10 01:37:12,930 INFO L138 Inliner]: procedures = 3, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:37:12,933 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:37:12,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:37:12,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:37:12,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:37:12,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:12" (1/1) ... [2024-02-10 01:37:12,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:12" (1/1) ... [2024-02-10 01:37:12,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:12" (1/1) ... [2024-02-10 01:37:12,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:12" (1/1) ... [2024-02-10 01:37:12,950 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:12" (1/1) ... [2024-02-10 01:37:12,955 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:12" (1/1) ... [2024-02-10 01:37:12,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:12" (1/1) ... [2024-02-10 01:37:12,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:12" (1/1) ... [2024-02-10 01:37:12,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:37:12,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:37:12,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:37:12,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:37:12,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:12" (1/1) ... [2024-02-10 01:37:12,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:12,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:13,002 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:13,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 01:37:13,055 INFO L124 BoogieDeclarations]: Specification and implementation of procedure reader given in one single declaration [2024-02-10 01:37:13,055 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-02-10 01:37:13,056 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-02-10 01:37:13,056 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:37:13,056 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:37:13,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:37:13,056 INFO L124 BoogieDeclarations]: Specification and implementation of procedure writer given in one single declaration [2024-02-10 01:37:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-02-10 01:37:13,057 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-02-10 01:37:13,058 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:37:13,116 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:37:13,118 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:37:13,253 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:37:13,260 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:37:13,260 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 01:37:13,262 INFO L201 PluginConnector]: Adding new model optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:37:13 BoogieIcfgContainer [2024-02-10 01:37:13,263 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:37:13,264 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:37:13,264 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:37:13,281 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:37:13,282 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:37:13,282 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:12" (1/2) ... [2024-02-10 01:37:13,288 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63c44a67 and model type optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:37:13, skipping insertion in model container [2024-02-10 01:37:13,288 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:37:13,289 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:37:13" (2/2) ... [2024-02-10 01:37:13,290 INFO L332 chiAutomizerObserver]: Analyzing ICFG optimistic-concurrency2.bpl [2024-02-10 01:37:13,363 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-02-10 01:37:13,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 113 flow [2024-02-10 01:37:13,433 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2024-02-10 01:37:13,434 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-10 01:37:13,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 4/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-02-10 01:37:13,440 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 113 flow [2024-02-10 01:37:13,446 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 88 flow [2024-02-10 01:37:13,456 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:37:13,457 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:37:13,457 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:37:13,457 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:37:13,457 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:37:13,457 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:37:13,458 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:37:13,458 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:37:13,458 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:37:13,459 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 41 places, 35 transitions, 88 flow [2024-02-10 01:37:13,477 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 95 states, 93 states have (on average 1.903225806451613) internal successors, (177), 94 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:13,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 95 states, 93 states have (on average 1.903225806451613) internal successors, (177), 94 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:13,500 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 60 [2024-02-10 01:37:13,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:37:13,500 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:37:13,504 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:37:13,504 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:37:13,504 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 41 places, 35 transitions, 88 flow [2024-02-10 01:37:13,512 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 95 states, 93 states have (on average 1.903225806451613) internal successors, (177), 94 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:13,513 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 95 states, 93 states have (on average 1.903225806451613) internal successors, (177), 94 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:13,518 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 60 [2024-02-10 01:37:13,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:37:13,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:37:13,524 INFO L748 eck$LassoCheckResult]: Stem: Black: 239#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_2) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] 242#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_3) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] 244#[L59]don't care [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] 246#[L59-1, $Ultimate##0]don't care [82] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork1_start_1 v_writerThread1of1ForFork1_j_1) InVars {writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_1, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] 250#[L41-1, L59-1]don't care [2024-02-10 01:37:13,525 INFO L750 eck$LassoCheckResult]: Loop: 250#[L41-1, L59-1]don't care [84] L41-1-->L42: Formula: (< v_writerThread1of1ForFork1_j_5 v_writerThread1of1ForFork1_end_3) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_5, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_3} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_5, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_3} AuxVars[] AssignedVars[] 258#[L42, L59-1]don't care [87] L42-->L43: Formula: (and (<= 0 v_writerThread1of1ForFork1_j_9) (<= v_writerThread1of1ForFork1_j_9 v_N_5)) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_9, N=v_N_5} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_9, N=v_N_5} AuxVars[] AssignedVars[] 270#[L59-1, L43]don't care [88] L43-->L44: Formula: (= (store v_A_3 v_writerThread1of1ForFork1_j_11 0) v_A_2) InVars {A=v_A_3, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_11} OutVars{A=v_A_2, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_11} AuxVars[] AssignedVars[A] 290#[L44, L59-1]don't care [89] L44-->L41-1: Formula: (= v_writerThread1of1ForFork1_j_14 (+ v_writerThread1of1ForFork1_j_13 1)) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_13} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_14} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] 250#[L41-1, L59-1]don't care [2024-02-10 01:37:13,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:13,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2842782, now seen corresponding path program 1 times [2024-02-10 01:37:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:13,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468916778] [2024-02-10 01:37:13,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:13,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:13,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:13,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:13,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:13,643 INFO L85 PathProgramCache]: Analyzing trace with hash 3512389, now seen corresponding path program 1 times [2024-02-10 01:37:13,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:13,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657029678] [2024-02-10 01:37:13,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:13,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:13,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:13,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:13,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:13,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1146446434, now seen corresponding path program 1 times [2024-02-10 01:37:13,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:13,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019594200] [2024-02-10 01:37:13,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:13,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:13,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:13,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:13,892 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:37:13,893 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:37:13,893 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:37:13,893 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:37:13,893 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:37:13,894 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:13,894 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:37:13,894 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:37:13,894 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:37:13,894 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:37:13,894 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:37:13,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:13,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:13,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:14,065 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:37:14,069 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:37:14,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:14,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:14,076 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:14,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:14,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-10 01:37:14,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:14,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:14,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:14,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:14,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:14,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:14,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:14,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-10 01:37:14,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:14,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:14,121 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:14,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-10 01:37:14,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:14,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:14,131 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:37:14,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:14,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:14,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:14,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:37:14,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:37:14,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:14,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:14,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:14,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:14,158 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:14,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-10 01:37:14,161 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:14,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:14,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:14,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:14,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:14,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:14,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:14,216 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:37:14,259 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-02-10 01:37:14,259 INFO L444 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-02-10 01:37:14,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:14,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:14,263 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:14,267 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:37:14,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-10 01:37:14,285 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:37:14,286 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:37:14,287 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(writerThread1of1ForFork1_j, writerThread1of1ForFork1_end) = -1*writerThread1of1ForFork1_j + 1*writerThread1of1ForFork1_end Supporting invariants [] [2024-02-10 01:37:14,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:14,299 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:37:14,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:14,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:37:14,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:14,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:37:14,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:37:14,455 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-10 01:37:14,456 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:14,634 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 9 states and 543 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:37:14,635 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:37:14,636 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:37:14,645 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:37:14,645 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:37:14,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:37:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 209 transitions. [2024-02-10 01:37:14,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 4 letters. Loop has 4 letters. [2024-02-10 01:37:14,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:14,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 8 letters. Loop has 4 letters. [2024-02-10 01:37:14,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:14,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 4 letters. Loop has 8 letters. [2024-02-10 01:37:14,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:14,664 INFO L428 stractBuchiCegarLoop]: Abstraction has has 59 places, 878 transitions, 3950 flow [2024-02-10 01:37:14,664 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:37:14,664 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:37:14,665 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 59 places, 878 transitions, 3950 flow [2024-02-10 01:37:14,716 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 285 states, 275 states have (on average 2.4909090909090907) internal successors, (685), 284 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:14,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 285 states, 275 states have (on average 2.4909090909090907) internal successors, (685), 284 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:14,734 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 80 [2024-02-10 01:37:14,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:37:14,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:37:14,737 INFO L748 eck$LassoCheckResult]: Stem: Black: 488#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_2) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] Black: 491#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_3) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] Black: 496#[L59]don't care [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] Black: 504#[L59-1, $Ultimate##0]don't care [98] L59-1-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_2 2) (= v_readerThread1of1ForFork2_start_4 v_ULTIMATE.start_min2_7) (= v_readerThread1of1ForFork2_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork2_thidvar0_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_16, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_2, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_2, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i, readerThread1of1ForFork2_thidvar0, readerThread1of1ForFork2_start, readerThread1of1ForFork2_thidvar1, readerThread1of1ForFork2_end] Black: 512#[$Ultimate##0, L60, $Ultimate##0]don't care [74] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork2_sum_1 0) InVars {} OutVars{readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] Black: 526#[$Ultimate##0, L27, L60]don't care [75] L27-->L28-1: Formula: (= v_readerThread1of1ForFork2_start_1 v_readerThread1of1ForFork2_i_1) InVars {readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1} OutVars{readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] 567#[$Ultimate##0, L28-1, L60]don't care [2024-02-10 01:37:14,737 INFO L750 eck$LassoCheckResult]: Loop: 567#[$Ultimate##0, L28-1, L60]don't care [77] L28-1-->L29: Formula: (< v_readerThread1of1ForFork2_i_5 v_readerThread1of1ForFork2_end_3) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_5, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_3} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_5, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_3} AuxVars[] AssignedVars[] Black: 672#[$Ultimate##0, L29, L60]don't care [79] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork2_i_7 v_N_1) (<= 0 v_readerThread1of1ForFork2_i_7)) InVars {N=v_N_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_7} OutVars{N=v_N_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_7} AuxVars[] AssignedVars[] 769#[$Ultimate##0, L30, L60]don't care [80] L30-->L31: Formula: (= v_readerThread1of1ForFork2_sum_4 (+ v_readerThread1of1ForFork2_sum_3 (select v_A_1 v_readerThread1of1ForFork2_i_9))) InVars {A=v_A_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_9, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_9, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] Black: 876#[$Ultimate##0, L31, L60]don't care [81] L31-->L28-1: Formula: (= v_readerThread1of1ForFork2_i_12 (+ v_readerThread1of1ForFork2_i_11 1)) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_11} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_12} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] 567#[$Ultimate##0, L28-1, L60]don't care [2024-02-10 01:37:14,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:14,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1563036049, now seen corresponding path program 1 times [2024-02-10 01:37:14,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:14,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550014088] [2024-02-10 01:37:14,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:14,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:14,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:14,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:14,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:14,758 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 1 times [2024-02-10 01:37:14,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:14,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153528672] [2024-02-10 01:37:14,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:14,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:14,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:14,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:14,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:14,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1054123502, now seen corresponding path program 1 times [2024-02-10 01:37:14,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:14,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190901882] [2024-02-10 01:37:14,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:14,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:14,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:14,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:14,947 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:37:14,947 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:37:14,948 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:37:14,948 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:37:14,948 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:37:14,948 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:14,948 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:37:14,949 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:37:14,949 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:37:14,949 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:37:14,949 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:37:14,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:14,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:14,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:14,984 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:14,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:14,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:15,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:15,143 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:37:15,143 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:37:15,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:15,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:15,145 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:15,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:15,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:15,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:15,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:15,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:15,165 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:15,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:15,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-10 01:37:15,180 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:15,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:15,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:15,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:15,193 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:15,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:15,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:15,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:15,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:15,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:15,222 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:15,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:15,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-10 01:37:15,242 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:37:15,260 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-02-10 01:37:15,260 INFO L444 ModelExtractionUtils]: 17 out of 28 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-02-10 01:37:15,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:15,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:15,265 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:15,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-10 01:37:15,273 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:37:15,291 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:37:15,291 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:37:15,291 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(readerThread1of1ForFork2_i, readerThread1of1ForFork2_end) = -1*readerThread1of1ForFork2_i + 1*readerThread1of1ForFork2_end Supporting invariants [] [2024-02-10 01:37:15,299 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:37:15,301 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:37:15,317 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:15,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:37:15,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:15,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:37:15,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:37:15,387 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-10 01:37:15,387 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:15,499 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 9 states and 543 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:37:15,499 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:37:15,499 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:37:15,640 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:37:15,640 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:37:15,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:37:15,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 209 transitions. [2024-02-10 01:37:15,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 6 letters. Loop has 4 letters. [2024-02-10 01:37:15,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:15,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 10 letters. Loop has 4 letters. [2024-02-10 01:37:15,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:15,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 6 letters. Loop has 8 letters. [2024-02-10 01:37:15,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:15,645 INFO L428 stractBuchiCegarLoop]: Abstraction has has 77 places, 21996 transitions, 142584 flow [2024-02-10 01:37:15,645 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:37:15,645 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:37:15,646 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 77 places, 21996 transitions, 142584 flow [2024-02-10 01:37:16,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:17,016 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 739 states, 675 states have (on average 3.3066666666666666) internal successors, (2232), 738 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:17,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 739 states, 675 states have (on average 3.3066666666666666) internal successors, (2232), 738 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:17,040 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-02-10 01:37:17,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:37:17,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:37:17,041 INFO L748 eck$LassoCheckResult]: Stem: Black: 1314#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_2) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] Black: 1317#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_3) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] Black: 1328#[L59]don't care [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] Black: 1347#[L59-1, $Ultimate##0]don't care [82] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork1_start_1 v_writerThread1of1ForFork1_j_1) InVars {writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_1, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] Black: 1369#[L59-1, L41-1]don't care [98] L59-1-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_2 2) (= v_readerThread1of1ForFork2_start_4 v_ULTIMATE.start_min2_7) (= v_readerThread1of1ForFork2_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork2_thidvar0_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_16, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_2, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_2, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i, readerThread1of1ForFork2_thidvar0, readerThread1of1ForFork2_start, readerThread1of1ForFork2_thidvar1, readerThread1of1ForFork2_end] Black: 1425#[$Ultimate##0, L60, L41-1]don't care [83] L41-1-->writerFINAL: Formula: (<= v_writerThread1of1ForFork1_end_1 v_writerThread1of1ForFork1_j_3) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_3, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_3, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_1} AuxVars[] AssignedVars[] Black: 1485#[writerFINAL, $Ultimate##0, L60]don't care [85] writerFINAL-->writerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] Black: 1593#[writerEXIT, $Ultimate##0, L60]don't care [99] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork1_thidvar0_4 1) InVars {writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} OutVars{writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] Black: 1788#[L61, $Ultimate##0]don't care [74] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork2_sum_1 0) InVars {} OutVars{readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] Black: 2020#[L27, L61]don't care [75] L27-->L28-1: Formula: (= v_readerThread1of1ForFork2_start_1 v_readerThread1of1ForFork2_i_1) InVars {readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1} OutVars{readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] Black: 2323#[L61, L28-1]don't care [76] L28-1-->readerFINAL: Formula: (<= v_readerThread1of1ForFork2_end_1 v_readerThread1of1ForFork2_i_3) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_3, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_1} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_3, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_1} AuxVars[] AssignedVars[] Black: 2633#[readerFINAL, L61]don't care [78] readerFINAL-->readerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] Black: 2902#[readerEXIT, L61]don't care [100] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_4 2) (= v_readerThread1of1ForFork2_thidvar0_4 2) (= v_readerThread1of1ForFork2_sum_10 v_ULTIMATE.start_sum_2)) InVars {readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] 3054#[L62]don't care [61] L62-->L67: Formula: (and (<= v_ULTIMATE.start_min2_1 v_ULTIMATE.start_max1_1) (<= v_ULTIMATE.start_min1_1 v_ULTIMATE.start_max2_1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_1, ULTIMATE.start_max2=v_ULTIMATE.start_max2_1, ULTIMATE.start_min1=v_ULTIMATE.start_min1_1, ULTIMATE.start_min2=v_ULTIMATE.start_min2_1} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_1, ULTIMATE.start_max2=v_ULTIMATE.start_max2_1, ULTIMATE.start_min1=v_ULTIMATE.start_min1_1, ULTIMATE.start_min2=v_ULTIMATE.start_min2_1} AuxVars[] AssignedVars[] Black: 3143#[L67]don't care [92] L67-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_2 2) (= v_readerThread1of1ForFork0_thidvar1_2 2) (= v_readerThread1of1ForFork0_start_4 v_ULTIMATE.start_min2_5) (= v_readerThread1of1ForFork0_end_6 v_ULTIMATE.start_max2_5)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_4, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_8, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_16, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork0_start, readerThread1of1ForFork0_sum, readerThread1of1ForFork0_i, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_end] 3164#[L67-1, $Ultimate##0]don't care [66] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork0_sum_1 0) InVars {} OutVars{readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum] Black: 3215#[L27, L67-1]don't care [67] L27-->L28-1: Formula: (= v_readerThread1of1ForFork0_start_1 v_readerThread1of1ForFork0_i_1) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_1, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_i] 3230#[L28-1, L67-1]don't care [2024-02-10 01:37:17,042 INFO L750 eck$LassoCheckResult]: Loop: 3230#[L28-1, L67-1]don't care [69] L28-1-->L29: Formula: (< v_readerThread1of1ForFork0_i_5 v_readerThread1of1ForFork0_end_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} AuxVars[] AssignedVars[] Black: 3278#[L29, L67-1]don't care [71] L29-->L30: Formula: (and (<= 0 v_readerThread1of1ForFork0_i_7) (<= v_readerThread1of1ForFork0_i_7 v_N_1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_7, N=v_N_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_7, N=v_N_1} AuxVars[] AssignedVars[] 3309#[L30, L67-1]don't care [72] L30-->L31: Formula: (= (+ (select v_A_1 v_readerThread1of1ForFork0_i_9) v_readerThread1of1ForFork0_sum_3) v_readerThread1of1ForFork0_sum_4) InVars {A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum] Black: 3336#[L31, L67-1]don't care [73] L31-->L28-1: Formula: (= v_readerThread1of1ForFork0_i_12 (+ v_readerThread1of1ForFork0_i_11 1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_12} AuxVars[] AssignedVars[readerThread1of1ForFork0_i] 3230#[L28-1, L67-1]don't care [2024-02-10 01:37:17,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1357094300, now seen corresponding path program 1 times [2024-02-10 01:37:17,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:17,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51188857] [2024-02-10 01:37:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:17,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:17,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:17,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:17,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:17,062 INFO L85 PathProgramCache]: Analyzing trace with hash 3049636, now seen corresponding path program 1 times [2024-02-10 01:37:17,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:17,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510968810] [2024-02-10 01:37:17,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:17,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:17,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:17,073 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:17,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:17,073 INFO L85 PathProgramCache]: Analyzing trace with hash 733806983, now seen corresponding path program 1 times [2024-02-10 01:37:17,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:17,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132286655] [2024-02-10 01:37:17,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:17,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:17,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:37:17,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 01:37:17,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132286655] [2024-02-10 01:37:17,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132286655] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 01:37:17,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 01:37:17,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-10 01:37:17,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593279300] [2024-02-10 01:37:17,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 01:37:17,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 01:37:17,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-10 01:37:17,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-02-10 01:37:17,952 INFO L175 Difference]: Start difference. First operand has 77 places, 21996 transitions, 142584 flow. Second operand 15 states and 645 transitions. [2024-02-10 01:37:17,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 21996 transitions, 142584 flow. Second operand 15 states and 645 transitions. [2024-02-10 01:37:17,955 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 43 [2024-02-10 01:37:17,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 01:37:19,842 INFO L124 PetriNetUnfolderBase]: 2596/3881 cut-off events. [2024-02-10 01:37:19,842 INFO L125 PetriNetUnfolderBase]: For 581/581 co-relation queries the response was YES. [2024-02-10 01:37:19,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13173 conditions, 3881 events. 2596/3881 cut-off events. For 581/581 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 17522 event pairs, 0 based on Foata normal form. 0/1641 useless extension candidates. Maximal degree in co-relation 12228. Up to 929 conditions per place. [2024-02-10 01:37:19,904 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 244 selfloop transitions, 174 changer transitions 27/1179 dead transitions. [2024-02-10 01:37:19,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 1179 transitions, 8410 flow [2024-02-10 01:37:19,917 INFO L231 Difference]: Finished difference. Result has 96 places, 1094 transitions, 7945 flow [2024-02-10 01:37:19,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-10 01:37:19,919 INFO L428 stractBuchiCegarLoop]: Abstraction has has 96 places, 1094 transitions, 7945 flow [2024-02-10 01:37:19,919 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 01:37:19,919 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:37:19,919 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 96 places, 1094 transitions, 7945 flow [2024-02-10 01:37:20,119 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1240 states, 1128 states have (on average 3.38031914893617) internal successors, (3813), 1239 states have internal predecessors, (3813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:20,121 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1240 states, 1128 states have (on average 3.38031914893617) internal successors, (3813), 1239 states have internal predecessors, (3813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:20,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-02-10 01:37:20,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:37:20,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:37:20,144 INFO L748 eck$LassoCheckResult]: Stem: Black: 3403#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_2) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] Black: 3406#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_3) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] Black: 3417#[L59]don't care [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] Black: 3436#[L59-1, $Ultimate##0]don't care [82] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork1_start_1 v_writerThread1of1ForFork1_j_1) InVars {writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_1, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] Black: 3458#[L41-1, L59-1]don't care [98] L59-1-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_2 2) (= v_readerThread1of1ForFork2_start_4 v_ULTIMATE.start_min2_7) (= v_readerThread1of1ForFork2_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork2_thidvar0_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_16, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_2, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_2, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i, readerThread1of1ForFork2_thidvar0, readerThread1of1ForFork2_start, readerThread1of1ForFork2_thidvar1, readerThread1of1ForFork2_end] Black: 3505#[$Ultimate##0, L41-1, L60]don't care [83] L41-1-->writerFINAL: Formula: (<= v_writerThread1of1ForFork1_end_1 v_writerThread1of1ForFork1_j_3) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_3, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_3, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_1} AuxVars[] AssignedVars[] Black: 3549#[$Ultimate##0, L60, writerFINAL]don't care [85] writerFINAL-->writerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] Black: 3670#[$Ultimate##0, L60, writerEXIT]don't care [99] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork1_thidvar0_4 1) InVars {writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} OutVars{writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] Black: 3850#[$Ultimate##0, L61]don't care [74] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork2_sum_1 0) InVars {} OutVars{readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] Black: 4079#[L61, L27]don't care [75] L27-->L28-1: Formula: (= v_readerThread1of1ForFork2_start_1 v_readerThread1of1ForFork2_i_1) InVars {readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1} OutVars{readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] Black: 4373#[L61, L28-1]don't care [77] L28-1-->L29: Formula: (< v_readerThread1of1ForFork2_i_5 v_readerThread1of1ForFork2_end_3) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_5, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_3} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_5, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_3} AuxVars[] AssignedVars[] Black: 4703#[L29, L61]don't care [79] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork2_i_7 v_N_1) (<= 0 v_readerThread1of1ForFork2_i_7)) InVars {N=v_N_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_7} OutVars{N=v_N_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_7} AuxVars[] AssignedVars[] Black: 5022#[L30, L61]don't care [80] L30-->L31: Formula: (= v_readerThread1of1ForFork2_sum_4 (+ v_readerThread1of1ForFork2_sum_3 (select v_A_1 v_readerThread1of1ForFork2_i_9))) InVars {A=v_A_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_9, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_9, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] Black: 5302#[L31, L61]don't care [81] L31-->L28-1: Formula: (= v_readerThread1of1ForFork2_i_12 (+ v_readerThread1of1ForFork2_i_11 1)) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_11} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_12} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] Black: 5640#[L61, L28-1]don't care [76] L28-1-->readerFINAL: Formula: (<= v_readerThread1of1ForFork2_end_1 v_readerThread1of1ForFork2_i_3) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_3, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_1} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_3, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_1} AuxVars[] AssignedVars[] 5979#[readerFINAL, L61]don't care [78] readerFINAL-->readerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] Black: 6267#[L61, readerEXIT]don't care [100] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_4 2) (= v_readerThread1of1ForFork2_thidvar0_4 2) (= v_readerThread1of1ForFork2_sum_10 v_ULTIMATE.start_sum_2)) InVars {readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] 6441#[L62]don't care [61] L62-->L67: Formula: (and (<= v_ULTIMATE.start_min2_1 v_ULTIMATE.start_max1_1) (<= v_ULTIMATE.start_min1_1 v_ULTIMATE.start_max2_1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_1, ULTIMATE.start_max2=v_ULTIMATE.start_max2_1, ULTIMATE.start_min1=v_ULTIMATE.start_min1_1, ULTIMATE.start_min2=v_ULTIMATE.start_min2_1} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_1, ULTIMATE.start_max2=v_ULTIMATE.start_max2_1, ULTIMATE.start_min1=v_ULTIMATE.start_min1_1, ULTIMATE.start_min2=v_ULTIMATE.start_min2_1} AuxVars[] AssignedVars[] Black: 6536#[L67]don't care [92] L67-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_2 2) (= v_readerThread1of1ForFork0_thidvar1_2 2) (= v_readerThread1of1ForFork0_start_4 v_ULTIMATE.start_min2_5) (= v_readerThread1of1ForFork0_end_6 v_ULTIMATE.start_max2_5)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_4, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_8, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_16, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork0_start, readerThread1of1ForFork0_sum, readerThread1of1ForFork0_i, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_end] 6592#[L67-1, $Ultimate##0]don't care [66] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork0_sum_1 0) InVars {} OutVars{readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum] Black: 6639#[L27, L67-1]don't care [67] L27-->L28-1: Formula: (= v_readerThread1of1ForFork0_start_1 v_readerThread1of1ForFork0_i_1) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_1, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_i] 6663#[L67-1, L28-1]don't care [2024-02-10 01:37:20,144 INFO L750 eck$LassoCheckResult]: Loop: 6663#[L67-1, L28-1]don't care [69] L28-1-->L29: Formula: (< v_readerThread1of1ForFork0_i_5 v_readerThread1of1ForFork0_end_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} AuxVars[] AssignedVars[] Black: 6692#[L29, L67-1]don't care [71] L29-->L30: Formula: (and (<= 0 v_readerThread1of1ForFork0_i_7) (<= v_readerThread1of1ForFork0_i_7 v_N_1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_7, N=v_N_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_7, N=v_N_1} AuxVars[] AssignedVars[] 6729#[L30, L67-1]don't care [72] L30-->L31: Formula: (= (+ (select v_A_1 v_readerThread1of1ForFork0_i_9) v_readerThread1of1ForFork0_sum_3) v_readerThread1of1ForFork0_sum_4) InVars {A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum] Black: 6775#[L67-1, L31]don't care [73] L31-->L28-1: Formula: (= v_readerThread1of1ForFork0_i_12 (+ v_readerThread1of1ForFork0_i_11 1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_12} AuxVars[] AssignedVars[readerThread1of1ForFork0_i] 6663#[L67-1, L28-1]don't care [2024-02-10 01:37:20,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:20,145 INFO L85 PathProgramCache]: Analyzing trace with hash 84812001, now seen corresponding path program 1 times [2024-02-10 01:37:20,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:20,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880079073] [2024-02-10 01:37:20,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:20,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:20,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:20,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:20,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:20,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash 3049636, now seen corresponding path program 2 times [2024-02-10 01:37:20,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:20,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710437954] [2024-02-10 01:37:20,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:20,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:20,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:20,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:20,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:20,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1652475516, now seen corresponding path program 1 times [2024-02-10 01:37:20,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:20,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972403512] [2024-02-10 01:37:20,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:20,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:20,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:20,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:20,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:20,559 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:37:20,559 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:37:20,559 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:37:20,559 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:37:20,559 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:37:20,559 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:20,559 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:37:20,559 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:37:20,560 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration4_Lasso [2024-02-10 01:37:20,560 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:37:20,560 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:37:20,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:20,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:20,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:20,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:20,664 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:20,666 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:20,851 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:37:20,852 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:37:20,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:20,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:20,853 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:20,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-10 01:37:20,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:20,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:20,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:20,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:20,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:20,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:20,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:20,888 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:20,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:20,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:20,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:20,900 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:20,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:20,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-10 01:37:20,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:20,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:20,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:20,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:20,930 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:20,930 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:20,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:20,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:20,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:20,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:20,954 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:20,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-10 01:37:20,959 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:37:20,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:20,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:20,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:20,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:20,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:20,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:20,999 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:37:21,013 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-02-10 01:37:21,013 INFO L444 ModelExtractionUtils]: 34 out of 46 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-02-10 01:37:21,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:21,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:21,017 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:21,025 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:37:21,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-10 01:37:21,040 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:37:21,040 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:37:21,040 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(readerThread1of1ForFork0_i, N) = -2*readerThread1of1ForFork0_i + 2*N + 1 Supporting invariants [] [2024-02-10 01:37:21,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:21,053 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:37:21,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:21,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:21,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:37:21,090 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:21,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:37:21,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:37:21,153 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-10 01:37:21,153 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:21,241 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 8 states and 502 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:37:21,241 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:37:21,242 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:37:21,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-02-10 01:37:21,413 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:37:21,413 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:37:21,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 01:37:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2024-02-10 01:37:21,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 166 transitions. Stem has 21 letters. Loop has 4 letters. [2024-02-10 01:37:21,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:21,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 166 transitions. Stem has 25 letters. Loop has 4 letters. [2024-02-10 01:37:21,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:21,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 166 transitions. Stem has 21 letters. Loop has 8 letters. [2024-02-10 01:37:21,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:21,418 INFO L428 stractBuchiCegarLoop]: Abstraction has has 112 places, 25528 transitions, 234512 flow [2024-02-10 01:37:21,418 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-02-10 01:37:21,418 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:37:21,418 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 112 places, 25528 transitions, 234512 flow [2024-02-10 01:37:29,245 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 2806 states, 2498 states have (on average 4.704163330664532) internal successors, (11751), 2805 states have internal predecessors, (11751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:29,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2806 states, 2498 states have (on average 4.704163330664532) internal successors, (11751), 2805 states have internal predecessors, (11751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:37:29,283 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-10 01:37:29,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-10 01:37:29,290 INFO L201 PluginConnector]: Adding new model optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:37:29 BoogieIcfgContainer [2024-02-10 01:37:29,291 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:37:29,291 INFO L158 Benchmark]: Toolchain (without parser) took 16400.78ms. Allocated memory was 159.4MB in the beginning and 633.3MB in the end (delta: 474.0MB). Free memory was 129.6MB in the beginning and 349.2MB in the end (delta: -219.6MB). Peak memory consumption was 406.9MB. Max. memory is 8.0GB. [2024-02-10 01:37:29,294 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.87ms. Allocated memory is still 159.4MB. Free memory was 130.7MB in the beginning and 130.6MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:37:29,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.79ms. Allocated memory is still 159.4MB. Free memory was 129.4MB in the beginning and 128.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:37:29,296 INFO L158 Benchmark]: Boogie Preprocessor took 27.02ms. Allocated memory is still 159.4MB. Free memory was 127.9MB in the beginning and 126.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:37:29,297 INFO L158 Benchmark]: RCFGBuilder took 300.29ms. Allocated memory is still 159.4MB. Free memory was 126.8MB in the beginning and 117.1MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-10 01:37:29,298 INFO L158 Benchmark]: BuchiAutomizer took 16027.06ms. Allocated memory was 159.4MB in the beginning and 633.3MB in the end (delta: 474.0MB). Free memory was 116.9MB in the beginning and 349.2MB in the end (delta: -232.3MB). Peak memory consumption was 393.3MB. Max. memory is 8.0GB. [2024-02-10 01:37:29,302 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.87ms. Allocated memory is still 159.4MB. Free memory was 130.7MB in the beginning and 130.6MB in the end (delta: 150.4kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.79ms. Allocated memory is still 159.4MB. Free memory was 129.4MB in the beginning and 128.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.02ms. Allocated memory is still 159.4MB. Free memory was 127.9MB in the beginning and 126.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 300.29ms. Allocated memory is still 159.4MB. Free memory was 126.8MB in the beginning and 117.1MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 16027.06ms. Allocated memory was 159.4MB in the beginning and 633.3MB in the end (delta: 474.0MB). Free memory was 116.9MB in the beginning and 349.2MB in the end (delta: -232.3MB). Peak memory consumption was 393.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function end + -1 * j and consists of 5 locations. One deterministic module has affine ranking function end + -1 * i and consists of 5 locations. One deterministic module has affine ranking function 2 * N + -2 * i + 1 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.8s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 2.5s. Construction of modules took 0.5s. Büchi inclusion checks took 3.1s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 639 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 636 mSDsluCounter, 1475 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 947 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 954 IncrementalHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 528 mSDtfsCounter, 954 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital70 mio100 ax100 hnf100 lsp83 ukn92 mio100 lsp87 div100 bol100 ite100 ukn100 eq160 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 41ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-10 01:37:29,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...