/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 -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:53:56,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:53:56,237 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-09 23:53:56,241 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:53:56,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:53:56,242 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:53:56,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:53:56,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:53:56,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:53:56,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:53:56,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:53:56,275 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:53:56,275 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:53:56,276 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:53:56,276 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:53:56,277 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:53:56,277 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:53:56,277 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:53:56,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:53:56,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:53:56,278 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:53:56,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:53:56,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:53:56,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:53:56,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:53:56,279 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:53:56,280 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:53:56,280 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:53:56,280 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:53:56,280 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:53:56,281 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:53:56,281 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:53:56,281 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:53:56,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:53:56,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:53:56,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:53:56,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:53:56,283 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:53:56,283 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 [2024-02-09 23:53:56,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:53:56,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:53:56,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:53:56,600 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:53:56,601 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:53:56,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl [2024-02-09 23:53:56,603 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl' [2024-02-09 23:53:56,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:53:56,641 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:53:56,642 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:53:56,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:53:56,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:53:56,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,671 INFO L138 Inliner]: procedures = 3, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-09 23:53:56,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:53:56,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:53:56,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:53:56,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:53:56,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,733 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:53:56,739 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:53:56,739 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:53:56,739 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:53:56,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/1) ... [2024-02-09 23:53:56,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:56,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:56,773 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-09 23:53:56,787 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-09 23:53:56,810 INFO L124 BoogieDeclarations]: Specification and implementation of procedure reader given in one single declaration [2024-02-09 23:53:56,810 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-02-09 23:53:56,811 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-02-09 23:53:56,811 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:53:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:53:56,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:53:56,811 INFO L124 BoogieDeclarations]: Specification and implementation of procedure writer given in one single declaration [2024-02-09 23:53:56,811 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-02-09 23:53:56,811 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-02-09 23:53:56,812 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:53:56,852 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:53:56,854 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:53:56,938 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:53:56,944 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:53:56,944 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-09 23:53:56,945 INFO L201 PluginConnector]: Adding new model optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:53:56 BoogieIcfgContainer [2024-02-09 23:53:56,946 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:53:56,946 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:53:56,946 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:53:56,961 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:53:56,962 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:53:56,962 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:53:56" (1/2) ... [2024-02-09 23:53:56,963 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75532061 and model type optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:53:56, skipping insertion in model container [2024-02-09 23:53:56,963 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:53:56,964 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:53:56" (2/2) ... [2024-02-09 23:53:56,966 INFO L332 chiAutomizerObserver]: Analyzing ICFG optimistic-concurrency2.bpl [2024-02-09 23:53:57,074 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-02-09 23:53:57,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 113 flow [2024-02-09 23:53:57,143 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2024-02-09 23:53:57,143 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-09 23:53:57,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 4/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-02-09 23:53:57,147 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 113 flow [2024-02-09 23:53:57,151 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 88 flow [2024-02-09 23:53:57,157 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:53:57,157 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:53:57,157 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:53:57,157 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:53:57,157 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:53:57,157 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:53:57,157 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:53:57,158 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-09 23:53:57,158 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 places, 35 transitions, 88 flow [2024-02-09 23:53:57,166 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:53:57,167 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2024-02-09 23:53:57,167 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-09 23:53:57,167 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:53:57,170 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:53:57,171 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 places, 35 transitions, 88 flow [2024-02-09 23:53:57,177 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:53:57,177 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2024-02-09 23:53:57,177 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-09 23:53:57,177 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:53:57,182 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_2) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] 50#[L56]true [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_3) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] 52#[L59]true [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] 54#[L59-1, $Ultimate##0]true [82] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork1_start_1 v_writerThread1of1ForFork1_j_1) InVars {writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_1, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] 56#[L59-1, L41-1]true [2024-02-09 23:53:57,188 INFO L750 eck$LassoCheckResult]: Loop: 56#[L59-1, L41-1]true [84] L41-1-->L42: Formula: (< v_writerThread1of1ForFork1_j_5 v_writerThread1of1ForFork1_end_3) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_5, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_3} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_5, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_3} AuxVars[] AssignedVars[] 59#[L59-1, L42]true [87] L42-->L43: Formula: (and (<= 0 v_writerThread1of1ForFork1_j_9) (<= v_writerThread1of1ForFork1_j_9 v_N_5)) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_9, N=v_N_5} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_9, N=v_N_5} AuxVars[] AssignedVars[] 61#[L59-1, L43]true [88] L43-->L44: Formula: (= (store v_A_3 v_writerThread1of1ForFork1_j_11 0) v_A_2) InVars {A=v_A_3, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_11} OutVars{A=v_A_2, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_11} AuxVars[] AssignedVars[A] 63#[L59-1, L44]true [89] L44-->L41-1: Formula: (= v_writerThread1of1ForFork1_j_14 (+ v_writerThread1of1ForFork1_j_13 1)) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_13} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_14} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] 56#[L59-1, L41-1]true [2024-02-09 23:53:57,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:57,197 INFO L85 PathProgramCache]: Analyzing trace with hash 2842782, now seen corresponding path program 1 times [2024-02-09 23:53:57,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:57,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157169926] [2024-02-09 23:53:57,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:57,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:57,270 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:57,306 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:57,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:57,308 INFO L85 PathProgramCache]: Analyzing trace with hash 3512389, now seen corresponding path program 1 times [2024-02-09 23:53:57,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:57,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244612436] [2024-02-09 23:53:57,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:57,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:57,324 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:57,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:57,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:57,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1146446434, now seen corresponding path program 1 times [2024-02-09 23:53:57,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:57,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828958756] [2024-02-09 23:53:57,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:57,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:57,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:57,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:57,450 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:53:57,450 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:53:57,450 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:53:57,451 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:53:57,451 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:53:57,451 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:57,451 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:53:57,451 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:53:57,451 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:53:57,451 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:53:57,451 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:53:57,462 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-09 23:53:57,470 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-09 23:53:57,492 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-09 23:53:57,553 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:53:57,556 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:53:57,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:57,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:57,560 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-09 23:53:57,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:53:57,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:57,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:57,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:57,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:57,600 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-09 23:53:57,604 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:53:57,604 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:53:57,618 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:53:57,644 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-09 23:53:57,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:57,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:57,648 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-09 23:53:57,649 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-09 23:53:57,650 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-09 23:53:57,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:57,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:53:57,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:57,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:57,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:57,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:53:57,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:53:57,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:53:57,678 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-09 23:53:57,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:57,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:57,680 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-09 23:53:57,692 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-09 23:53:57,695 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-09 23:53:57,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:57,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:57,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:57,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:57,713 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:53:57,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:53:57,730 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:53:57,776 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-02-09 23:53:57,776 INFO L444 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-02-09 23:53:57,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:57,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:57,780 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-09 23:53:57,782 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:53:57,788 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-09 23:53:57,804 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:53:57,804 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:53:57,804 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(writerThread1of1ForFork1_j, writerThread1of1ForFork1_end) = -1*writerThread1of1ForFork1_j + 1*writerThread1of1ForFork1_end Supporting invariants [] [2024-02-09 23:53:57,809 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-09 23:53:57,812 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:53:57,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:53:57,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:53:57,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:53:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:53:57,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:53:57,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:53:57,871 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-09 23:53:57,896 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-09 23:53:57,899 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-09 23:53:58,001 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 543 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:53:58,002 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:53:58,003 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:53:58,009 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:53:58,009 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:53:58,011 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-09 23:53:58,014 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-09 23:53:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 209 transitions. [2024-02-09 23:53:58,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 4 letters. Loop has 4 letters. [2024-02-09 23:53:58,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:58,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 8 letters. Loop has 4 letters. [2024-02-09 23:53:58,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:58,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 4 letters. Loop has 8 letters. [2024-02-09 23:53:58,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:58,022 INFO L428 stractBuchiCegarLoop]: Abstraction has has 59 places, 878 transitions, 3950 flow [2024-02-09 23:53:58,023 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:53:58,023 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 59 places, 878 transitions, 3950 flow [2024-02-09 23:53:58,068 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:53:58,069 INFO L124 PetriNetUnfolderBase]: 158/267 cut-off events. [2024-02-09 23:53:58,069 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-02-09 23:53:58,069 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:53:58,070 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]true [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_2) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] 50#[L56]true [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_3) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] 52#[L59]true [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] 54#[L59-1, $Ultimate##0]true [98] L59-1-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_2 2) (= v_readerThread1of1ForFork2_start_4 v_ULTIMATE.start_min2_7) (= v_readerThread1of1ForFork2_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork2_thidvar0_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_16, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_2, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_2, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i, readerThread1of1ForFork2_thidvar0, readerThread1of1ForFork2_start, readerThread1of1ForFork2_thidvar1, readerThread1of1ForFork2_end] 138#[L60, $Ultimate##0, $Ultimate##0]true [74] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork2_sum_1 0) InVars {} OutVars{readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] 140#[L60, L27, $Ultimate##0]true [75] L27-->L28-1: Formula: (= v_readerThread1of1ForFork2_start_1 v_readerThread1of1ForFork2_i_1) InVars {readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1} OutVars{readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] 142#[L28-1, L60, $Ultimate##0]true [77] L28-1-->L29: Formula: (< v_readerThread1of1ForFork2_i_5 v_readerThread1of1ForFork2_end_3) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_5, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_3} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_5, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_3} AuxVars[] AssignedVars[] 144#[L60, L29, $Ultimate##0]true [79] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork2_i_7 v_N_1) (<= 0 v_readerThread1of1ForFork2_i_7)) InVars {N=v_N_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_7} OutVars{N=v_N_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_7} AuxVars[] AssignedVars[] 146#[L60, $Ultimate##0, L30]true [80] L30-->L31: Formula: (= v_readerThread1of1ForFork2_sum_4 (+ v_readerThread1of1ForFork2_sum_3 (select v_A_1 v_readerThread1of1ForFork2_i_9))) InVars {A=v_A_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_9, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_9, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] 148#[L60, L31, $Ultimate##0]true [81] L31-->L28-1: Formula: (= v_readerThread1of1ForFork2_i_12 (+ v_readerThread1of1ForFork2_i_11 1)) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_11} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_12} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] 142#[L28-1, L60, $Ultimate##0]true [2024-02-09 23:53:58,070 INFO L750 eck$LassoCheckResult]: Loop: 142#[L28-1, L60, $Ultimate##0]true [77] L28-1-->L29: Formula: (< v_readerThread1of1ForFork2_i_5 v_readerThread1of1ForFork2_end_3) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_5, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_3} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_5, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_3} AuxVars[] AssignedVars[] 144#[L60, L29, $Ultimate##0]true [79] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork2_i_7 v_N_1) (<= 0 v_readerThread1of1ForFork2_i_7)) InVars {N=v_N_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_7} OutVars{N=v_N_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_7} AuxVars[] AssignedVars[] 146#[L60, $Ultimate##0, L30]true [80] L30-->L31: Formula: (= v_readerThread1of1ForFork2_sum_4 (+ v_readerThread1of1ForFork2_sum_3 (select v_A_1 v_readerThread1of1ForFork2_i_9))) InVars {A=v_A_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_9, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_9, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] 148#[L60, L31, $Ultimate##0]true [81] L31-->L28-1: Formula: (= v_readerThread1of1ForFork2_i_12 (+ v_readerThread1of1ForFork2_i_11 1)) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_11} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_12} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] 142#[L28-1, L60, $Ultimate##0]true [2024-02-09 23:53:58,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:58,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1054123502, now seen corresponding path program 1 times [2024-02-09 23:53:58,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:58,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919932565] [2024-02-09 23:53:58,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:58,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:58,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:58,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:58,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:58,086 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 1 times [2024-02-09 23:53:58,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:58,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001162648] [2024-02-09 23:53:58,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:58,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:58,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:58,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:58,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:58,094 INFO L85 PathProgramCache]: Analyzing trace with hash 688927797, now seen corresponding path program 2 times [2024-02-09 23:53:58,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:53:58,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352979338] [2024-02-09 23:53:58,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:53:58,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:53:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:58,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:53:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:53:58,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:53:58,275 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:53:58,276 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:53:58,276 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:53:58,276 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:53:58,276 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:53:58,276 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:58,276 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:53:58,276 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:53:58,276 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration2_Lasso [2024-02-09 23:53:58,276 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:53:58,276 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:53:58,277 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-09 23:53:58,280 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-09 23:53:58,307 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-09 23:53:58,309 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-09 23:53:58,311 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-09 23:53:58,314 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-09 23:53:58,414 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:53:58,414 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:53:58,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:58,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:58,415 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-09 23:53:58,420 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-09 23:53:58,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:58,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:58,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:58,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:58,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:53:58,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:53:58,429 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-09 23:53:58,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:53:58,454 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-09 23:53:58,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:58,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:58,456 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-09 23:53:58,461 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-09 23:53:58,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:53:58,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:53:58,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:53:58,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:53:58,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:53:58,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:53:58,496 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-09 23:53:58,501 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:53:58,529 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-02-09 23:53:58,529 INFO L444 ModelExtractionUtils]: 8 out of 28 variables were initially zero. Simplification set additionally 16 variables to zero. [2024-02-09 23:53:58,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:53:58,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:53:58,568 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-09 23:53:58,621 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-09 23:53:58,622 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:53:58,643 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:53:58,643 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:53:58,644 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, readerThread1of1ForFork2_i) = 2*N - 2*readerThread1of1ForFork2_i + 1 Supporting invariants [] [2024-02-09 23:53:58,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-02-09 23:53:58,661 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:53:58,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:53:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:53:58,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:53:58,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:53:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:53:58,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:53:58,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:53:58,729 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-09 23:53:58,729 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-09 23:53:58,729 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-09 23:53:58,848 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8 states and 502 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:53:58,848 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:53:58,848 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:53:58,926 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:53:58,927 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:53:58,927 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-09 23:53:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-09 23:53:58,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2024-02-09 23:53:58,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 166 transitions. Stem has 10 letters. Loop has 4 letters. [2024-02-09 23:53:58,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:58,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 166 transitions. Stem has 14 letters. Loop has 4 letters. [2024-02-09 23:53:58,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:58,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 166 transitions. Stem has 10 letters. Loop has 8 letters. [2024-02-09 23:53:58,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:53:58,929 INFO L428 stractBuchiCegarLoop]: Abstraction has has 75 places, 20344 transitions, 131796 flow [2024-02-09 23:53:58,930 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:53:58,930 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 75 places, 20344 transitions, 131796 flow [2024-02-09 23:53:59,070 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-09 23:53:59,093 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-09 23:54:00,348 INFO L124 PetriNetUnfolderBase]: 2637/3915 cut-off events. [2024-02-09 23:54:00,348 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2024-02-09 23:54:00,348 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2024-02-09 23:54:00,356 INFO L201 PluginConnector]: Adding new model optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:54:00 BoogieIcfgContainer [2024-02-09 23:54:00,356 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:54:00,357 INFO L158 Benchmark]: Toolchain (without parser) took 3716.43ms. Allocated memory was 181.4MB in the beginning and 398.5MB in the end (delta: 217.1MB). Free memory was 157.1MB in the beginning and 221.8MB in the end (delta: -64.7MB). Peak memory consumption was 225.9MB. Max. memory is 8.0GB. [2024-02-09 23:54:00,358 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.65ms. Allocated memory is still 181.4MB. Free memory is still 158.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:54:00,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.18ms. Allocated memory is still 181.4MB. Free memory was 157.1MB in the beginning and 155.4MB in the end (delta: 1.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-02-09 23:54:00,362 INFO L158 Benchmark]: Boogie Preprocessor took 64.22ms. Allocated memory is still 181.4MB. Free memory was 155.4MB in the beginning and 159.7MB in the end (delta: -4.3MB). Peak memory consumption was 2.0MB. Max. memory is 8.0GB. [2024-02-09 23:54:00,364 INFO L158 Benchmark]: RCFGBuilder took 206.87ms. Allocated memory is still 181.4MB. Free memory was 159.5MB in the beginning and 149.8MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-09 23:54:00,365 INFO L158 Benchmark]: BuchiAutomizer took 3409.64ms. Allocated memory was 181.4MB in the beginning and 398.5MB in the end (delta: 217.1MB). Free memory was 149.7MB in the beginning and 221.8MB in the end (delta: -72.1MB). Peak memory consumption was 217.6MB. Max. memory is 8.0GB. [2024-02-09 23:54:00,371 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.65ms. Allocated memory is still 181.4MB. Free memory is still 158.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.18ms. Allocated memory is still 181.4MB. Free memory was 157.1MB in the beginning and 155.4MB in the end (delta: 1.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.22ms. Allocated memory is still 181.4MB. Free memory was 155.4MB in the beginning and 159.7MB in the end (delta: -4.3MB). Peak memory consumption was 2.0MB. Max. memory is 8.0GB. * RCFGBuilder took 206.87ms. Allocated memory is still 181.4MB. Free memory was 159.5MB in the beginning and 149.8MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3409.64ms. Allocated memory was 181.4MB in the beginning and 398.5MB in the end (delta: 217.1MB). Free memory was 149.7MB in the beginning and 221.8MB in the end (delta: -72.1MB). Peak memory consumption was 217.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 2 terminating modules (0 trivial, 2 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. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 242 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 240 mSDsluCounter, 334 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 184 IncrementalHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 178 mSDtfsCounter, 184 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital60 mio100 ax100 hnf100 lsp83 ukn90 mio100 lsp89 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 61ms 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-09 23:54:00,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...