/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-concurrency1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:37:05,471 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:37:05,542 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:05,547 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:37:05,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:37:05,547 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:05,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:37:05,582 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:37:05,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:37:05,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:37:05,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:37:05,586 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:37:05,586 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:37:05,586 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:37:05,587 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:37:05,587 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:37:05,587 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:37:05,587 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:37:05,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:37:05,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:37:05,587 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:37:05,589 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:37:05,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:37:05,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:37:05,589 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:37:05,590 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:37:05,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:37:05,590 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:37:05,590 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:37:05,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:37:05,591 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:37:05,591 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:37:05,591 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:37:05,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:37:05,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:37:05,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:37:05,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:37:05,592 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:37:05,592 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:05,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:37:05,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:37:05,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:37:05,907 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:37:05,908 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:37:05,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency1.bpl [2024-02-10 01:37:05,910 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency1.bpl' [2024-02-10 01:37:05,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:37:05,939 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:37:05,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:37:05,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:37:05,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:37:05,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:05" (1/1) ... [2024-02-10 01:37:06,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:05" (1/1) ... [2024-02-10 01:37:06,029 INFO L138 Inliner]: procedures = 3, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:37:06,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:37:06,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:37:06,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:37:06,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:37:06,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:05" (1/1) ... [2024-02-10 01:37:06,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:05" (1/1) ... [2024-02-10 01:37:06,041 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:05" (1/1) ... [2024-02-10 01:37:06,041 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:05" (1/1) ... [2024-02-10 01:37:06,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:05" (1/1) ... [2024-02-10 01:37:06,047 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:05" (1/1) ... [2024-02-10 01:37:06,048 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:05" (1/1) ... [2024-02-10 01:37:06,049 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:05" (1/1) ... [2024-02-10 01:37:06,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:37:06,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:37:06,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:37:06,054 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:37:06,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:05" (1/1) ... [2024-02-10 01:37:06,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:06,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:06,098 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:06,134 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:06,170 INFO L124 BoogieDeclarations]: Specification and implementation of procedure reader given in one single declaration [2024-02-10 01:37:06,170 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-02-10 01:37:06,171 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-02-10 01:37:06,171 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:37:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:37:06,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:37:06,186 INFO L124 BoogieDeclarations]: Specification and implementation of procedure writer given in one single declaration [2024-02-10 01:37:06,186 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-02-10 01:37:06,186 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-02-10 01:37:06,187 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:06,242 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:37:06,244 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:37:06,333 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:37:06,338 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:37:06,339 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 01:37:06,340 INFO L201 PluginConnector]: Adding new model optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:37:06 BoogieIcfgContainer [2024-02-10 01:37:06,340 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:37:06,341 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:37:06,341 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:37:06,343 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:37:06,344 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:37:06,344 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:37:05" (1/2) ... [2024-02-10 01:37:06,345 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13ef6efc and model type optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:37:06, skipping insertion in model container [2024-02-10 01:37:06,345 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:37:06,345 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:37:06" (2/2) ... [2024-02-10 01:37:06,346 INFO L332 chiAutomizerObserver]: Analyzing ICFG optimistic-concurrency1.bpl [2024-02-10 01:37:06,408 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-02-10 01:37:06,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 44 transitions, 115 flow [2024-02-10 01:37:06,462 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2024-02-10 01:37:06,462 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-10 01:37:06,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 4/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 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:06,466 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 44 transitions, 115 flow [2024-02-10 01:37:06,471 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 36 transitions, 90 flow [2024-02-10 01:37:06,477 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:37:06,477 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:37:06,478 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:37:06,478 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:37:06,478 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:37:06,478 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:37:06,478 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:37:06,479 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:37:06,479 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:37:06,479 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 42 places, 36 transitions, 90 flow [2024-02-10 01:37:06,497 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 95 states, 92 states have (on average 1.9130434782608696) internal successors, (176), 94 states have internal predecessors, (176), 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:06,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 95 states, 92 states have (on average 1.9130434782608696) internal successors, (176), 94 states have internal predecessors, (176), 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:06,518 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 60 [2024-02-10 01:37:06,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:37:06,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:37:06,522 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:37:06,522 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:37:06,523 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 42 places, 36 transitions, 90 flow [2024-02-10 01:37:06,531 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 95 states, 92 states have (on average 1.9130434782608696) internal successors, (176), 94 states have internal predecessors, (176), 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:06,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 95 states, 92 states have (on average 1.9130434782608696) internal successors, (176), 94 states have internal predecessors, (176), 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:06,536 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 60 [2024-02-10 01:37:06,536 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:37:06,536 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:37:06,540 INFO L748 eck$LassoCheckResult]: Stem: Black: 240#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_3) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] 243#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_4) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] 245#[L59]don't care [99] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) 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, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] 247#[$Ultimate##0, L59-1]don't care [84] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork2_j_1 v_writerThread1of1ForFork2_start_1) InVars {writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_1, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork2_j] 251#[L41-1, L59-1]don't care [2024-02-10 01:37:06,541 INFO L750 eck$LassoCheckResult]: Loop: 251#[L41-1, L59-1]don't care [86] L41-1-->L42: Formula: (< v_writerThread1of1ForFork2_j_5 v_writerThread1of1ForFork2_end_3) InVars {writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_3, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_5} OutVars{writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_3, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_5} AuxVars[] AssignedVars[] 259#[L42, L59-1]don't care [88] L42-->L43: Formula: (and (<= 0 v_writerThread1of1ForFork2_j_7) (<= v_writerThread1of1ForFork2_j_7 v_N_5)) InVars {writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_7, N=v_N_5} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_7, N=v_N_5} AuxVars[] AssignedVars[] 271#[L43, L59-1]don't care [89] L43-->L44: Formula: (= (store v_A_3 v_writerThread1of1ForFork2_j_9 0) v_A_2) InVars {A=v_A_3, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_9} OutVars{A=v_A_2, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_9} AuxVars[] AssignedVars[A] 287#[L59-1, L44]don't care [90] L44-->L41-1: Formula: (= v_writerThread1of1ForFork2_j_12 (+ v_writerThread1of1ForFork2_j_11 1)) InVars {writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_11} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_12} AuxVars[] AssignedVars[writerThread1of1ForFork2_j] 251#[L41-1, L59-1]don't care [2024-02-10 01:37:06,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:06,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2842908, now seen corresponding path program 1 times [2024-02-10 01:37:06,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:06,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107687554] [2024-02-10 01:37:06,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:06,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:06,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:06,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:06,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:06,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:06,663 INFO L85 PathProgramCache]: Analyzing trace with hash 3572964, now seen corresponding path program 1 times [2024-02-10 01:37:06,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:06,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501675726] [2024-02-10 01:37:06,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:06,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:06,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:06,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:06,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:06,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1262870655, now seen corresponding path program 1 times [2024-02-10 01:37:06,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:06,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401296054] [2024-02-10 01:37:06,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:06,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:06,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:06,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:06,833 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:37:06,833 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:37:06,833 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:37:06,833 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:37:06,834 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:37:06,834 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:06,834 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:37:06,834 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:37:06,834 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:37:06,834 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:37:06,834 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:37:06,846 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:06,854 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:06,857 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:06,948 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:37:06,951 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:37:06,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:06,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:06,955 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:06,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:06,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:06,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:06,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:06,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:06,974 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:06,974 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:06,982 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:06,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:06,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:06,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:06,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:06,995 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:07,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:07,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:07,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:07,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:07,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:07,009 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:07,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:07,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:07,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:07,060 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:07,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:07,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:07,062 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:07,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:07,093 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:07,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:07,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:37:07,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:07,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:07,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:07,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:37:07,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:37:07,112 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:07,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-02-10 01:37:07,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:07,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:07,119 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:07,121 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:07,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:07,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:07,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:07,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:07,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:07,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:07,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:07,187 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:37:07,218 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-10 01:37:07,218 INFO L444 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-02-10 01:37:07,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:07,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:07,291 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:07,293 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:07,294 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:37:07,314 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:37:07,314 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:37:07,315 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(writerThread1of1ForFork2_j, writerThread1of1ForFork2_end) = -1*writerThread1of1ForFork2_j + 1*writerThread1of1ForFork2_end Supporting invariants [] [2024-02-10 01:37:07,322 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:07,326 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:37:07,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:07,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:37:07,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:07,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:37:07,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:07,432 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:07,458 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:07,461 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:07,612 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 556 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:37:07,613 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:37:07,614 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:37:07,621 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:37:07,621 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:37:07,629 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:07,633 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:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2024-02-10 01:37:07,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 214 transitions. Stem has 4 letters. Loop has 4 letters. [2024-02-10 01:37:07,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:07,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 214 transitions. Stem has 8 letters. Loop has 4 letters. [2024-02-10 01:37:07,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:07,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 214 transitions. Stem has 4 letters. Loop has 8 letters. [2024-02-10 01:37:07,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:07,636 INFO L428 stractBuchiCegarLoop]: Abstraction has has 60 places, 904 transitions, 4054 flow [2024-02-10 01:37:07,636 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:37:07,636 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:37:07,636 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 60 places, 904 transitions, 4054 flow [2024-02-10 01:37:07,664 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 286 states, 269 states have (on average 2.5353159851301115) internal successors, (682), 285 states have internal predecessors, (682), 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:07,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 286 states, 269 states have (on average 2.5353159851301115) internal successors, (682), 285 states have internal predecessors, (682), 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:07,674 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 72 [2024-02-10 01:37:07,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:37:07,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:37:07,684 INFO L748 eck$LassoCheckResult]: Stem: Black: 489#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_3) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] Black: 492#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_4) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] Black: 497#[L59]don't care [99] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) 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, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] Black: 505#[$Ultimate##0, L59-1]don't care [93] L59-1-->$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_18, 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] 516#[L60, $Ultimate##0, $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: 532#[L60, L27, $Ultimate##0]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] 568#[L60, $Ultimate##0, L28-1]don't care [2024-02-10 01:37:07,684 INFO L750 eck$LassoCheckResult]: Loop: 568#[L60, $Ultimate##0, 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: 657#[L29, L60, $Ultimate##0]don't care [72] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork0_i_9 v_N_2) (<= 0 v_readerThread1of1ForFork0_i_9)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} AuxVars[] AssignedVars[] 754#[L60, L30, $Ultimate##0]don't care [73] L30-->L31: Formula: (= (+ v_readerThread1of1ForFork0_sum_3 (select v_A_1 v_readerThread1of1ForFork0_i_11)) v_readerThread1of1ForFork0_sum_4) InVars {A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum] Black: 864#[L60, $Ultimate##0, L31]don't care [74] L31-->L28-1: Formula: (= v_readerThread1of1ForFork0_i_14 (+ v_readerThread1of1ForFork0_i_13 1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_13} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_14} AuxVars[] AssignedVars[readerThread1of1ForFork0_i] 568#[L60, $Ultimate##0, L28-1]don't care [2024-02-10 01:37:07,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:07,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1562921946, now seen corresponding path program 1 times [2024-02-10 01:37:07,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:07,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622882117] [2024-02-10 01:37:07,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:07,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:07,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:07,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:07,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:07,714 INFO L85 PathProgramCache]: Analyzing trace with hash 3050629, now seen corresponding path program 1 times [2024-02-10 01:37:07,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:07,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111632968] [2024-02-10 01:37:07,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:07,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:07,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:07,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:07,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:07,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1242932778, now seen corresponding path program 1 times [2024-02-10 01:37:07,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:07,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939892006] [2024-02-10 01:37:07,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:07,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:07,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:07,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:07,883 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:37:07,883 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:37:07,883 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:37:07,883 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:37:07,883 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:37:07,883 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:07,883 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:37:07,884 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:37:07,884 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:37:07,884 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:37:07,884 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:37:07,886 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:07,889 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:07,893 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:07,897 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:07,900 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:07,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:08,024 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:37:08,025 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:37:08,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:08,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:08,026 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:08,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:08,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:08,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:08,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:08,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:08,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:08,043 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:08,046 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:08,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:08,067 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:08,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:08,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:08,069 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:08,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:08,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:08,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:08,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:08,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:08,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:08,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:08,089 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:08,097 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:08,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-02-10 01:37:08,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:08,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:08,106 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:08,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:08,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:08,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:08,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:08,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:08,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:08,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:08,126 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:08,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:08,151 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:08,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:08,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:08,153 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:08,155 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:08,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:08,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:08,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:08,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:08,163 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:08,166 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:08,166 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:08,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:37:08,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-02-10 01:37:08,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:08,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:08,189 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:08,196 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:08,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:08,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:08,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:08,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:08,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:08,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:08,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:08,228 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:37:08,235 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:37:08,235 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:37:08,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:08,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:08,236 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:08,240 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:37:08,249 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:08,258 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:37:08,259 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:37:08,259 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, readerThread1of1ForFork0_i) = 2*N - 2*readerThread1of1ForFork0_i + 1 Supporting invariants [] [2024-02-10 01:37:08,265 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:08,267 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:37:08,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:08,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:37:08,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:08,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:37:08,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:08,314 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:08,315 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:08,315 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:08,399 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 8 states and 514 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:37:08,399 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:37:08,399 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:37:08,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:08,580 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:08,593 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:37:08,593 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:37:08,594 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:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 170 transitions. [2024-02-10 01:37:08,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 6 letters. Loop has 4 letters. [2024-02-10 01:37:08,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:08,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 10 letters. Loop has 4 letters. [2024-02-10 01:37:08,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:08,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 170 transitions. Stem has 6 letters. Loop has 8 letters. [2024-02-10 01:37:08,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:08,596 INFO L428 stractBuchiCegarLoop]: Abstraction has has 76 places, 20968 transitions, 135540 flow [2024-02-10 01:37:08,596 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:37:08,596 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:37:08,596 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 76 places, 20968 transitions, 135540 flow [2024-02-10 01:37:09,980 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 739 states, 665 states have (on average 3.330827067669173) internal successors, (2215), 738 states have internal predecessors, (2215), 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:09,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 739 states, 665 states have (on average 3.330827067669173) internal successors, (2215), 738 states have internal predecessors, (2215), 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:10,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-02-10 01:37:10,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:37:10,006 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:37:10,008 INFO L748 eck$LassoCheckResult]: Stem: Black: 1316#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_3) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] Black: 1319#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_4) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] Black: 1330#[L59]don't care [99] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) 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, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] Black: 1349#[L59-1, $Ultimate##0]don't care [84] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork2_j_1 v_writerThread1of1ForFork2_start_1) InVars {writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_1, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork2_j] Black: 1371#[L59-1, L41-1]don't care [85] L41-1-->writerFINAL: Formula: (<= v_writerThread1of1ForFork2_end_1 v_writerThread1of1ForFork2_j_3) InVars {writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_1, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_3} OutVars{writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_1, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_3} AuxVars[] AssignedVars[] Black: 1399#[L59-1, writerFINAL]don't care [87] writerFINAL-->writerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] Black: 1460#[L59-1, writerEXIT]don't care [93] L59-1-->$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_18, 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] Black: 1570#[L60, writerEXIT, $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: 1727#[writerEXIT, L60, L27]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] Black: 1986#[L60, writerEXIT, L28-1]don't care [100] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork2_thidvar0_4 1) InVars {writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_4} OutVars{writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[] Black: 2287#[L61, L28-1]don't care [68] L28-1-->readerFINAL: Formula: (<= v_readerThread1of1ForFork0_end_1 v_readerThread1of1ForFork0_i_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_3, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_3, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_1} AuxVars[] AssignedVars[] 2594#[L61, readerFINAL]don't care [70] readerFINAL-->readerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] Black: 2865#[L61, readerEXIT]don't care [101] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_4 2) (= v_ULTIMATE.start_sum_2 v_readerThread1of1ForFork0_sum_10) (= v_readerThread1of1ForFork0_thidvar1_4 2)) InVars {readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_10, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_4, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_10, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_4, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] 3034#[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: 3123#[L67]don't care [96] L67-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork1_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork1_thidvar0_2 2) (= v_ULTIMATE.start_min2_7 v_readerThread1of1ForFork1_start_4) (= v_readerThread1of1ForFork1_thidvar1_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{readerThread1of1ForFork1_thidvar0=v_readerThread1of1ForFork1_thidvar0_2, ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork1_thidvar1=v_readerThread1of1ForFork1_thidvar1_2, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_8, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_18, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_6, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_4} AuxVars[] AssignedVars[readerThread1of1ForFork1_thidvar0, readerThread1of1ForFork1_thidvar1, readerThread1of1ForFork1_sum, readerThread1of1ForFork1_i, readerThread1of1ForFork1_end, readerThread1of1ForFork1_start] 3144#[$Ultimate##0, L67-1]don't care [75] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork1_sum_1 0) InVars {} OutVars{readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork1_sum] Black: 3195#[L27, L67-1]don't care [76] L27-->L28-1: Formula: (= v_readerThread1of1ForFork1_i_1 v_readerThread1of1ForFork1_start_1) InVars {readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_1} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_1, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[readerThread1of1ForFork1_i] 3210#[L67-1, L28-1]don't care [2024-02-10 01:37:10,008 INFO L750 eck$LassoCheckResult]: Loop: 3210#[L67-1, L28-1]don't care [78] L28-1-->L29: Formula: (< v_readerThread1of1ForFork1_i_5 v_readerThread1of1ForFork1_end_3) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_5, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_3} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_5, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_3} AuxVars[] AssignedVars[] Black: 3258#[L29, L67-1]don't care [81] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork1_i_9 v_N_2) (<= 0 v_readerThread1of1ForFork1_i_9)) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_9, N=v_N_2} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_9, N=v_N_2} AuxVars[] AssignedVars[] 3306#[L67-1, L30]don't care [82] L30-->L31: Formula: (= v_readerThread1of1ForFork1_sum_4 (+ (select v_A_1 v_readerThread1of1ForFork1_i_11) v_readerThread1of1ForFork1_sum_3)) InVars {A=v_A_1, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_11, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_11, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork1_sum] Black: 3349#[L31, L67-1]don't care [83] L31-->L28-1: Formula: (= (+ v_readerThread1of1ForFork1_i_13 1) v_readerThread1of1ForFork1_i_14) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_13} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_14} AuxVars[] AssignedVars[readerThread1of1ForFork1_i] 3210#[L67-1, L28-1]don't care [2024-02-10 01:37:10,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:10,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1751564803, now seen corresponding path program 1 times [2024-02-10 01:37:10,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:10,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395735288] [2024-02-10 01:37:10,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:10,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:10,019 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:10,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:10,034 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:10,034 INFO L85 PathProgramCache]: Analyzing trace with hash 3327685, now seen corresponding path program 1 times [2024-02-10 01:37:10,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:10,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494838821] [2024-02-10 01:37:10,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:10,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:10,040 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:10,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:10,044 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:10,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1938077639, now seen corresponding path program 1 times [2024-02-10 01:37:10,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:10,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793220019] [2024-02-10 01:37:10,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:10,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:10,200 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:10,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 01:37:10,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793220019] [2024-02-10 01:37:10,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793220019] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 01:37:10,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 01:37:10,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-10 01:37:10,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119932109] [2024-02-10 01:37:10,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 01:37:10,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 01:37:10,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-10 01:37:10,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-02-10 01:37:10,849 INFO L175 Difference]: Start difference. First operand has 76 places, 20968 transitions, 135540 flow. Second operand 15 states and 660 transitions. [2024-02-10 01:37:10,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 20968 transitions, 135540 flow. Second operand 15 states and 660 transitions. [2024-02-10 01:37:10,852 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 44 [2024-02-10 01:37:10,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 01:37:12,106 INFO L124 PetriNetUnfolderBase]: 2600/3900 cut-off events. [2024-02-10 01:37:12,106 INFO L125 PetriNetUnfolderBase]: For 597/597 co-relation queries the response was YES. [2024-02-10 01:37:12,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13119 conditions, 3900 events. 2600/3900 cut-off events. For 597/597 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 17782 event pairs, 0 based on Foata normal form. 0/1639 useless extension candidates. Maximal degree in co-relation 12132. Up to 1044 conditions per place. [2024-02-10 01:37:12,130 INFO L140 encePairwiseOnDemand]: 36/44 looper letters, 244 selfloop transitions, 174 changer transitions 41/1189 dead transitions. [2024-02-10 01:37:12,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 1189 transitions, 8470 flow [2024-02-10 01:37:12,136 INFO L231 Difference]: Finished difference. Result has 95 places, 1090 transitions, 7918 flow [2024-02-10 01:37:12,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-10 01:37:12,137 INFO L428 stractBuchiCegarLoop]: Abstraction has has 95 places, 1090 transitions, 7918 flow [2024-02-10 01:37:12,137 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 01:37:12,137 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:37:12,137 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 95 places, 1090 transitions, 7918 flow [2024-02-10 01:37:12,294 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1241 states, 1122 states have (on average 3.393939393939394) internal successors, (3808), 1240 states have internal predecessors, (3808), 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:12,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1241 states, 1122 states have (on average 3.393939393939394) internal successors, (3808), 1240 states have internal predecessors, (3808), 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:12,307 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-02-10 01:37:12,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:37:12,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:37:12,308 INFO L748 eck$LassoCheckResult]: Stem: Black: 3405#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_3) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] Black: 3408#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_4) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] Black: 3419#[L59]don't care [99] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) 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, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] Black: 3438#[$Ultimate##0, L59-1]don't care [84] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork2_j_1 v_writerThread1of1ForFork2_start_1) InVars {writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_1, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork2_j] Black: 3460#[L59-1, L41-1]don't care [85] L41-1-->writerFINAL: Formula: (<= v_writerThread1of1ForFork2_end_1 v_writerThread1of1ForFork2_j_3) InVars {writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_1, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_3} OutVars{writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_1, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_3} AuxVars[] AssignedVars[] Black: 3491#[writerFINAL, L59-1]don't care [87] writerFINAL-->writerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] Black: 3567#[writerEXIT, L59-1]don't care [93] L59-1-->$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_18, 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] Black: 3656#[$Ultimate##0, L60, writerEXIT]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: 3829#[L27, writerEXIT, L60]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] Black: 4039#[L60, writerEXIT, L28-1]don't care [100] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork2_thidvar0_4 1) InVars {writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_4} OutVars{writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[] Black: 4366#[L28-1, L61]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: 4649#[L61, L29]don't care [72] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork0_i_9 v_N_2) (<= 0 v_readerThread1of1ForFork0_i_9)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} AuxVars[] AssignedVars[] Black: 4984#[L61, L30]don't care [73] L30-->L31: Formula: (= (+ v_readerThread1of1ForFork0_sum_3 (select v_A_1 v_readerThread1of1ForFork0_i_11)) v_readerThread1of1ForFork0_sum_4) InVars {A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum] Black: 5272#[L61, L31]don't care [74] L31-->L28-1: Formula: (= v_readerThread1of1ForFork0_i_14 (+ v_readerThread1of1ForFork0_i_13 1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_13} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_14} AuxVars[] AssignedVars[readerThread1of1ForFork0_i] Black: 5596#[L61, L28-1]don't care [68] L28-1-->readerFINAL: Formula: (<= v_readerThread1of1ForFork0_end_1 v_readerThread1of1ForFork0_i_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_3, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_3, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_1} AuxVars[] AssignedVars[] Black: 5935#[L61, readerFINAL]don't care [70] readerFINAL-->readerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] Black: 6223#[L61, readerEXIT]don't care [101] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_4 2) (= v_ULTIMATE.start_sum_2 v_readerThread1of1ForFork0_sum_10) (= v_readerThread1of1ForFork0_thidvar1_4 2)) InVars {readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_10, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_4, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_10, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_4, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] Black: 6421#[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[] 6512#[L67]don't care [96] L67-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork1_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork1_thidvar0_2 2) (= v_ULTIMATE.start_min2_7 v_readerThread1of1ForFork1_start_4) (= v_readerThread1of1ForFork1_thidvar1_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{readerThread1of1ForFork1_thidvar0=v_readerThread1of1ForFork1_thidvar0_2, ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork1_thidvar1=v_readerThread1of1ForFork1_thidvar1_2, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_8, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_18, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_6, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_4} AuxVars[] AssignedVars[readerThread1of1ForFork1_thidvar0, readerThread1of1ForFork1_thidvar1, readerThread1of1ForFork1_sum, readerThread1of1ForFork1_i, readerThread1of1ForFork1_end, readerThread1of1ForFork1_start] Black: 6577#[L67-1, $Ultimate##0]don't care [75] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork1_sum_1 0) InVars {} OutVars{readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork1_sum] Black: 6625#[L67-1, L27]don't care [76] L27-->L28-1: Formula: (= v_readerThread1of1ForFork1_i_1 v_readerThread1of1ForFork1_start_1) InVars {readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_1} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_1, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[readerThread1of1ForFork1_i] 6658#[L67-1, L28-1]don't care [2024-02-10 01:37:12,308 INFO L750 eck$LassoCheckResult]: Loop: 6658#[L67-1, L28-1]don't care [78] L28-1-->L29: Formula: (< v_readerThread1of1ForFork1_i_5 v_readerThread1of1ForFork1_end_3) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_5, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_3} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_5, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_3} AuxVars[] AssignedVars[] Black: 6692#[L29, L67-1]don't care [81] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork1_i_9 v_N_2) (<= 0 v_readerThread1of1ForFork1_i_9)) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_9, N=v_N_2} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_9, N=v_N_2} AuxVars[] AssignedVars[] 6736#[L67-1, L30]don't care [82] L30-->L31: Formula: (= v_readerThread1of1ForFork1_sum_4 (+ (select v_A_1 v_readerThread1of1ForFork1_i_11) v_readerThread1of1ForFork1_sum_3)) InVars {A=v_A_1, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_11, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_11, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork1_sum] Black: 6784#[L31, L67-1]don't care [83] L31-->L28-1: Formula: (= (+ v_readerThread1of1ForFork1_i_13 1) v_readerThread1of1ForFork1_i_14) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_13} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_14} AuxVars[] AssignedVars[readerThread1of1ForFork1_i] 6658#[L67-1, L28-1]don't care [2024-02-10 01:37:12,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:12,308 INFO L85 PathProgramCache]: Analyzing trace with hash 798065279, now seen corresponding path program 1 times [2024-02-10 01:37:12,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:12,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553269069] [2024-02-10 01:37:12,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:12,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:12,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:12,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:12,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:12,321 INFO L85 PathProgramCache]: Analyzing trace with hash 3327685, now seen corresponding path program 2 times [2024-02-10 01:37:12,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:12,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508876223] [2024-02-10 01:37:12,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:12,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:12,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:12,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:12,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:12,326 INFO L85 PathProgramCache]: Analyzing trace with hash 774036035, now seen corresponding path program 1 times [2024-02-10 01:37:12,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:37:12,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027204229] [2024-02-10 01:37:12,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:37:12,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:37:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:12,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:37:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:37:12,339 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:37:12,642 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:37:12,642 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:37:12,642 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:37:12,642 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:37:12,642 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:37:12,642 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:12,642 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:37:12,642 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:37:12,642 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_BEv2_Iteration4_Lasso [2024-02-10 01:37:12,642 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:37:12,642 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:37:12,645 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:12,725 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:12,727 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:12,729 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:12,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:12,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:37:12,916 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:37:12,916 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:37:12,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:12,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:12,918 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:12,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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:12,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:37:12,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:37:12,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:37:12,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:37:12,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:37:12,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:37:12,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 01:37:12,954 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:37:12,969 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-10 01:37:12,969 INFO L444 ModelExtractionUtils]: 34 out of 46 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-02-10 01:37:12,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:37:12,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:37:12,981 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 01:37:12,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 01:37:12,997 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:37:13,018 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-02-10 01:37:13,018 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:37:13,018 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(readerThread1of1ForFork1_i, N) = -2*readerThread1of1ForFork1_i + 3*N Supporting invariants [1*N - 1 >= 0] [2024-02-10 01:37:13,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-10 01:37:13,034 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 01:37:13,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:37:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:13,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:37:13,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:37:13,083 WARN L260 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-10 01:37:13,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:37:13,101 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:13,102 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:13,102 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:13,174 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 9 states and 556 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:37:13,174 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:37:13,174 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:37:13,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-02-10 01:37:13,395 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:37:13,395 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:37:13,395 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:13,396 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:13,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2024-02-10 01:37:13,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 214 transitions. Stem has 21 letters. Loop has 4 letters. [2024-02-10 01:37:13,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:13,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 214 transitions. Stem has 25 letters. Loop has 4 letters. [2024-02-10 01:37:13,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:13,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 214 transitions. Stem has 21 letters. Loop has 8 letters. [2024-02-10 01:37:13,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:37:13,397 INFO L428 stractBuchiCegarLoop]: Abstraction has has 113 places, 27592 transitions, 253708 flow [2024-02-10 01:37:13,398 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-02-10 01:37:13,398 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:37:13,398 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 113 places, 27592 transitions, 253708 flow [2024-02-10 01:37:32,694 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 2808 states, 2488 states have (on average 4.719051446945338) internal successors, (11741), 2807 states have internal predecessors, (11741), 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:32,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2808 states, 2488 states have (on average 4.719051446945338) internal successors, (11741), 2807 states have internal predecessors, (11741), 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:32,733 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-10 01:37:32,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-10 01:37:32,740 INFO L201 PluginConnector]: Adding new model optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:37:32 BoogieIcfgContainer [2024-02-10 01:37:32,740 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:37:32,741 INFO L158 Benchmark]: Toolchain (without parser) took 26801.56ms. Allocated memory was 153.1MB in the beginning and 968.9MB in the end (delta: 815.8MB). Free memory was 115.0MB in the beginning and 746.6MB in the end (delta: -631.6MB). Peak memory consumption was 656.0MB. Max. memory is 8.0GB. [2024-02-10 01:37:32,741 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.85ms. Allocated memory is still 153.1MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:37:32,741 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.01ms. Allocated memory is still 153.1MB. Free memory was 114.9MB in the beginning and 129.0MB in the end (delta: -14.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:37:32,742 INFO L158 Benchmark]: Boogie Preprocessor took 20.50ms. Allocated memory is still 153.1MB. Free memory was 128.9MB in the beginning and 127.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:37:32,742 INFO L158 Benchmark]: RCFGBuilder took 286.63ms. Allocated memory is still 153.1MB. Free memory was 127.9MB in the beginning and 118.0MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-10 01:37:32,742 INFO L158 Benchmark]: BuchiAutomizer took 26399.58ms. Allocated memory was 153.1MB in the beginning and 968.9MB in the end (delta: 815.8MB). Free memory was 117.9MB in the beginning and 746.6MB in the end (delta: -628.7MB). Peak memory consumption was 659.6MB. Max. memory is 8.0GB. [2024-02-10 01:37:32,744 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.85ms. Allocated memory is still 153.1MB. Free memory is still 116.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 91.01ms. Allocated memory is still 153.1MB. Free memory was 114.9MB in the beginning and 129.0MB in the end (delta: -14.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.50ms. Allocated memory is still 153.1MB. Free memory was 128.9MB in the beginning and 127.9MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 286.63ms. Allocated memory is still 153.1MB. Free memory was 127.9MB in the beginning and 118.0MB in the end (delta: 9.9MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 26399.58ms. Allocated memory was 153.1MB in the beginning and 968.9MB in the end (delta: 815.8MB). Free memory was 117.9MB in the beginning and 746.6MB in the end (delta: -628.7MB). Peak memory consumption was 659.6MB. 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 2 * N + -2 * i + 1 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 3 * N and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 26.3s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 2.3s. Construction of modules took 0.4s. Büchi inclusion checks took 2.3s. 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, 657 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 654 mSDsluCounter, 1457 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 933 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1029 IncrementalHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 524 mSDtfsCounter, 1029 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 ukn93 mio100 lsp87 div100 bol100 ite100 ukn100 eq160 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms 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:32,779 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...