/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:12:37,340 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:12:37,388 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:12:37,411 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:12:37,412 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:12:37,412 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:12:37,413 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:12:37,413 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:12:37,413 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:12:37,414 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:12:37,414 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:12:37,414 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:12:37,414 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:12:37,415 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:12:37,415 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:12:37,415 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:12:37,415 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:12:37,416 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:12:37,416 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:12:37,416 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:12:37,419 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:12:37,419 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:12:37,419 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:12:37,420 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:12:37,420 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:12:37,421 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:12:37,421 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:12:37,422 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:12:37,422 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:12:37,423 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:12:37,423 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:12:37,424 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:12:37,424 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:12:37,425 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:12:37,425 INFO L137 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_AUTOMATON [2023-10-12 17:12:37,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:12:37,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:12:37,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:12:37,660 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:12:37,660 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:12:37,661 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency1.bpl [2023-10-12 17:12:37,662 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency1.bpl' [2023-10-12 17:12:37,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:12:37,695 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:12:37,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:37,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:12:37,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:12:37,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:37" (1/1) ... [2023-10-12 17:12:37,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:37" (1/1) ... [2023-10-12 17:12:37,726 INFO L138 Inliner]: procedures = 3, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:12:37,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:37,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:12:37,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:12:37,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:12:37,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:37" (1/1) ... [2023-10-12 17:12:37,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:37" (1/1) ... [2023-10-12 17:12:37,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:37" (1/1) ... [2023-10-12 17:12:37,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:37" (1/1) ... [2023-10-12 17:12:37,739 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:37" (1/1) ... [2023-10-12 17:12:37,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:37" (1/1) ... [2023-10-12 17:12:37,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:37" (1/1) ... [2023-10-12 17:12:37,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:37" (1/1) ... [2023-10-12 17:12:37,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:12:37,748 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:12:37,748 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:12:37,748 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:12:37,749 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:37" (1/1) ... [2023-10-12 17:12:37,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:37,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:37,777 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) [2023-10-12 17:12:37,795 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 [2023-10-12 17:12:37,814 INFO L124 BoogieDeclarations]: Specification and implementation of procedure reader given in one single declaration [2023-10-12 17:12:37,814 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-10-12 17:12:37,814 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-10-12 17:12:37,814 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:12:37,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:12:37,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:12:37,814 INFO L124 BoogieDeclarations]: Specification and implementation of procedure writer given in one single declaration [2023-10-12 17:12:37,814 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-10-12 17:12:37,814 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-10-12 17:12:37,815 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:12:37,855 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:12:37,856 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:12:37,942 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:12:37,947 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:12:37,947 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:12:37,949 INFO L201 PluginConnector]: Adding new model optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:37 BoogieIcfgContainer [2023-10-12 17:12:37,949 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:12:37,950 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:12:37,950 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:12:37,957 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:12:37,958 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:37,958 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:37" (1/2) ... [2023-10-12 17:12:37,959 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@74778131 and model type optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:12:37, skipping insertion in model container [2023-10-12 17:12:37,959 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:37,959 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:37" (2/2) ... [2023-10-12 17:12:37,961 INFO L332 chiAutomizerObserver]: Analyzing ICFG optimistic-concurrency1.bpl [2023-10-12 17:12:38,027 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2023-10-12 17:12:38,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 44 transitions, 118 flow [2023-10-12 17:12:38,071 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2023-10-12 17:12:38,071 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:12:38,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 4/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2023-10-12 17:12:38,075 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 44 transitions, 118 flow [2023-10-12 17:12:38,078 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 36 transitions, 90 flow [2023-10-12 17:12:38,081 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:12:38,091 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 36 transitions, 90 flow [2023-10-12 17:12:38,093 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 36 transitions, 90 flow [2023-10-12 17:12:38,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 90 flow [2023-10-12 17:12:38,101 INFO L124 PetriNetUnfolderBase]: 4/36 cut-off events. [2023-10-12 17:12:38,101 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:12:38,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 4/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 48 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 31. Up to 2 conditions per place. [2023-10-12 17:12:38,102 INFO L119 LiptonReduction]: Number of co-enabled transitions 158 [2023-10-12 17:12:38,556 INFO L134 LiptonReduction]: Checked pairs total: 121 [2023-10-12 17:12:38,556 INFO L136 LiptonReduction]: Total number of compositions: 18 [2023-10-12 17:12:38,570 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:12:38,570 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:12:38,570 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:12:38,570 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:12:38,570 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:12:38,570 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:12:38,570 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:12:38,571 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:12:38,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:12:38,596 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2023-10-12 17:12:38,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:38,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:38,600 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:12:38,600 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:38,600 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:12:38,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 28 states, but on-demand construction may add more states [2023-10-12 17:12:38,602 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2023-10-12 17:12:38,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:38,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:38,602 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:12:38,602 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:38,606 INFO L748 eck$LassoCheckResult]: Stem: 48#[$Ultimate##0]don't care [116] $Ultimate##0-->L59: Formula: (and (<= 0 v_ULTIMATE.start_min2_8) (<= v_ULTIMATE.start_max2_8 v_N_16) (<= v_ULTIMATE.start_max1_6 v_N_16) (<= 0 v_ULTIMATE.start_min1_6)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_16, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_16, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} AuxVars[] AssignedVars[] 51#[L59]don't care [99] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] 53#[L59-1, $Ultimate##0]don't care [84] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork2_j_1 v_writerThread1of1ForFork2_start_1) InVars {writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_1, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork2_j] 55#[L59-1, L41-1]don't care [2023-10-12 17:12:38,606 INFO L750 eck$LassoCheckResult]: Loop: 55#[L59-1, L41-1]don't care [122] L41-1-->L41-1: Formula: (and (<= v_writerThread1of1ForFork2_j_28 v_N_28) (<= 0 v_writerThread1of1ForFork2_j_28) (= v_writerThread1of1ForFork2_j_27 (+ v_writerThread1of1ForFork2_j_28 1)) (< v_writerThread1of1ForFork2_j_28 v_writerThread1of1ForFork2_end_13) (= v_A_30 (store v_A_31 v_writerThread1of1ForFork2_j_28 0))) InVars {A=v_A_31, N=v_N_28, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_28, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_13} OutVars{A=v_A_30, N=v_N_28, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_27, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_13} AuxVars[] AssignedVars[A, writerThread1of1ForFork2_j] 55#[L59-1, L41-1]don't care [2023-10-12 17:12:38,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:38,609 INFO L85 PathProgramCache]: Analyzing trace with hash 144420, now seen corresponding path program 1 times [2023-10-12 17:12:38,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:38,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902984277] [2023-10-12 17:12:38,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:38,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:38,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:38,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:38,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:38,720 INFO L85 PathProgramCache]: Analyzing trace with hash 153, now seen corresponding path program 1 times [2023-10-12 17:12:38,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:38,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669927144] [2023-10-12 17:12:38,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:38,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:38,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:38,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:38,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:38,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:38,746 INFO L85 PathProgramCache]: Analyzing trace with hash 4477142, now seen corresponding path program 1 times [2023-10-12 17:12:38,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:38,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192541989] [2023-10-12 17:12:38,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:38,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:38,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:38,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:38,870 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:38,871 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:38,871 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:38,871 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:38,871 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:38,871 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:38,871 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:38,871 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:38,871 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:12:38,871 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:38,872 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:38,884 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:38,903 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:38,923 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:38,981 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:38,984 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:38,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:38,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:38,997 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) [2023-10-12 17:12:39,004 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 [2023-10-12 17:12:39,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:39,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:39,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:39,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:39,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:39,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:39,025 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 [2023-10-12 17:12:39,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:39,047 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 [2023-10-12 17:12:39,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:39,048 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) [2023-10-12 17:12:39,051 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 [2023-10-12 17:12:39,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 [2023-10-12 17:12:39,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:39,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:39,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:39,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:39,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:39,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:39,092 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:39,107 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:12:39,108 INFO L444 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2023-10-12 17:12:39,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:39,121 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) [2023-10-12 17:12:39,122 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 [2023-10-12 17:12:39,125 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:39,146 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:39,146 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:39,147 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(writerThread1of1ForFork2_j, writerThread1of1ForFork2_end) = -1*writerThread1of1ForFork2_j + 1*writerThread1of1ForFork2_end Supporting invariants [] [2023-10-12 17:12:39,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:39,153 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:39,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:39,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:39,189 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:39,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:39,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:39,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:39,228 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:12:39,230 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 28 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2023-10-12 17:12:39,293 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 28 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 66 states and 142 transitions. Complement of second has 4 states. [2023-10-12 17:12:39,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2023-10-12 17:12:39,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2023-10-12 17:12:39,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:12:39,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:39,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:12:39,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:39,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:12:39,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:39,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 142 transitions. [2023-10-12 17:12:39,323 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2023-10-12 17:12:39,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 36 states and 79 transitions. [2023-10-12 17:12:39,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2023-10-12 17:12:39,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-10-12 17:12:39,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 79 transitions. [2023-10-12 17:12:39,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:39,331 INFO L219 hiAutomatonCegarLoop]: Abstraction has 36 states and 79 transitions. [2023-10-12 17:12:39,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 79 transitions. [2023-10-12 17:12:39,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2023-10-12 17:12:39,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.225806451612903) internal successors, (69), 30 states have internal predecessors, (69), 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) [2023-10-12 17:12:39,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 69 transitions. [2023-10-12 17:12:39,350 INFO L241 hiAutomatonCegarLoop]: Abstraction has 31 states and 69 transitions. [2023-10-12 17:12:39,351 INFO L430 stractBuchiCegarLoop]: Abstraction has 31 states and 69 transitions. [2023-10-12 17:12:39,352 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:12:39,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 69 transitions. [2023-10-12 17:12:39,357 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 5 [2023-10-12 17:12:39,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:39,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:39,360 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:12:39,360 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:39,360 INFO L748 eck$LassoCheckResult]: Stem: 261#[$Ultimate##0]don't care [116] $Ultimate##0-->L59: Formula: (and (<= 0 v_ULTIMATE.start_min2_8) (<= v_ULTIMATE.start_max2_8 v_N_16) (<= v_ULTIMATE.start_max1_6 v_N_16) (<= 0 v_ULTIMATE.start_min1_6)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_16, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_16, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} AuxVars[] AssignedVars[] 225#[L59]don't care [99] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] 203#[L59-1, $Ultimate##0]don't care [93] L59-1-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_2 2) (= v_readerThread1of1ForFork0_thidvar1_2 2) (= v_readerThread1of1ForFork0_start_4 v_ULTIMATE.start_min2_5) (= v_readerThread1of1ForFork0_end_6 v_ULTIMATE.start_max2_5)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_4, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_8, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_18, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork0_start, readerThread1of1ForFork0_sum, readerThread1of1ForFork0_i, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_end] 207#[L60, $Ultimate##0, $Ultimate##0]don't care [115] $Ultimate##0-->L28-1: Formula: (and (= v_readerThread1of1ForFork0_i_31 v_readerThread1of1ForFork0_start_5) (= v_readerThread1of1ForFork0_sum_21 0)) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5} OutVars{readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_31, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_21} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 227#[L28-1, L60, $Ultimate##0]don't care [2023-10-12 17:12:39,360 INFO L750 eck$LassoCheckResult]: Loop: 227#[L28-1, L60, $Ultimate##0]don't care [120] L28-1-->L28-1: Formula: (and (= v_readerThread1of1ForFork0_i_33 (+ v_readerThread1of1ForFork0_i_34 1)) (< v_readerThread1of1ForFork0_i_34 v_readerThread1of1ForFork0_end_13) (= (+ v_readerThread1of1ForFork0_sum_24 (select v_A_22 v_readerThread1of1ForFork0_i_34)) v_readerThread1of1ForFork0_sum_23) (<= v_readerThread1of1ForFork0_i_34 v_N_22) (<= 0 v_readerThread1of1ForFork0_i_34)) InVars {A=v_A_22, N=v_N_22, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_34, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_24, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_13} OutVars{A=v_A_22, N=v_N_22, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_33, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_23, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_13} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 227#[L28-1, L60, $Ultimate##0]don't care [2023-10-12 17:12:39,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:39,361 INFO L85 PathProgramCache]: Analyzing trace with hash 4477414, now seen corresponding path program 1 times [2023-10-12 17:12:39,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:39,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675340453] [2023-10-12 17:12:39,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:39,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,366 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:39,370 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:39,370 INFO L85 PathProgramCache]: Analyzing trace with hash 151, now seen corresponding path program 1 times [2023-10-12 17:12:39,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:39,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972870407] [2023-10-12 17:12:39,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:39,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:39,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:39,383 INFO L85 PathProgramCache]: Analyzing trace with hash 138799954, now seen corresponding path program 1 times [2023-10-12 17:12:39,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:39,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065996175] [2023-10-12 17:12:39,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:39,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,396 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:39,509 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:39,509 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:39,509 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:39,509 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:39,509 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:39,509 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,509 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:39,509 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:39,509 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:12:39,509 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:39,510 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:39,511 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:39,514 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:39,517 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:39,519 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:39,522 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:39,549 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:39,650 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:39,650 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:39,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:39,652 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) [2023-10-12 17:12:39,659 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 [2023-10-12 17:12:39,670 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 [2023-10-12 17:12:39,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:39,676 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:39,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:39,676 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:39,678 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:39,678 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:39,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:39,695 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 [2023-10-12 17:12:39,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:39,697 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) [2023-10-12 17:12:39,699 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 [2023-10-12 17:12:39,700 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 [2023-10-12 17:12:39,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:39,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:39,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:39,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:39,708 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:39,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:39,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:39,722 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 [2023-10-12 17:12:39,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:39,724 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) [2023-10-12 17:12:39,743 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 [2023-10-12 17:12:39,744 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 [2023-10-12 17:12:39,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:39,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:12:39,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:39,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:39,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:39,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:12:39,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:12:39,758 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:39,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:39,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:39,763 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) [2023-10-12 17:12:39,773 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 [2023-10-12 17:12:39,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:39,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:39,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:39,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:39,781 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:39,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:39,785 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 [2023-10-12 17:12:39,805 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:39,810 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 [2023-10-12 17:12:39,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:39,812 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) [2023-10-12 17:12:39,815 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 [2023-10-12 17:12:39,816 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 [2023-10-12 17:12:39,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:39,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:39,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:39,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:39,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:39,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:39,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:39,840 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 [2023-10-12 17:12:39,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:39,845 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) [2023-10-12 17:12:39,850 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 [2023-10-12 17:12:39,858 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:39,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:39,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:39,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:39,849 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 [2023-10-12 17:12:39,866 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:39,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:39,881 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:39,893 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2023-10-12 17:12:39,893 INFO L444 ModelExtractionUtils]: 9 out of 28 variables were initially zero. Simplification set additionally 16 variables to zero. [2023-10-12 17:12:39,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:39,903 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) [2023-10-12 17:12:39,907 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 [2023-10-12 17:12:39,915 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:39,921 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:39,922 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:39,922 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(readerThread1of1ForFork0_i, readerThread1of1ForFork0_end) = -1*readerThread1of1ForFork0_i + 1*readerThread1of1ForFork0_end Supporting invariants [] [2023-10-12 17:12:39,925 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 [2023-10-12 17:12:39,926 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:39,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:39,977 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:40,025 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 [2023-10-12 17:12:40,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:40,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:40,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:40,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:40,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:40,037 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:12:40,038 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 69 transitions. cyclomatic complexity: 47 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-10-12 17:12:40,074 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 69 transitions. cyclomatic complexity: 47. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 66 states and 155 transitions. Complement of second has 4 states. [2023-10-12 17:12:40,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-10-12 17:12:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2023-10-12 17:12:40,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:12:40,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:40,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:12:40,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:40,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:12:40,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:40,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 155 transitions. [2023-10-12 17:12:40,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:12:40,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 51 states and 118 transitions. [2023-10-12 17:12:40,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2023-10-12 17:12:40,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2023-10-12 17:12:40,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 118 transitions. [2023-10-12 17:12:40,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:40,086 INFO L219 hiAutomatonCegarLoop]: Abstraction has 51 states and 118 transitions. [2023-10-12 17:12:40,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 118 transitions. [2023-10-12 17:12:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2023-10-12 17:12:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.357142857142857) internal successors, (99), 41 states have internal predecessors, (99), 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) [2023-10-12 17:12:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 99 transitions. [2023-10-12 17:12:40,094 INFO L241 hiAutomatonCegarLoop]: Abstraction has 42 states and 99 transitions. [2023-10-12 17:12:40,094 INFO L430 stractBuchiCegarLoop]: Abstraction has 42 states and 99 transitions. [2023-10-12 17:12:40,094 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:12:40,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 99 transitions. [2023-10-12 17:12:40,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:12:40,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:40,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:40,099 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:40,099 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:40,099 INFO L748 eck$LassoCheckResult]: Stem: 438#[$Ultimate##0]don't care [116] $Ultimate##0-->L59: Formula: (and (<= 0 v_ULTIMATE.start_min2_8) (<= v_ULTIMATE.start_max2_8 v_N_16) (<= v_ULTIMATE.start_max1_6 v_N_16) (<= 0 v_ULTIMATE.start_min1_6)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_16, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_16, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} AuxVars[] AssignedVars[] 386#[L59]don't care [99] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] 370#[L59-1, $Ultimate##0]don't care [84] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork2_j_1 v_writerThread1of1ForFork2_start_1) InVars {writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_1, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork2_j] 372#[L59-1, L41-1]don't care [114] L41-1-->writerEXIT: Formula: (<= v_writerThread1of1ForFork2_end_7 v_writerThread1of1ForFork2_j_21) InVars {writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_7, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_21} OutVars{writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_7, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_21} AuxVars[] AssignedVars[] 432#[L59-1, writerEXIT]don't care [93] L59-1-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_2 2) (= v_readerThread1of1ForFork0_thidvar1_2 2) (= v_readerThread1of1ForFork0_start_4 v_ULTIMATE.start_min2_5) (= v_readerThread1of1ForFork0_end_6 v_ULTIMATE.start_max2_5)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_4, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_8, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_18, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork0_start, readerThread1of1ForFork0_sum, readerThread1of1ForFork0_i, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_end] 400#[L60, writerEXIT, $Ultimate##0]don't care [115] $Ultimate##0-->L28-1: Formula: (and (= v_readerThread1of1ForFork0_i_31 v_readerThread1of1ForFork0_start_5) (= v_readerThread1of1ForFork0_sum_21 0)) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5} OutVars{readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_31, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_21} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 410#[L28-1, L60, writerEXIT]don't care [100] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork2_thidvar0_4 1) InVars {writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_4} OutVars{writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[] 422#[L28-1, L61]don't care [105] L28-1-->readerEXIT: Formula: (<= v_readerThread1of1ForFork0_end_7 v_readerThread1of1ForFork0_i_19) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_19, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_7} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_19, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_7} AuxVars[] AssignedVars[] 378#[L61, readerEXIT]don't care [101] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_4 2) (= v_ULTIMATE.start_sum_2 v_readerThread1of1ForFork0_sum_10) (= v_readerThread1of1ForFork0_thidvar1_4 2)) InVars {readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_10, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_4, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_10, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_4, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] 430#[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[] 366#[L67]don't care [96] L67-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork1_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork1_thidvar0_2 2) (= v_ULTIMATE.start_min2_7 v_readerThread1of1ForFork1_start_4) (= v_readerThread1of1ForFork1_thidvar1_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{readerThread1of1ForFork1_thidvar0=v_readerThread1of1ForFork1_thidvar0_2, ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork1_thidvar1=v_readerThread1of1ForFork1_thidvar1_2, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_8, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_18, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_6, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_4} AuxVars[] AssignedVars[readerThread1of1ForFork1_thidvar0, readerThread1of1ForFork1_thidvar1, readerThread1of1ForFork1_sum, readerThread1of1ForFork1_i, readerThread1of1ForFork1_end, readerThread1of1ForFork1_start] 368#[L67-1, $Ultimate##0]don't care [108] $Ultimate##0-->L28-1: Formula: (and (= v_readerThread1of1ForFork1_sum_13 0) (= v_readerThread1of1ForFork1_i_19 v_readerThread1of1ForFork1_start_5)) InVars {readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_5} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_19, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_13, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_5} AuxVars[] AssignedVars[readerThread1of1ForFork1_i, readerThread1of1ForFork1_sum] 364#[L67-1, L28-1]don't care [2023-10-12 17:12:40,099 INFO L750 eck$LassoCheckResult]: Loop: 364#[L67-1, L28-1]don't care [121] L28-1-->L28-1: Formula: (and (<= 0 v_readerThread1of1ForFork1_i_30) (= (+ v_readerThread1of1ForFork1_sum_24 (select v_A_24 v_readerThread1of1ForFork1_i_30)) v_readerThread1of1ForFork1_sum_23) (= v_readerThread1of1ForFork1_i_29 (+ v_readerThread1of1ForFork1_i_30 1)) (< v_readerThread1of1ForFork1_i_30 v_readerThread1of1ForFork1_end_13) (<= v_readerThread1of1ForFork1_i_30 v_N_24)) InVars {A=v_A_24, N=v_N_24, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_30, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_24, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_13} OutVars{A=v_A_24, N=v_N_24, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_29, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_23, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_13} AuxVars[] AssignedVars[readerThread1of1ForFork1_i, readerThread1of1ForFork1_sum] 364#[L67-1, L28-1]don't care [2023-10-12 17:12:40,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:40,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1591388813, now seen corresponding path program 1 times [2023-10-12 17:12:40,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:40,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097000329] [2023-10-12 17:12:40,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:40,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,114 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:40,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:40,114 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 1 times [2023-10-12 17:12:40,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:40,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821699136] [2023-10-12 17:12:40,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:40,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,118 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:40,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:40,128 INFO L85 PathProgramCache]: Analyzing trace with hash 2088413068, now seen corresponding path program 1 times [2023-10-12 17:12:40,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:40,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303361377] [2023-10-12 17:12:40,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:40,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:40,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:40,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:12:40,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303361377] [2023-10-12 17:12:40,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303361377] provided 1 perfect and 0 imperfect interpolant sequences [2023-10-12 17:12:40,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-10-12 17:12:40,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-10-12 17:12:40,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986850003] [2023-10-12 17:12:40,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-10-12 17:12:40,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:12:40,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-10-12 17:12:40,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-10-12 17:12:40,292 INFO L87 Difference]: Start difference. First operand 42 states and 99 transitions. cyclomatic complexity: 68 Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 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) [2023-10-12 17:12:40,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-10-12 17:12:40,400 INFO L93 Difference]: Finished difference Result 63 states and 139 transitions. [2023-10-12 17:12:40,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 139 transitions. [2023-10-12 17:12:40,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:12:40,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 49 states and 111 transitions. [2023-10-12 17:12:40,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-10-12 17:12:40,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2023-10-12 17:12:40,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 111 transitions. [2023-10-12 17:12:40,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:40,405 INFO L219 hiAutomatonCegarLoop]: Abstraction has 49 states and 111 transitions. [2023-10-12 17:12:40,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 111 transitions. [2023-10-12 17:12:40,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2023-10-12 17:12:40,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.2325581395348837) internal successors, (96), 42 states have internal predecessors, (96), 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) [2023-10-12 17:12:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 96 transitions. [2023-10-12 17:12:40,415 INFO L241 hiAutomatonCegarLoop]: Abstraction has 43 states and 96 transitions. [2023-10-12 17:12:40,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-10-12 17:12:40,419 INFO L430 stractBuchiCegarLoop]: Abstraction has 43 states and 96 transitions. [2023-10-12 17:12:40,419 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:12:40,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 96 transitions. [2023-10-12 17:12:40,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2023-10-12 17:12:40,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:40,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:40,422 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-10-12 17:12:40,422 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:40,423 INFO L748 eck$LassoCheckResult]: Stem: 605#[$Ultimate##0]don't care [116] $Ultimate##0-->L59: Formula: (and (<= 0 v_ULTIMATE.start_min2_8) (<= v_ULTIMATE.start_max2_8 v_N_16) (<= v_ULTIMATE.start_max1_6 v_N_16) (<= 0 v_ULTIMATE.start_min1_6)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_16, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_6, ULTIMATE.start_max2=v_ULTIMATE.start_max2_8, N=v_N_16, ULTIMATE.start_min1=v_ULTIMATE.start_min1_6, ULTIMATE.start_min2=v_ULTIMATE.start_min2_8} AuxVars[] AssignedVars[] 565#[L59]don't care [99] L59-->$Ultimate##0: Formula: (and (= v_writerThread1of1ForFork2_end_6 v_ULTIMATE.start_max1_5) (= v_writerThread1of1ForFork2_thidvar0_2 1) (= v_writerThread1of1ForFork2_start_4 v_ULTIMATE.start_min1_5)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_5, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_16, writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_6, ULTIMATE.start_min1=v_ULTIMATE.start_min1_5, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_4, writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[writerThread1of1ForFork2_j, writerThread1of1ForFork2_end, writerThread1of1ForFork2_start, writerThread1of1ForFork2_thidvar0] 537#[L59-1, $Ultimate##0]don't care [84] $Ultimate##0-->L41-1: Formula: (= v_writerThread1of1ForFork2_j_1 v_writerThread1of1ForFork2_start_1) InVars {writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_1, writerThread1of1ForFork2_start=v_writerThread1of1ForFork2_start_1} AuxVars[] AssignedVars[writerThread1of1ForFork2_j] 539#[L59-1, L41-1]don't care [114] L41-1-->writerEXIT: Formula: (<= v_writerThread1of1ForFork2_end_7 v_writerThread1of1ForFork2_j_21) InVars {writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_7, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_21} OutVars{writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_7, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_21} AuxVars[] AssignedVars[] 601#[L59-1, writerEXIT]don't care [93] L59-1-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_2 2) (= v_readerThread1of1ForFork0_thidvar1_2 2) (= v_readerThread1of1ForFork0_start_4 v_ULTIMATE.start_min2_5) (= v_readerThread1of1ForFork0_end_6 v_ULTIMATE.start_max2_5)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_5, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_4, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_8, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_18, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_2, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_2, ULTIMATE.start_min2=v_ULTIMATE.start_min2_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_6} AuxVars[] AssignedVars[readerThread1of1ForFork0_start, readerThread1of1ForFork0_sum, readerThread1of1ForFork0_i, readerThread1of1ForFork0_thidvar1, readerThread1of1ForFork0_thidvar0, readerThread1of1ForFork0_end] 569#[L60, writerEXIT, $Ultimate##0]don't care [115] $Ultimate##0-->L28-1: Formula: (and (= v_readerThread1of1ForFork0_i_31 v_readerThread1of1ForFork0_start_5) (= v_readerThread1of1ForFork0_sum_21 0)) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5} OutVars{readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_5, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_31, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_21} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 579#[L28-1, L60, writerEXIT]don't care [100] writerEXIT-->L61: Formula: (= v_writerThread1of1ForFork2_thidvar0_4 1) InVars {writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_4} OutVars{writerThread1of1ForFork2_thidvar0=v_writerThread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[] 591#[L28-1, L61]don't care [120] L28-1-->L28-1: Formula: (and (= v_readerThread1of1ForFork0_i_33 (+ v_readerThread1of1ForFork0_i_34 1)) (< v_readerThread1of1ForFork0_i_34 v_readerThread1of1ForFork0_end_13) (= (+ v_readerThread1of1ForFork0_sum_24 (select v_A_22 v_readerThread1of1ForFork0_i_34)) v_readerThread1of1ForFork0_sum_23) (<= v_readerThread1of1ForFork0_i_34 v_N_22) (<= 0 v_readerThread1of1ForFork0_i_34)) InVars {A=v_A_22, N=v_N_22, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_34, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_24, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_13} OutVars{A=v_A_22, N=v_N_22, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_33, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_23, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_13} AuxVars[] AssignedVars[readerThread1of1ForFork0_i, readerThread1of1ForFork0_sum] 609#[L28-1, L61]don't care [105] L28-1-->readerEXIT: Formula: (<= v_readerThread1of1ForFork0_end_7 v_readerThread1of1ForFork0_i_19) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_19, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_7} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_19, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_7} AuxVars[] AssignedVars[] 547#[L61, readerEXIT]don't care [101] readerEXIT-->L62: Formula: (and (= v_readerThread1of1ForFork0_thidvar0_4 2) (= v_ULTIMATE.start_sum_2 v_readerThread1of1ForFork0_sum_10) (= v_readerThread1of1ForFork0_thidvar1_4 2)) InVars {readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_10, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_4, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_sum=v_ULTIMATE.start_sum_2, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_10, readerThread1of1ForFork0_thidvar1=v_readerThread1of1ForFork0_thidvar1_4, readerThread1of1ForFork0_thidvar0=v_readerThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[ULTIMATE.start_sum] 597#[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[] 533#[L67]don't care [96] L67-->$Ultimate##0: Formula: (and (= v_readerThread1of1ForFork1_end_6 v_ULTIMATE.start_max2_7) (= v_readerThread1of1ForFork1_thidvar0_2 2) (= v_ULTIMATE.start_min2_7 v_readerThread1of1ForFork1_start_4) (= v_readerThread1of1ForFork1_thidvar1_2 2)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7} OutVars{readerThread1of1ForFork1_thidvar0=v_readerThread1of1ForFork1_thidvar0_2, ULTIMATE.start_max2=v_ULTIMATE.start_max2_7, readerThread1of1ForFork1_thidvar1=v_readerThread1of1ForFork1_thidvar1_2, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_8, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_18, ULTIMATE.start_min2=v_ULTIMATE.start_min2_7, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_6, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_4} AuxVars[] AssignedVars[readerThread1of1ForFork1_thidvar0, readerThread1of1ForFork1_thidvar1, readerThread1of1ForFork1_sum, readerThread1of1ForFork1_i, readerThread1of1ForFork1_end, readerThread1of1ForFork1_start] 535#[L67-1, $Ultimate##0]don't care [108] $Ultimate##0-->L28-1: Formula: (and (= v_readerThread1of1ForFork1_sum_13 0) (= v_readerThread1of1ForFork1_i_19 v_readerThread1of1ForFork1_start_5)) InVars {readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_5} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_19, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_13, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_5} AuxVars[] AssignedVars[readerThread1of1ForFork1_i, readerThread1of1ForFork1_sum] 543#[L67-1, L28-1]don't care [2023-10-12 17:12:40,425 INFO L750 eck$LassoCheckResult]: Loop: 543#[L67-1, L28-1]don't care [121] L28-1-->L28-1: Formula: (and (<= 0 v_readerThread1of1ForFork1_i_30) (= (+ v_readerThread1of1ForFork1_sum_24 (select v_A_24 v_readerThread1of1ForFork1_i_30)) v_readerThread1of1ForFork1_sum_23) (= v_readerThread1of1ForFork1_i_29 (+ v_readerThread1of1ForFork1_i_30 1)) (< v_readerThread1of1ForFork1_i_30 v_readerThread1of1ForFork1_end_13) (<= v_readerThread1of1ForFork1_i_30 v_N_24)) InVars {A=v_A_24, N=v_N_24, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_30, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_24, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_13} OutVars{A=v_A_24, N=v_N_24, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_29, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_23, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_13} AuxVars[] AssignedVars[readerThread1of1ForFork1_i, readerThread1of1ForFork1_sum] 543#[L67-1, L28-1]don't care [2023-10-12 17:12:40,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:40,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1772265259, now seen corresponding path program 1 times [2023-10-12 17:12:40,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:40,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818987673] [2023-10-12 17:12:40,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:40,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:40,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:40,445 INFO L85 PathProgramCache]: Analyzing trace with hash 152, now seen corresponding path program 2 times [2023-10-12 17:12:40,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:40,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363650383] [2023-10-12 17:12:40,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:40,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:40,451 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:40,451 INFO L85 PathProgramCache]: Analyzing trace with hash 894351940, now seen corresponding path program 1 times [2023-10-12 17:12:40,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:40,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537573597] [2023-10-12 17:12:40,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:40,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:40,732 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:40,732 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:40,732 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:40,732 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:40,732 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:40,732 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,732 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:40,732 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:40,733 INFO L133 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:12:40,733 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:40,733 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:40,737 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:40,739 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:40,741 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:40,743 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:40,746 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:40,748 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:12:40,989 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:40,989 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:40,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:41,001 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) [2023-10-12 17:12:41,002 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 [2023-10-12 17:12:41,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 [2023-10-12 17:12:41,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:41,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:41,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:41,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:41,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:41,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:41,024 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:41,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-10-12 17:12:41,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:41,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:41,030 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:41,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:12:41,033 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 [2023-10-12 17:12:41,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:41,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:41,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:41,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:41,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:41,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:41,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:41,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-10-12 17:12:41,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:41,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:41,057 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:41,067 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 [2023-10-12 17:12:41,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-10-12 17:12:41,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:41,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:41,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:41,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:41,075 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:41,076 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:41,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:41,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:41,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:41,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:41,088 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:41,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-10-12 17:12:41,091 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 [2023-10-12 17:12:41,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:41,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:41,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:41,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:41,100 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:41,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:41,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:41,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:41,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:41,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:41,116 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:41,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:12:41,119 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 [2023-10-12 17:12:41,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:41,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:41,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:41,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:41,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:41,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:41,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:41,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:41,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:41,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:41,154 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:41,159 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 [2023-10-12 17:12:41,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:41,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:41,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:41,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:41,173 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:41,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:41,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:12:41,191 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:41,205 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:12:41,205 INFO L444 ModelExtractionUtils]: 34 out of 46 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:12:41,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:41,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:41,209 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:41,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:12:41,213 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:41,222 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:41,223 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:41,223 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(readerThread1of1ForFork1_i, readerThread1of1ForFork1_end) = -1*readerThread1of1ForFork1_i + 1*readerThread1of1ForFork1_end Supporting invariants [] [2023-10-12 17:12:41,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:41,230 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:41,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:41,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:41,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:41,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:41,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:41,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:41,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:12:41,263 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:12:41,264 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 96 transitions. cyclomatic complexity: 64 Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:41,277 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 96 transitions. cyclomatic complexity: 64. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 44 states and 97 transitions. Complement of second has 2 states. [2023-10-12 17:12:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 15 transitions. [2023-10-12 17:12:41,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 13 letters. Loop has 1 letters. [2023-10-12 17:12:41,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:41,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 14 letters. Loop has 1 letters. [2023-10-12 17:12:41,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:41,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 15 transitions. Stem has 13 letters. Loop has 2 letters. [2023-10-12 17:12:41,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:41,279 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 97 transitions. [2023-10-12 17:12:41,283 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:12:41,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2023-10-12 17:12:41,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-10-12 17:12:41,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-10-12 17:12:41,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-10-12 17:12:41,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-10-12 17:12:41,283 INFO L219 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:41,283 INFO L241 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:41,283 INFO L430 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-10-12 17:12:41,283 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:12:41,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-10-12 17:12:41,284 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-10-12 17:12:41,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-10-12 17:12:41,288 INFO L201 PluginConnector]: Adding new model optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:12:41 BoogieIcfgContainer [2023-10-12 17:12:41,288 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:12:41,289 INFO L158 Benchmark]: Toolchain (without parser) took 3594.03ms. Allocated memory was 182.5MB in the beginning and 271.6MB in the end (delta: 89.1MB). Free memory was 130.3MB in the beginning and 123.0MB in the end (delta: 7.3MB). Peak memory consumption was 96.4MB. Max. memory is 8.0GB. [2023-10-12 17:12:41,291 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 182.5MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:12:41,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.27ms. Allocated memory is still 182.5MB. Free memory was 130.0MB in the beginning and 128.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:41,295 INFO L158 Benchmark]: Boogie Preprocessor took 19.04ms. Allocated memory is still 182.5MB. Free memory was 128.6MB in the beginning and 127.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:41,296 INFO L158 Benchmark]: RCFGBuilder took 201.06ms. Allocated memory is still 182.5MB. Free memory was 127.5MB in the beginning and 117.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:12:41,296 INFO L158 Benchmark]: BuchiAutomizer took 3338.72ms. Allocated memory was 182.5MB in the beginning and 271.6MB in the end (delta: 89.1MB). Free memory was 117.0MB in the beginning and 123.0MB in the end (delta: -6.0MB). Peak memory consumption was 82.8MB. Max. memory is 8.0GB. [2023-10-12 17:12:41,299 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.19ms. Allocated memory is still 182.5MB. Free memory is still 131.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.27ms. Allocated memory is still 182.5MB. Free memory was 130.0MB in the beginning and 128.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.04ms. Allocated memory is still 182.5MB. Free memory was 128.6MB in the beginning and 127.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 201.06ms. Allocated memory is still 182.5MB. Free memory was 127.5MB in the beginning and 117.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 3338.72ms. Allocated memory was 182.5MB in the beginning and 271.6MB in the end (delta: 89.1MB). Free memory was 117.0MB in the beginning and 123.0MB in the end (delta: -6.0MB). Peak memory consumption was 82.8MB. 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 3 locations. One deterministic module has affine ranking function end + -1 * i and consists of 3 locations. One deterministic module has affine ranking function end + -1 * i and consists of 2 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations. 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, 90 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 12 mSDtfsCounter, 179 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 lsp82 ukn92 mio100 lsp87 div100 bol100 ite100 ukn100 eq159 hnf91 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 56ms 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.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 42 PlacesBefore, 27 PlacesAfterwards, 36 TransitionsBefore, 21 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 10 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 18 TotalNumberOfCompositions, 121 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 117, independent: 115, independent conditional: 0, independent unconditional: 115, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 87, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 87, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 117, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 87, unknown conditional: 0, unknown unconditional: 87] , Statistics on independence cache: Total cache size (in pairs): 9, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:12:41,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:41,525 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...