/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:28:01,542 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:28:01,585 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 00:28:01,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:28:01,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:28:01,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:28:01,629 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:28:01,629 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:28:01,629 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:28:01,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:28:01,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:28:01,630 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:28:01,631 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:28:01,631 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:28:01,631 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:28:01,631 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:28:01,634 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:28:01,636 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:28:01,637 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:28:01,637 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:28:01,638 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:28:01,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:28:01,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:28:01,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:28:01,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:28:01,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:28:01,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:28:01,640 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:28:01,641 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:28:01,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:28:01,641 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:28:01,642 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:28:01,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:28:01,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:28:01,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:28:01,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:28:01,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:28:01,643 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:28:01,643 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 00:28:01,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:28:01,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:28:01,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:28:01,950 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:28:01,951 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:28:01,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl [2024-02-10 00:28:01,953 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency2.bpl' [2024-02-10 00:28:01,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:28:01,979 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:28:01,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:28:01,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:28:01,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:28:02,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:01" (1/1) ... [2024-02-10 00:28:02,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:01" (1/1) ... [2024-02-10 00:28:02,016 INFO L138 Inliner]: procedures = 3, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 00:28:02,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:28:02,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:28:02,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:28:02,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:28:02,037 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:01" (1/1) ... [2024-02-10 00:28:02,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:01" (1/1) ... [2024-02-10 00:28:02,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:01" (1/1) ... [2024-02-10 00:28:02,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:01" (1/1) ... [2024-02-10 00:28:02,064 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:01" (1/1) ... [2024-02-10 00:28:02,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:01" (1/1) ... [2024-02-10 00:28:02,068 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:01" (1/1) ... [2024-02-10 00:28:02,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:01" (1/1) ... [2024-02-10 00:28:02,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:28:02,071 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:28:02,071 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:28:02,071 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:28:02,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:01" (1/1) ... [2024-02-10 00:28:02,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:02,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:02,110 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 00:28:02,117 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 00:28:02,149 INFO L124 BoogieDeclarations]: Specification and implementation of procedure reader given in one single declaration [2024-02-10 00:28:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2024-02-10 00:28:02,150 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2024-02-10 00:28:02,150 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:28:02,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:28:02,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:28:02,151 INFO L124 BoogieDeclarations]: Specification and implementation of procedure writer given in one single declaration [2024-02-10 00:28:02,151 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2024-02-10 00:28:02,151 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2024-02-10 00:28:02,151 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 00:28:02,204 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:28:02,206 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:28:02,321 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:28:02,327 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:28:02,327 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:28:02,329 INFO L201 PluginConnector]: Adding new model optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:28:02 BoogieIcfgContainer [2024-02-10 00:28:02,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:28:02,329 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:28:02,329 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:28:02,337 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:28:02,338 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:28:02,339 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:28:01" (1/2) ... [2024-02-10 00:28:02,340 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fc1e707 and model type optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:28:02, skipping insertion in model container [2024-02-10 00:28:02,340 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:28:02,340 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:28:02" (2/2) ... [2024-02-10 00:28:02,342 INFO L332 chiAutomizerObserver]: Analyzing ICFG optimistic-concurrency2.bpl [2024-02-10 00:28:02,399 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-02-10 00:28:02,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 43 transitions, 113 flow [2024-02-10 00:28:02,446 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2024-02-10 00:28:02,446 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-10 00:28:02,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 35 events. 4/35 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2024-02-10 00:28:02,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 43 transitions, 113 flow [2024-02-10 00:28:02,458 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 35 transitions, 88 flow [2024-02-10 00:28:02,463 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:28:02,464 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:28:02,464 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:28:02,464 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:28:02,464 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:28:02,464 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:28:02,465 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:28:02,465 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:28:02,465 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:02,466 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 41 places, 35 transitions, 88 flow [2024-02-10 00:28:02,483 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 95 states, 93 states have (on average 1.903225806451613) internal successors, (177), 94 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:02,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 95 states, 93 states have (on average 1.903225806451613) internal successors, (177), 94 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:02,507 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 60 [2024-02-10 00:28:02,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:28:02,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:28:02,512 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:28:02,512 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:02,512 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 41 places, 35 transitions, 88 flow [2024-02-10 00:28:02,523 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 95 states, 93 states have (on average 1.903225806451613) internal successors, (177), 94 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:02,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 95 states, 93 states have (on average 1.903225806451613) internal successors, (177), 94 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:02,528 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 60 [2024-02-10 00:28:02,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:28:02,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:28:02,533 INFO L748 eck$LassoCheckResult]: Stem: Black: 239#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_2) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] 242#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_3) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] 244#[L59]don't care [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] 246#[$Ultimate##0, L59-1]don't care [82] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork1_start_1 v_writerThread1of1ForFork1_j_1) InVars {writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_1, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] 250#[L41-1, L59-1]don't care [2024-02-10 00:28:02,533 INFO L750 eck$LassoCheckResult]: Loop: 250#[L41-1, L59-1]don't care [84] L41-1-->L42: Formula: (< v_writerThread1of1ForFork1_j_5 v_writerThread1of1ForFork1_end_3) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_5, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_3} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_5, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_3} AuxVars[] AssignedVars[] 258#[L42, L59-1]don't care [87] L42-->L43: Formula: (and (<= 0 v_writerThread1of1ForFork1_j_9) (<= v_writerThread1of1ForFork1_j_9 v_N_5)) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_9, N=v_N_5} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_9, N=v_N_5} AuxVars[] AssignedVars[] 270#[L43, L59-1]don't care [88] L43-->L44: Formula: (= (store v_A_3 v_writerThread1of1ForFork1_j_11 0) v_A_2) InVars {A=v_A_3, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_11} OutVars{A=v_A_2, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_11} AuxVars[] AssignedVars[A] 290#[L44, L59-1]don't care [89] L44-->L41-1: Formula: (= v_writerThread1of1ForFork1_j_14 (+ v_writerThread1of1ForFork1_j_13 1)) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_13} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_14} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] 250#[L41-1, L59-1]don't care [2024-02-10 00:28:02,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash 2842782, now seen corresponding path program 1 times [2024-02-10 00:28:02,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:02,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420168879] [2024-02-10 00:28:02,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:02,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:02,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:02,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:02,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:02,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:02,631 INFO L85 PathProgramCache]: Analyzing trace with hash 3512389, now seen corresponding path program 1 times [2024-02-10 00:28:02,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:02,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179638119] [2024-02-10 00:28:02,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:02,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:02,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:02,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:02,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:02,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1146446434, now seen corresponding path program 1 times [2024-02-10 00:28:02,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:02,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166073514] [2024-02-10 00:28:02,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:02,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:02,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:02,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:02,824 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:28:02,825 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:28:02,825 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:28:02,825 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:28:02,825 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:28:02,825 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:02,825 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:28:02,825 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:28:02,826 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:28:02,826 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:28:02,826 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:28:02,838 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 00:28:02,848 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 00:28:02,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:28:02,984 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:28:02,987 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:28:03,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:03,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:03,014 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 00:28:03,036 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 00:28:03,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:03,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:03,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:03,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:03,049 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:03,049 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:03,051 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 00:28:03,075 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:03,087 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 00:28:03,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:03,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:03,097 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 00:28:03,103 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 00:28:03,105 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 00:28:03,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:03,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:28:03,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:03,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:03,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:03,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:28:03,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:28:03,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:03,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-02-10 00:28:03,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:03,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:03,134 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 00:28:03,135 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 00:28:03,137 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 00:28:03,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:03,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:03,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:03,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:03,152 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:03,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:03,173 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:28:03,211 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-02-10 00:28:03,211 INFO L444 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-02-10 00:28:03,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:03,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:03,216 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 00:28:03,220 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:28:03,229 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 00:28:03,237 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:28:03,237 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:28:03,238 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(writerThread1of1ForFork1_j, writerThread1of1ForFork1_end) = -1*writerThread1of1ForFork1_j + 1*writerThread1of1ForFork1_end Supporting invariants [] [2024-02-10 00:28:03,249 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 00:28:03,253 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:28:03,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:03,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:28:03,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:03,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:28:03,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:03,373 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 00:28:03,403 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 00:28:03,404 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 00:28:03,554 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 543 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:28:03,555 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:28:03,555 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:28:03,556 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:28:03,580 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:28:03,580 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:28:03,587 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 00:28:03,595 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 00:28:03,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 209 transitions. [2024-02-10 00:28:03,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 4 letters. Loop has 4 letters. [2024-02-10 00:28:03,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:03,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 8 letters. Loop has 4 letters. [2024-02-10 00:28:03,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:03,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 4 letters. Loop has 8 letters. [2024-02-10 00:28:03,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:03,604 INFO L428 stractBuchiCegarLoop]: Abstraction has has 50 places, 439 transitions, 1975 flow [2024-02-10 00:28:03,604 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:28:03,606 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:03,606 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 50 places, 439 transitions, 1975 flow [2024-02-10 00:28:03,639 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 196 states, 190 states have (on average 2.836842105263158) internal successors, (539), 195 states have internal predecessors, (539), 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 00:28:03,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 196 states, 190 states have (on average 2.836842105263158) internal successors, (539), 195 states have internal predecessors, (539), 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 00:28:03,652 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 40 [2024-02-10 00:28:03,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:28:03,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:28:03,654 INFO L748 eck$LassoCheckResult]: Stem: Black: 479#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_2) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] Black: 482#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_3) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] Black: 487#[L59]don't care [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] 495#[$Ultimate##0, L59-1]don't care [98] L59-1-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_2 2) (= v_readerThread1of1ForFork2_start_4 v_ULTIMATE.start_min2_7) (= v_readerThread1of1ForFork2_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork2_thidvar0_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_16, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_2, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_2, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i, readerThread1of1ForFork2_thidvar0, readerThread1of1ForFork2_start, readerThread1of1ForFork2_thidvar1, readerThread1of1ForFork2_end] 500#[$Ultimate##0, L60, $Ultimate##0]don't care [74] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork2_sum_1 0) InVars {} OutVars{readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] 511#[L60, L27, $Ultimate##0]don't care [75] L27-->L28-1: Formula: (= v_readerThread1of1ForFork2_start_1 v_readerThread1of1ForFork2_i_1) InVars {readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1} OutVars{readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] 534#[L60, L28-1, $Ultimate##0]don't care [2024-02-10 00:28:03,654 INFO L750 eck$LassoCheckResult]: Loop: 534#[L60, L28-1, $Ultimate##0]don't care [77] L28-1-->L29: Formula: (< v_readerThread1of1ForFork2_i_5 v_readerThread1of1ForFork2_end_3) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_5, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_3} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_5, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_3} AuxVars[] AssignedVars[] 589#[L60, L29, $Ultimate##0]don't care [79] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork2_i_7 v_N_1) (<= 0 v_readerThread1of1ForFork2_i_7)) InVars {N=v_N_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_7} OutVars{N=v_N_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_7} AuxVars[] AssignedVars[] 660#[L60, L30, $Ultimate##0]don't care [80] L30-->L31: Formula: (= v_readerThread1of1ForFork2_sum_4 (+ v_readerThread1of1ForFork2_sum_3 (select v_A_1 v_readerThread1of1ForFork2_i_9))) InVars {A=v_A_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_9, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_9, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] 739#[L60, L31, $Ultimate##0]don't care [81] L31-->L28-1: Formula: (= v_readerThread1of1ForFork2_i_12 (+ v_readerThread1of1ForFork2_i_11 1)) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_11} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_12} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] 534#[L60, L28-1, $Ultimate##0]don't care [2024-02-10 00:28:03,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1563036049, now seen corresponding path program 1 times [2024-02-10 00:28:03,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:03,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440807775] [2024-02-10 00:28:03,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:03,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:03,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:03,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:03,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:03,670 INFO L85 PathProgramCache]: Analyzing trace with hash 3295908, now seen corresponding path program 1 times [2024-02-10 00:28:03,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:03,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295612258] [2024-02-10 00:28:03,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:03,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:03,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:03,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:03,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:03,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1054123502, now seen corresponding path program 1 times [2024-02-10 00:28:03,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:03,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664310192] [2024-02-10 00:28:03,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:03,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:03,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:03,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:03,823 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:28:03,824 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:28:03,824 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:28:03,824 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:28:03,824 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:28:03,824 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:03,825 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:28:03,825 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:28:03,825 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:28:03,825 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:28:03,825 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:28:03,827 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 00:28:03,829 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 00:28:03,863 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 00:28:03,866 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 00:28:03,869 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 00:28:03,874 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 00:28:03,983 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:28:03,983 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:28:03,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:03,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:04,002 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 00:28:04,005 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 00:28:04,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:04,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:04,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:04,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:04,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:04,019 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:04,023 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 00:28:04,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:04,061 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 00:28:04,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:04,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:04,063 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 00:28:04,068 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 00:28:04,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:04,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:04,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:04,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:04,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:04,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:04,088 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 00:28:04,102 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:28:04,131 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-02-10 00:28:04,131 INFO L444 ModelExtractionUtils]: 17 out of 28 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-02-10 00:28:04,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:04,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:04,152 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 00:28:04,153 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 00:28:04,154 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:28:04,163 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:28:04,163 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:28:04,164 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(readerThread1of1ForFork2_i, readerThread1of1ForFork2_end) = -1*readerThread1of1ForFork2_i + 1*readerThread1of1ForFork2_end Supporting invariants [] [2024-02-10 00:28:04,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-02-10 00:28:04,171 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:28:04,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:04,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:28:04,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:04,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:28:04,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:04,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-10 00:28:04,262 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 00:28:04,267 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 00:28:04,268 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 00:28:04,268 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:04,385 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 543 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:28:04,385 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:28:04,385 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:28:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 543 transitions. [2024-02-10 00:28:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 543 transitions. [2024-02-10 00:28:04,391 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:28:04,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 543 transitions. [2024-02-10 00:28:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 543 transitions. [2024-02-10 00:28:04,631 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:28:04,632 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:28:04,632 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 00:28:04,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:28:04,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 209 transitions. [2024-02-10 00:28:04,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 6 letters. Loop has 4 letters. [2024-02-10 00:28:04,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:04,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 10 letters. Loop has 4 letters. [2024-02-10 00:28:04,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:04,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 209 transitions. Stem has 6 letters. Loop has 8 letters. [2024-02-10 00:28:04,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:04,634 INFO L428 stractBuchiCegarLoop]: Abstraction has has 63 places, 7164 transitions, 46434 flow [2024-02-10 00:28:04,634 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:28:04,634 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:04,634 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 63 places, 7164 transitions, 46434 flow [2024-02-10 00:28:04,913 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 489 states, 453 states have (on average 3.8057395143487858) internal successors, (1724), 488 states have internal predecessors, (1724), 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 00:28:04,914 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 489 states, 453 states have (on average 3.8057395143487858) internal successors, (1724), 488 states have internal predecessors, (1724), 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 00:28:04,922 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-02-10 00:28:04,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:28:04,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:28:04,924 INFO L748 eck$LassoCheckResult]: Stem: Black: 1033#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_2) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] Black: 1036#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_3) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] Black: 1048#[L59]don't care [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] Black: 1062#[L59-1, $Ultimate##0]don't care [98] L59-1-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_2 2) (= v_readerThread1of1ForFork2_start_4 v_ULTIMATE.start_min2_7) (= v_readerThread1of1ForFork2_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork2_thidvar0_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_16, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_2, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_2, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i, readerThread1of1ForFork2_thidvar0, readerThread1of1ForFork2_start, readerThread1of1ForFork2_thidvar1, readerThread1of1ForFork2_end] Black: 1076#[L60, $Ultimate##0, $Ultimate##0]don't care [82] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork1_start_1 v_writerThread1of1ForFork1_j_1) InVars {writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_1, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] Black: 1108#[L60, $Ultimate##0, L41-1]don't care [83] L41-1-->writerFINAL: Formula: (<= v_writerThread1of1ForFork1_end_1 v_writerThread1of1ForFork1_j_3) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_3, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_3, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_1} AuxVars[] AssignedVars[] Black: 1170#[L60, $Ultimate##0, writerFINAL]don't care [85] writerFINAL-->writerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] Black: 1318#[writerEXIT, L60, $Ultimate##0]don't care [99] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork1_thidvar0_4 1) InVars {writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} OutVars{writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] Black: 1524#[$Ultimate##0, L61]don't care [74] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork2_sum_1 0) InVars {} OutVars{readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] Black: 1588#[L27, L61]don't care [75] L27-->L28-1: Formula: (= v_readerThread1of1ForFork2_start_1 v_readerThread1of1ForFork2_i_1) InVars {readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1} OutVars{readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] Black: 1823#[L28-1, L61]don't care [76] L28-1-->readerFINAL: Formula: (<= v_readerThread1of1ForFork2_end_1 v_readerThread1of1ForFork2_i_3) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_3, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_1} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_3, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_1} AuxVars[] AssignedVars[] Black: 1970#[L61, readerFINAL]don't care [78] readerFINAL-->readerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] Black: 2127#[readerEXIT, L61]don't care [100] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_4 2) (= v_readerThread1of1ForFork2_thidvar0_4 2) (= v_readerThread1of1ForFork2_sum_10 v_ULTIMATE.start_sum_2)) InVars {readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] 2228#[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: 2267#[L67]don't care [92] L67-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_2 2) (= v_readerThread1of1ForFork0_thidvar1_2 2) (= v_readerThread1of1ForFork0_start_4 v_ULTIMATE.start_min2_5) (= v_readerThread1of1ForFork0_end_6 v_ULTIMATE.start_max2_5)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_4, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_8, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_16, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork0_start, readerThread1of1ForFork0_sum, readerThread1of1ForFork0_i, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_end] 2298#[$Ultimate##0, L67-1]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: 2323#[L67-1, 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] 2340#[L67-1, L28-1]don't care [2024-02-10 00:28:04,924 INFO L750 eck$LassoCheckResult]: Loop: 2340#[L67-1, L28-1]don't care [69] L28-1-->L29: Formula: (< v_readerThread1of1ForFork0_i_5 v_readerThread1of1ForFork0_end_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} AuxVars[] AssignedVars[] Black: 2363#[L29, L67-1]don't care [71] L29-->L30: Formula: (and (<= 0 v_readerThread1of1ForFork0_i_7) (<= v_readerThread1of1ForFork0_i_7 v_N_1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_7, N=v_N_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_7, N=v_N_1} AuxVars[] AssignedVars[] 2396#[L67-1, L30]don't care [72] L30-->L31: Formula: (= (+ (select v_A_1 v_readerThread1of1ForFork0_i_9) v_readerThread1of1ForFork0_sum_3) v_readerThread1of1ForFork0_sum_4) InVars {A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum] Black: 2407#[L67-1, L31]don't care [73] L31-->L28-1: Formula: (= v_readerThread1of1ForFork0_i_12 (+ v_readerThread1of1ForFork0_i_11 1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_12} AuxVars[] AssignedVars[readerThread1of1ForFork0_i] 2340#[L67-1, L28-1]don't care [2024-02-10 00:28:04,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:04,925 INFO L85 PathProgramCache]: Analyzing trace with hash -456616892, now seen corresponding path program 1 times [2024-02-10 00:28:04,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:04,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032459504] [2024-02-10 00:28:04,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:04,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:04,943 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:04,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:04,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:04,951 INFO L85 PathProgramCache]: Analyzing trace with hash 3049636, now seen corresponding path program 1 times [2024-02-10 00:28:04,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:04,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775560653] [2024-02-10 00:28:04,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:04,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:04,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:04,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:04,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:04,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1782399847, now seen corresponding path program 1 times [2024-02-10 00:28:04,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:04,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605449701] [2024-02-10 00:28:04,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:04,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:05,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:05,157 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 00:28:05,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 00:28:05,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605449701] [2024-02-10 00:28:05,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605449701] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 00:28:05,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 00:28:05,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-02-10 00:28:05,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009006850] [2024-02-10 00:28:05,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 00:28:05,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 00:28:05,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-10 00:28:05,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-02-10 00:28:05,718 INFO L175 Difference]: Start difference. First operand has 63 places, 7164 transitions, 46434 flow. Second operand 15 states and 645 transitions. [2024-02-10 00:28:05,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 7164 transitions, 46434 flow. Second operand 15 states and 645 transitions. [2024-02-10 00:28:05,722 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 43 [2024-02-10 00:28:05,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 00:28:06,231 INFO L124 PetriNetUnfolderBase]: 2129/2970 cut-off events. [2024-02-10 00:28:06,231 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2024-02-10 00:28:06,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10074 conditions, 2970 events. 2129/2970 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10893 event pairs, 0 based on Foata normal form. 0/1119 useless extension candidates. Maximal degree in co-relation 9397. Up to 959 conditions per place. [2024-02-10 00:28:06,255 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 181 selfloop transitions, 130 changer transitions 28/890 dead transitions. [2024-02-10 00:28:06,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 890 transitions, 6336 flow [2024-02-10 00:28:06,263 INFO L231 Difference]: Finished difference. Result has 82 places, 818 transitions, 5925 flow [2024-02-10 00:28:06,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-10 00:28:06,265 INFO L428 stractBuchiCegarLoop]: Abstraction has has 82 places, 818 transitions, 5925 flow [2024-02-10 00:28:06,265 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 00:28:06,265 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:06,265 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 82 places, 818 transitions, 5925 flow [2024-02-10 00:28:06,393 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 809 states, 753 states have (on average 3.857901726427623) internal successors, (2905), 808 states have internal predecessors, (2905), 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 00:28:06,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 809 states, 753 states have (on average 3.857901726427623) internal successors, (2905), 808 states have internal predecessors, (2905), 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 00:28:06,404 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-02-10 00:28:06,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:28:06,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:28:06,406 INFO L748 eck$LassoCheckResult]: Stem: Black: 2462#[$Ultimate##0]don't care [63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_2) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, N=v_N_2, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3} AuxVars[] AssignedVars[] Black: 2465#[L56]don't care [41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_3) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_3, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[] Black: 2477#[L59]don't care [95] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork1_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork1_start_4 v_ULTIMATE.start_min1_5) (= v_writerThread1of1ForFork1_thidvar0_2 1)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_18, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_4, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_6, writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork1_j, writerThread1of1ForFork1_start, writerThread1of1ForFork1_end, writerThread1of1ForFork1_thidvar0] Black: 2491#[$Ultimate##0, L59-1]don't care [98] L59-1-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_2 2) (= v_readerThread1of1ForFork2_start_4 v_ULTIMATE.start_min2_7) (= v_readerThread1of1ForFork2_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork2_thidvar0_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_8, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_16, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_2, readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_2, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum, readerThread1of1ForFork2_i, readerThread1of1ForFork2_thidvar0, readerThread1of1ForFork2_start, readerThread1of1ForFork2_thidvar1, readerThread1of1ForFork2_end] Black: 2505#[$Ultimate##0, L60, $Ultimate##0]don't care [82] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork1_start_1 v_writerThread1of1ForFork1_j_1) InVars {writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_1, writerThread1of1ForFork1_start=v_writerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork1_j] Black: 2525#[L60, L41-1, $Ultimate##0]don't care [83] L41-1-->writerFINAL: Formula: (<= v_writerThread1of1ForFork1_end_1 v_writerThread1of1ForFork1_j_3) InVars {writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_3, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_1} OutVars{writerThread1of1ForFork1_j=v_writerThread1of1ForFork1_j_3, writerThread1of1ForFork1_end=v_writerThread1of1ForFork1_end_1} AuxVars[] AssignedVars[] Black: 2596#[L60, writerFINAL, $Ultimate##0]don't care [85] writerFINAL-->writerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] Black: 2698#[L60, writerEXIT, $Ultimate##0]don't care [99] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork1_thidvar0_4 1) InVars {writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} OutVars{writerThread1of1ForFork1_thidvar0=v_writerThread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] Black: 2823#[L61, $Ultimate##0]don't care [74] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork2_sum_1 0) InVars {} OutVars{readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] Black: 2981#[L27, L61]don't care [75] L27-->L28-1: Formula: (= v_readerThread1of1ForFork2_start_1 v_readerThread1of1ForFork2_i_1) InVars {readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1} OutVars{readerThread1of1ForFork2_start=v_readerThread1of1ForFork2_start_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_1} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] Black: 3203#[L61, L28-1]don't care [77] L28-1-->L29: Formula: (< v_readerThread1of1ForFork2_i_5 v_readerThread1of1ForFork2_end_3) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_5, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_3} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_5, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_3} AuxVars[] AssignedVars[] Black: 3416#[L61, L29]don't care [79] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork2_i_7 v_N_1) (<= 0 v_readerThread1of1ForFork2_i_7)) InVars {N=v_N_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_7} OutVars{N=v_N_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_7} AuxVars[] AssignedVars[] Black: 3603#[L61, L30]don't care [80] L30-->L31: Formula: (= v_readerThread1of1ForFork2_sum_4 (+ v_readerThread1of1ForFork2_sum_3 (select v_A_1 v_readerThread1of1ForFork2_i_9))) InVars {A=v_A_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_9, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_9, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork2_sum] Black: 3797#[L61, L31]don't care [81] L31-->L28-1: Formula: (= v_readerThread1of1ForFork2_i_12 (+ v_readerThread1of1ForFork2_i_11 1)) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_11} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_12} AuxVars[] AssignedVars[readerThread1of1ForFork2_i] Black: 4041#[L61, L28-1]don't care [76] L28-1-->readerFINAL: Formula: (<= v_readerThread1of1ForFork2_end_1 v_readerThread1of1ForFork2_i_3) InVars {readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_3, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_1} OutVars{readerThread1of1ForFork2_i=v_readerThread1of1ForFork2_i_3, readerThread1of1ForFork2_end=v_readerThread1of1ForFork2_end_1} AuxVars[] AssignedVars[] Black: 4236#[L61, readerFINAL]don't care [78] readerFINAL-->readerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] Black: 4406#[readerEXIT, L61]don't care [100] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork2_thidvar1_4 2) (= v_readerThread1of1ForFork2_thidvar0_4 2) (= v_readerThread1of1ForFork2_sum_10 v_ULTIMATE.start_sum_2)) InVars {readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork2_sum=v_readerThread1of1ForFork2_sum_10, readerThread1of1ForFork2_thidvar0=v_readerThread1of1ForFork2_thidvar0_4, readerThread1of1ForFork2_thidvar1=v_readerThread1of1ForFork2_thidvar1_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] Black: 4518#[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: 4580#[L67]don't care [92] L67-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_2 2) (= v_readerThread1of1ForFork0_thidvar1_2 2) (= v_readerThread1of1ForFork0_start_4 v_ULTIMATE.start_min2_5) (= v_readerThread1of1ForFork0_end_6 v_ULTIMATE.start_max2_5)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_4, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_8, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_16, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork0_start, readerThread1of1ForFork0_sum, readerThread1of1ForFork0_i, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_end] Black: 4612#[$Ultimate##0, L67-1]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: 4637#[L67-1, 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] 4656#[L28-1, L67-1]don't care [2024-02-10 00:28:06,406 INFO L750 eck$LassoCheckResult]: Loop: 4656#[L28-1, L67-1]don't care [69] L28-1-->L29: Formula: (< v_readerThread1of1ForFork0_i_5 v_readerThread1of1ForFork0_end_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} AuxVars[] AssignedVars[] Black: 4679#[L67-1, L29]don't care [71] L29-->L30: Formula: (and (<= 0 v_readerThread1of1ForFork0_i_7) (<= v_readerThread1of1ForFork0_i_7 v_N_1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_7, N=v_N_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_7, N=v_N_1} AuxVars[] AssignedVars[] 4712#[L30, L67-1]don't care [72] L30-->L31: Formula: (= (+ (select v_A_1 v_readerThread1of1ForFork0_i_9) v_readerThread1of1ForFork0_sum_3) v_readerThread1of1ForFork0_sum_4) InVars {A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum] Black: 4731#[L31, L67-1]don't care [73] L31-->L28-1: Formula: (= v_readerThread1of1ForFork0_i_12 (+ v_readerThread1of1ForFork0_i_11 1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_12} AuxVars[] AssignedVars[readerThread1of1ForFork0_i] 4656#[L28-1, L67-1]don't care [2024-02-10 00:28:06,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:06,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1133404865, now seen corresponding path program 1 times [2024-02-10 00:28:06,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:06,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430138675] [2024-02-10 00:28:06,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:06,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:06,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:06,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:06,439 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:06,439 INFO L85 PathProgramCache]: Analyzing trace with hash 3049636, now seen corresponding path program 2 times [2024-02-10 00:28:06,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:06,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245217154] [2024-02-10 00:28:06,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:06,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:06,459 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:06,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:06,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:06,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1011714916, now seen corresponding path program 1 times [2024-02-10 00:28:06,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:28:06,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464493691] [2024-02-10 00:28:06,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:28:06,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:28:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:06,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:28:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:28:06,484 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:28:06,719 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:28:06,719 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:28:06,719 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:28:06,719 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:28:06,719 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:28:06,719 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:06,719 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:28:06,720 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:28:06,720 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency2.bpl_BEv2_Iteration4_Lasso [2024-02-10 00:28:06,720 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:28:06,720 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:28:06,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:28:06,723 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 00:28:06,796 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 00:28:06,798 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 00:28:06,800 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 00:28:06,802 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 00:28:06,961 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:28:06,961 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:28:06,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:06,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:06,962 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 00:28:06,967 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 00:28:06,968 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 00:28:06,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:06,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:06,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:06,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:06,979 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:06,979 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:06,992 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:07,006 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 00:28:07,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:07,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:07,008 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 00:28:07,014 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 00:28:07,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:07,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:07,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:07,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:07,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:07,026 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:07,030 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 00:28:07,037 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:28:07,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-10 00:28:07,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:07,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:07,044 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 00:28:07,052 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 00:28:07,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:28:07,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:28:07,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:28:07,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:28:07,064 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 00:28:07,069 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:28:07,069 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:28:07,085 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:28:07,099 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-02-10 00:28:07,099 INFO L444 ModelExtractionUtils]: 34 out of 46 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-02-10 00:28:07,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:28:07,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:28:07,100 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 00:28:07,105 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:28:07,113 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 00:28:07,121 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:28:07,121 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:28:07,121 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(readerThread1of1ForFork0_i, N) = -2*readerThread1of1ForFork0_i + 2*N + 1 Supporting invariants [] [2024-02-10 00:28:07,128 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 00:28:07,129 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:28:07,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:28:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:07,151 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:28:07,152 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:28:07,175 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:28:07,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:28:07,189 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 00:28:07,190 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 00:28:07,190 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 00:28:07,252 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 8 states and 502 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:28:07,253 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:28:07,253 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:28:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 502 transitions. [2024-02-10 00:28:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 502 transitions. [2024-02-10 00:28:07,254 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:28:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states and 502 transitions. [2024-02-10 00:28:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 502 transitions. [2024-02-10 00:28:07,359 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 00:28:07,658 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:28:07,659 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:28:07,659 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 00:28:07,660 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 00:28:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2024-02-10 00:28:07,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 166 transitions. Stem has 21 letters. Loop has 4 letters. [2024-02-10 00:28:07,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:07,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 166 transitions. Stem has 25 letters. Loop has 4 letters. [2024-02-10 00:28:07,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:07,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 166 transitions. Stem has 21 letters. Loop has 8 letters. [2024-02-10 00:28:07,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:28:07,661 INFO L428 stractBuchiCegarLoop]: Abstraction has has 94 places, 12718 transitions, 116576 flow [2024-02-10 00:28:07,661 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-02-10 00:28:07,661 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:28:07,661 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 94 places, 12718 transitions, 116576 flow [2024-02-10 00:28:09,961 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1753 states, 1594 states have (on average 5.5357590966122965) internal successors, (8824), 1752 states have internal predecessors, (8824), 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 00:28:09,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1753 states, 1594 states have (on average 5.5357590966122965) internal successors, (8824), 1752 states have internal predecessors, (8824), 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 00:28:09,980 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-10 00:28:09,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-10 00:28:09,986 INFO L201 PluginConnector]: Adding new model optimistic-concurrency2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:28:09 BoogieIcfgContainer [2024-02-10 00:28:09,986 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:28:09,987 INFO L158 Benchmark]: Toolchain (without parser) took 8007.62ms. Allocated memory was 197.1MB in the beginning and 700.4MB in the end (delta: 503.3MB). Free memory was 174.4MB in the beginning and 431.6MB in the end (delta: -257.2MB). Peak memory consumption was 423.0MB. Max. memory is 8.0GB. [2024-02-10 00:28:09,987 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.73ms. Allocated memory is still 197.1MB. Free memory is still 175.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:28:09,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.42ms. Allocated memory is still 197.1MB. Free memory was 174.4MB in the beginning and 172.8MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-02-10 00:28:09,988 INFO L158 Benchmark]: Boogie Preprocessor took 51.58ms. Allocated memory is still 197.1MB. Free memory was 172.8MB in the beginning and 175.6MB in the end (delta: -2.8MB). Peak memory consumption was 1.4MB. Max. memory is 8.0GB. [2024-02-10 00:28:09,988 INFO L158 Benchmark]: RCFGBuilder took 258.12ms. Allocated memory is still 197.1MB. Free memory was 175.4MB in the beginning and 165.8MB in the end (delta: 9.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-10 00:28:09,988 INFO L158 Benchmark]: BuchiAutomizer took 7656.81ms. Allocated memory was 197.1MB in the beginning and 700.4MB in the end (delta: 503.3MB). Free memory was 165.6MB in the beginning and 431.6MB in the end (delta: -266.0MB). Peak memory consumption was 414.3MB. Max. memory is 8.0GB. [2024-02-10 00:28:09,989 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.73ms. Allocated memory is still 197.1MB. Free memory is still 175.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.42ms. Allocated memory is still 197.1MB. Free memory was 174.4MB in the beginning and 172.8MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.58ms. Allocated memory is still 197.1MB. Free memory was 172.8MB in the beginning and 175.6MB in the end (delta: -2.8MB). Peak memory consumption was 1.4MB. Max. memory is 8.0GB. * RCFGBuilder took 258.12ms. Allocated memory is still 197.1MB. Free memory was 175.4MB in the beginning and 165.8MB in the end (delta: 9.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 7656.81ms. Allocated memory was 197.1MB in the beginning and 700.4MB in the end (delta: 503.3MB). Free memory was 165.6MB in the beginning and 431.6MB in the end (delta: -266.0MB). Peak memory consumption was 414.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function end + -1 * j and consists of 5 locations. One deterministic module has affine ranking function end + -1 * i and consists of 5 locations. One deterministic module has affine ranking function 2 * N + -2 * i + 1 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 2.2s. Construction of modules took 0.4s. Büchi inclusion checks took 1.9s. 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, 638 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 635 mSDsluCounter, 1475 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 947 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 954 IncrementalHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 528 mSDtfsCounter, 954 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital70 mio100 ax100 hnf100 lsp83 ukn92 mio100 lsp87 div100 bol100 ite100 ukn100 eq160 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 86ms 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 00:28:10,002 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...