/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:54:01,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:54:01,300 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:54:01,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:54:01,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:54:01,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:54:01,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:54:01,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:54:01,326 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:54:01,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:54:01,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:54:01,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:54:01,327 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:54:01,327 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:54:01,327 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:54:01,327 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:54:01,327 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:54:01,327 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:54:01,327 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:54:01,327 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:54:01,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:54:01,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:54:01,327 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:54:01,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:54:01,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:54:01,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:54:01,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:54:01,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:54:01,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:54:01,329 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:54:01,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:54:01,329 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:54:01,329 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:54:01,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:54:01,330 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:54:01,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:01,330 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:54:01,330 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:54:01,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:54:01,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:54:01,330 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:54:01,330 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:54:01,330 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:54:01,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:54:01,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:54:01,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:54:01,541 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:54:01,541 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:54:01,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency1.bpl [2025-04-26 16:54:01,542 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/optimistic-concurrency1.bpl' [2025-04-26 16:54:01,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:54:01,555 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:54:01,556 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:01,556 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:54:01,556 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:54:01,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,577 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,586 INFO L138 Inliner]: procedures = 3, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:54:01,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:54:01,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:54:01,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:54:01,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:54:01,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,595 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,598 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,598 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:54:01,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:54:01,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:54:01,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:54:01,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/1) ... [2025-04-26 16:54:01,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:54:01,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:54:01,673 INFO L124 BoogieDeclarations]: Specification and implementation of procedure reader given in one single declaration [2025-04-26 16:54:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2025-04-26 16:54:01,674 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2025-04-26 16:54:01,674 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:54:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:54:01,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:54:01,674 INFO L124 BoogieDeclarations]: Specification and implementation of procedure writer given in one single declaration [2025-04-26 16:54:01,674 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2025-04-26 16:54:01,674 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2025-04-26 16:54:01,675 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:54:01,713 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:54:01,715 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:54:01,790 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:54:01,790 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:54:01,797 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:54:01,798 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:54:01,798 INFO L201 PluginConnector]: Adding new model optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:01 BoogieIcfgContainer [2025-04-26 16:54:01,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:54:01,799 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:54:01,799 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:54:01,807 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:54:01,807 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:01,808 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:54:01" (1/2) ... [2025-04-26 16:54:01,809 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b348a5d and model type optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:54:01, skipping insertion in model container [2025-04-26 16:54:01,809 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:54:01,809 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:54:01" (2/2) ... [2025-04-26 16:54:01,810 INFO L376 chiAutomizerObserver]: Analyzing ICFG optimistic-concurrency1.bpl [2025-04-26 16:54:01,880 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 16:54:01,922 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:54:01,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:54:01,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:01,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:01,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:54:01,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 44 transitions, 115 flow [2025-04-26 16:54:02,003 INFO L116 PetriNetUnfolderBase]: 4/36 cut-off events. [2025-04-26 16:54:02,006 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:54:02,010 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. [2025-04-26 16:54:02,010 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 44 transitions, 115 flow [2025-04-26 16:54:02,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 36 transitions, 90 flow [2025-04-26 16:54:02,013 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 42 places, 36 transitions, 90 flow [2025-04-26 16:54:02,018 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:54:02,093 WARN L140 AmpleReduction]: Number of pruned transitions: 24 [2025-04-26 16:54:02,093 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:54:02,093 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 2 [2025-04-26 16:54:02,093 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:37 [2025-04-26 16:54:02,094 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:24 [2025-04-26 16:54:02,094 WARN L145 AmpleReduction]: Times succ was already a loop node:5 [2025-04-26 16:54:02,094 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:6 [2025-04-26 16:54:02,094 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:54:02,098 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 64 states, 61 states have (on average 1.3114754098360655) internal successors, (in total 80), 63 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:02,103 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:54:02,103 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:54:02,103 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:54:02,103 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:54:02,103 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:54:02,103 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:54:02,103 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:54:02,103 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:54:02,105 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 64 states, 61 states have (on average 1.3114754098360655) internal successors, (in total 80), 63 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:02,113 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 35 [2025-04-26 16:54:02,113 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:02,113 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:02,116 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:54:02,116 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:54:02,116 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:54:02,117 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 64 states, 61 states have (on average 1.3114754098360655) internal successors, (in total 80), 63 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:02,118 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 35 [2025-04-26 16:54:02,118 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:02,118 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:02,119 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:54:02,119 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:54:02,123 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_3) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3, N=v_N_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3, N=v_N_3} AuxVars[] AssignedVars[]" "[41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_4) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[]" "[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]" "[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]" [2025-04-26 16:54:02,124 INFO L754 eck$LassoCheckResult]: Loop: "[86] L41-1-->L42: Formula: (< v_writerThread1of1ForFork2_j_5 v_writerThread1of1ForFork2_end_3) InVars {writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_3, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_5} OutVars{writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_3, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_5} AuxVars[] AssignedVars[]" "[88] L42-->L43: Formula: (and (<= 0 v_writerThread1of1ForFork2_j_7) (<= v_writerThread1of1ForFork2_j_7 v_N_5)) InVars {writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_7, N=v_N_5} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_7, N=v_N_5} AuxVars[] AssignedVars[]" "[89] L43-->L44: Formula: (= (store v_A_3 v_writerThread1of1ForFork2_j_9 0) v_A_2) InVars {A=v_A_3, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_9} OutVars{A=v_A_2, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_9} AuxVars[] AssignedVars[A]" "[90] L44-->L41-1: Formula: (= v_writerThread1of1ForFork2_j_12 (+ v_writerThread1of1ForFork2_j_11 1)) InVars {writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_11} OutVars{writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_12} AuxVars[] AssignedVars[writerThread1of1ForFork2_j]" [2025-04-26 16:54:02,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:02,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2842908, now seen corresponding path program 1 times [2025-04-26 16:54:02,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:02,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515829088] [2025-04-26 16:54:02,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:02,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:02,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:02,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:02,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:02,180 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:02,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:02,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:02,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:02,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:02,206 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:02,206 INFO L85 PathProgramCache]: Analyzing trace with hash 3572964, now seen corresponding path program 1 times [2025-04-26 16:54:02,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:02,206 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549198728] [2025-04-26 16:54:02,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:02,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:02,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:02,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:02,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:02,223 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:02,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:02,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:02,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:02,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:02,238 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:02,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1262870655, now seen corresponding path program 1 times [2025-04-26 16:54:02,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:02,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546951266] [2025-04-26 16:54:02,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:02,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:02,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:02,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:02,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:02,249 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:02,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:54:02,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:54:02,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:02,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:02,422 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:02,424 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:02,424 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:02,424 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:02,424 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:02,424 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:02,424 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:02,424 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:02,424 INFO L132 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:54:02,424 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:02,425 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:02,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:02,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:02,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:02,605 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:02,607 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:02,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:02,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:02,610 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:02,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:54:02,615 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 [2025-04-26 16:54:02,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:02,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:02,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:02,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:02,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:02,633 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:02,644 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:02,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:02,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:02,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:02,656 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:02,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:54:02,659 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 [2025-04-26 16:54:02,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:02,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:02,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:02,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:02,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:02,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:02,677 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:02,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:02,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:02,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:02,688 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:02,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:54:02,691 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 [2025-04-26 16:54:02,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:02,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:02,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:02,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:02,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:02,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:02,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:02,705 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:02,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:02,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:02,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:02,714 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:02,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:54:02,716 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 [2025-04-26 16:54:02,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:02,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:02,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:02,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:02,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:02,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:02,753 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:02,777 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:54:02,777 INFO L437 ModelExtractionUtils]: 8 out of 25 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-04-26 16:54:02,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:02,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:02,795 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:02,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:54:02,798 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:02,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:02,817 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:02,817 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:02,818 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(writerThread1of1ForFork2_j, writerThread1of1ForFork2_end) = -1*writerThread1of1ForFork2_j + 1*writerThread1of1ForFork2_end Supporting invariants [] [2025-04-26 16:54:02,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:02,829 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:02,848 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:02,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:02,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:02,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:02,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:02,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:02,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:02,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:02,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:02,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:02,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:02,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:02,909 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:54:02,910 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 64 states, 61 states have (on average 1.3114754098360655) internal successors, (in total 80), 63 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:02,980 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 64 states, 61 states have (on average 1.3114754098360655) internal successors, (in total 80), 63 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 124 states and 159 transitions. Complement of second has 6 states. [2025-04-26 16:54:02,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:02,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-04-26 16:54:02,989 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:54:02,990 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:02,990 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:54:02,990 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:02,990 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 4 letters. Loop has 8 letters. [2025-04-26 16:54:02,990 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:02,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 159 transitions. [2025-04-26 16:54:02,994 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-04-26 16:54:02,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 64 states and 79 transitions. [2025-04-26 16:54:02,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-04-26 16:54:02,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2025-04-26 16:54:02,997 INFO L74 IsDeterministic]: Start isDeterministic. Operand 64 states and 79 transitions. [2025-04-26 16:54:02,997 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:02,997 INFO L218 hiAutomatonCegarLoop]: Abstraction has 64 states and 79 transitions. [2025-04-26 16:54:03,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states and 79 transitions. [2025-04-26 16:54:03,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2025-04-26 16:54:03,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.2419354838709677) internal successors, (in total 77), 61 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2025-04-26 16:54:03,013 INFO L240 hiAutomatonCegarLoop]: Abstraction has 62 states and 77 transitions. [2025-04-26 16:54:03,013 INFO L438 stractBuchiCegarLoop]: Abstraction has 62 states and 77 transitions. [2025-04-26 16:54:03,013 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:54:03,013 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 77 transitions. [2025-04-26 16:54:03,014 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2025-04-26 16:54:03,014 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:03,014 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:03,014 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:03,014 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:54:03,014 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_3) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3, N=v_N_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3, N=v_N_3} AuxVars[] AssignedVars[]" "[41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_4) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[]" "[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]" "[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]" "[85] L41-1-->writerFINAL: Formula: (<= v_writerThread1of1ForFork2_end_1 v_writerThread1of1ForFork2_j_3) InVars {writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_1, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_3} OutVars{writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_1, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_3} AuxVars[] AssignedVars[]" "[87] writerFINAL-->writerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[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]" "[66] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork0_sum_1 0) InVars {} OutVars{readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum]" "[67] L27-->L28-1: Formula: (= v_readerThread1of1ForFork0_start_1 v_readerThread1of1ForFork0_i_1) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_1, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_i]" [2025-04-26 16:54:03,014 INFO L754 eck$LassoCheckResult]: Loop: "[69] L28-1-->L29: Formula: (< v_readerThread1of1ForFork0_i_5 v_readerThread1of1ForFork0_end_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} AuxVars[] AssignedVars[]" "[72] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork0_i_9 v_N_2) (<= 0 v_readerThread1of1ForFork0_i_9)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} AuxVars[] AssignedVars[]" "[73] L30-->L31: Formula: (= (+ v_readerThread1of1ForFork0_sum_3 (select v_A_1 v_readerThread1of1ForFork0_i_11)) v_readerThread1of1ForFork0_sum_4) InVars {A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum]" "[74] L31-->L28-1: Formula: (= v_readerThread1of1ForFork0_i_14 (+ v_readerThread1of1ForFork0_i_13 1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_13} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_14} AuxVars[] AssignedVars[readerThread1of1ForFork0_i]" [2025-04-26 16:54:03,015 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash 493334496, now seen corresponding path program 1 times [2025-04-26 16:54:03,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:03,015 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651921737] [2025-04-26 16:54:03,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:03,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:03,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:03,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:03,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:03,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:03,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:03,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:03,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:03,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:03,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:03,025 INFO L85 PathProgramCache]: Analyzing trace with hash 3050629, now seen corresponding path program 1 times [2025-04-26 16:54:03,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:03,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105714085] [2025-04-26 16:54:03,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:03,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:03,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:03,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:03,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:03,029 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:03,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:03,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:03,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:03,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:03,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:03,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1066584860, now seen corresponding path program 1 times [2025-04-26 16:54:03,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:03,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908323991] [2025-04-26 16:54:03,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:03,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:03,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:54:03,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:54:03,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:03,045 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:03,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:54:03,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:54:03,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:03,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:03,189 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:03,190 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:03,190 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:03,190 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:03,190 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:03,190 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,190 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:03,190 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:03,190 INFO L132 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:54:03,190 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:03,190 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:03,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:03,344 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:03,345 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:03,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,350 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:03,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:54:03,352 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 [2025-04-26 16:54:03,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:03,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:03,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:03,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:03,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:03,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:03,369 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:03,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:03,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,379 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:03,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:54:03,382 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 [2025-04-26 16:54:03,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:03,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:03,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:03,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:03,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:03,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:03,399 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:03,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:54:03,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,408 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:03,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:54:03,411 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 [2025-04-26 16:54:03,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:03,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:03,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:03,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:03,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:03,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:03,425 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:03,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:03,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,433 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:03,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:54:03,436 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 [2025-04-26 16:54:03,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:03,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:03,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:03,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:03,452 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:03,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:03,461 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:03,470 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:54:03,470 INFO L437 ModelExtractionUtils]: 31 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-04-26 16:54:03,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:03,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:03,472 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:03,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:54:03,475 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:03,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:03,493 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:03,493 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:03,493 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, readerThread1of1ForFork0_i) = 2*N - 2*readerThread1of1ForFork0_i + 1 Supporting invariants [] [2025-04-26 16:54:03,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:54:03,501 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:54:03,512 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:03,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:03,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:03,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:03,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:03,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:03,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:03,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:03,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:03,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:03,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:03,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:03,561 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:54:03,562 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 77 transitions. cyclomatic complexity: 23 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:03,609 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 77 transitions. cyclomatic complexity: 23. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 105 states and 134 transitions. Complement of second has 6 states. [2025-04-26 16:54:03,609 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:03,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:03,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-26 16:54:03,610 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:54:03,610 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:03,610 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 16:54:03,610 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:03,610 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 9 letters. Loop has 8 letters. [2025-04-26 16:54:03,610 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:03,610 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 134 transitions. [2025-04-26 16:54:03,612 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-04-26 16:54:03,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 55 states and 68 transitions. [2025-04-26 16:54:03,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-04-26 16:54:03,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2025-04-26 16:54:03,615 INFO L74 IsDeterministic]: Start isDeterministic. Operand 55 states and 68 transitions. [2025-04-26 16:54:03,615 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:03,615 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-04-26 16:54:03,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 68 transitions. [2025-04-26 16:54:03,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-04-26 16:54:03,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.2363636363636363) internal successors, (in total 68), 54 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:03,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2025-04-26 16:54:03,618 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-04-26 16:54:03,618 INFO L438 stractBuchiCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-04-26 16:54:03,618 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:54:03,618 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 68 transitions. [2025-04-26 16:54:03,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-04-26 16:54:03,620 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:03,620 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:03,621 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:03,621 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:54:03,621 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_3) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3, N=v_N_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3, N=v_N_3} AuxVars[] AssignedVars[]" "[41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_4) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[]" "[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]" "[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]" "[85] L41-1-->writerFINAL: Formula: (<= v_writerThread1of1ForFork2_end_1 v_writerThread1of1ForFork2_j_3) InVars {writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_1, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_3} OutVars{writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_1, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_3} AuxVars[] AssignedVars[]" "[87] writerFINAL-->writerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[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]" "[66] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork0_sum_1 0) InVars {} OutVars{readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum]" "[67] L27-->L28-1: Formula: (= v_readerThread1of1ForFork0_start_1 v_readerThread1of1ForFork0_i_1) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_1, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_i]" "[68] L28-1-->readerFINAL: Formula: (<= v_readerThread1of1ForFork0_end_1 v_readerThread1of1ForFork0_i_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_3, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_3, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_1} AuxVars[] AssignedVars[]" "[70] readerFINAL-->readerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[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[]" "[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]" "[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[]" "[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]" "[75] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork1_sum_1 0) InVars {} OutVars{readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork1_sum]" "[76] L27-->L28-1: Formula: (= v_readerThread1of1ForFork1_i_1 v_readerThread1of1ForFork1_start_1) InVars {readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_1} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_1, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[readerThread1of1ForFork1_i]" [2025-04-26 16:54:03,621 INFO L754 eck$LassoCheckResult]: Loop: "[78] L28-1-->L29: Formula: (< v_readerThread1of1ForFork1_i_5 v_readerThread1of1ForFork1_end_3) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_5, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_3} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_5, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_3} AuxVars[] AssignedVars[]" "[81] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork1_i_9 v_N_2) (<= 0 v_readerThread1of1ForFork1_i_9)) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_9, N=v_N_2} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_9, N=v_N_2} AuxVars[] AssignedVars[]" "[82] L30-->L31: Formula: (= v_readerThread1of1ForFork1_sum_4 (+ (select v_A_1 v_readerThread1of1ForFork1_i_11) v_readerThread1of1ForFork1_sum_3)) InVars {A=v_A_1, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_11, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_11, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork1_sum]" "[83] L31-->L28-1: Formula: (= (+ v_readerThread1of1ForFork1_i_13 1) v_readerThread1of1ForFork1_i_14) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_13} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_14} AuxVars[] AssignedVars[readerThread1of1ForFork1_i]" [2025-04-26 16:54:03,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash 155123527, now seen corresponding path program 1 times [2025-04-26 16:54:03,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:03,623 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148801189] [2025-04-26 16:54:03,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:03,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:03,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:54:03,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:54:03,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:03,634 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:03,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:54:03,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:54:03,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:03,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:03,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:03,646 INFO L85 PathProgramCache]: Analyzing trace with hash 3327685, now seen corresponding path program 1 times [2025-04-26 16:54:03,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:03,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206090364] [2025-04-26 16:54:03,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:03,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:03,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:03,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:03,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:03,650 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:03,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:03,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:03,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:03,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:03,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1203024651, now seen corresponding path program 1 times [2025-04-26 16:54:03,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:03,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190736681] [2025-04-26 16:54:03,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:03,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:03,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:54:03,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:54:03,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:03,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:03,822 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190736681] [2025-04-26 16:54:03,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190736681] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:03,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:03,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-26 16:54:03,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966189616] [2025-04-26 16:54:03,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:03,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:03,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-26 16:54:03,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-26 16:54:03,858 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. cyclomatic complexity: 20 Second operand has 7 states, 7 states have (on average 3.0) internal successors, (in total 21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:03,977 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2025-04-26 16:54:03,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 99 transitions. [2025-04-26 16:54:03,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-04-26 16:54:03,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 68 states and 83 transitions. [2025-04-26 16:54:03,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-04-26 16:54:03,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-04-26 16:54:03,979 INFO L74 IsDeterministic]: Start isDeterministic. Operand 68 states and 83 transitions. [2025-04-26 16:54:03,979 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:03,979 INFO L218 hiAutomatonCegarLoop]: Abstraction has 68 states and 83 transitions. [2025-04-26 16:54:03,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 83 transitions. [2025-04-26 16:54:03,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2025-04-26 16:54:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.2142857142857142) internal successors, (in total 68), 55 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2025-04-26 16:54:03,981 INFO L240 hiAutomatonCegarLoop]: Abstraction has 56 states and 68 transitions. [2025-04-26 16:54:03,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 16:54:03,983 INFO L438 stractBuchiCegarLoop]: Abstraction has 56 states and 68 transitions. [2025-04-26 16:54:03,983 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:54:03,983 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 68 transitions. [2025-04-26 16:54:03,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-04-26 16:54:03,984 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:03,984 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:03,984 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:03,984 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:54:03,984 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_3) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3, N=v_N_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3, N=v_N_3} AuxVars[] AssignedVars[]" "[41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_4) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[]" "[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]" "[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]" "[85] L41-1-->writerFINAL: Formula: (<= v_writerThread1of1ForFork2_end_1 v_writerThread1of1ForFork2_j_3) InVars {writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_1, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_3} OutVars{writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_1, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_3} AuxVars[] AssignedVars[]" "[87] writerFINAL-->writerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[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]" "[66] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork0_sum_1 0) InVars {} OutVars{readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum]" "[67] L27-->L28-1: Formula: (= v_readerThread1of1ForFork0_start_1 v_readerThread1of1ForFork0_i_1) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_1, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_i]" "[69] L28-1-->L29: Formula: (< v_readerThread1of1ForFork0_i_5 v_readerThread1of1ForFork0_end_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} AuxVars[] AssignedVars[]" "[72] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork0_i_9 v_N_2) (<= 0 v_readerThread1of1ForFork0_i_9)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} AuxVars[] AssignedVars[]" "[73] L30-->L31: Formula: (= (+ v_readerThread1of1ForFork0_sum_3 (select v_A_1 v_readerThread1of1ForFork0_i_11)) v_readerThread1of1ForFork0_sum_4) InVars {A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum]" "[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[]" "[74] L31-->L28-1: Formula: (= v_readerThread1of1ForFork0_i_14 (+ v_readerThread1of1ForFork0_i_13 1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_13} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_14} AuxVars[] AssignedVars[readerThread1of1ForFork0_i]" "[68] L28-1-->readerFINAL: Formula: (<= v_readerThread1of1ForFork0_end_1 v_readerThread1of1ForFork0_i_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_3, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_3, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_1} AuxVars[] AssignedVars[]" "[70] readerFINAL-->readerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[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]" "[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[]" "[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]" "[75] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork1_sum_1 0) InVars {} OutVars{readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork1_sum]" "[76] L27-->L28-1: Formula: (= v_readerThread1of1ForFork1_i_1 v_readerThread1of1ForFork1_start_1) InVars {readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_1} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_1, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[readerThread1of1ForFork1_i]" [2025-04-26 16:54:03,985 INFO L754 eck$LassoCheckResult]: Loop: "[78] L28-1-->L29: Formula: (< v_readerThread1of1ForFork1_i_5 v_readerThread1of1ForFork1_end_3) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_5, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_3} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_5, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_3} AuxVars[] AssignedVars[]" "[81] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork1_i_9 v_N_2) (<= 0 v_readerThread1of1ForFork1_i_9)) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_9, N=v_N_2} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_9, N=v_N_2} AuxVars[] AssignedVars[]" "[82] L30-->L31: Formula: (= v_readerThread1of1ForFork1_sum_4 (+ (select v_A_1 v_readerThread1of1ForFork1_i_11) v_readerThread1of1ForFork1_sum_3)) InVars {A=v_A_1, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_11, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_11, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork1_sum]" "[83] L31-->L28-1: Formula: (= (+ v_readerThread1of1ForFork1_i_13 1) v_readerThread1of1ForFork1_i_14) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_13} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_14} AuxVars[] AssignedVars[readerThread1of1ForFork1_i]" [2025-04-26 16:54:03,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:03,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1757562245, now seen corresponding path program 1 times [2025-04-26 16:54:03,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:03,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489362690] [2025-04-26 16:54:03,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:03,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:03,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:54:03,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:54:03,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:03,992 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:03,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:54:03,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:54:03,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:03,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:03,998 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:03,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:03,999 INFO L85 PathProgramCache]: Analyzing trace with hash 3327685, now seen corresponding path program 2 times [2025-04-26 16:54:03,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:03,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770727783] [2025-04-26 16:54:03,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:03,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:04,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:04,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:04,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:04,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,003 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:04,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:04,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:04,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:04,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:04,007 INFO L85 PathProgramCache]: Analyzing trace with hash -189090753, now seen corresponding path program 1 times [2025-04-26 16:54:04,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:04,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162114338] [2025-04-26 16:54:04,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:04,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:04,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:54:04,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:54:04,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,018 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:04,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:54:04,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:54:04,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:04,390 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:04,390 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:04,390 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:04,390 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:04,390 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:04,391 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:04,391 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:04,391 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:04,391 INFO L132 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:54:04,391 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:04,391 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:04,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:04,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:04,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:04,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:04,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:04,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:04,656 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:04,656 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:04,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:04,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:04,658 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:04,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:54:04,661 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 [2025-04-26 16:54:04,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:04,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:04,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:04,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:04,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:04,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:04,687 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:04,707 INFO L436 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-04-26 16:54:04,707 INFO L437 ModelExtractionUtils]: 13 out of 46 variables were initially zero. Simplification set additionally 26 variables to zero. [2025-04-26 16:54:04,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:04,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:04,709 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:04,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:54:04,711 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:04,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:54:04,727 INFO L439 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-04-26 16:54:04,727 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:04,727 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(readerThread1of1ForFork1_i, ULTIMATE.start_min1) = -2*readerThread1of1ForFork1_i + 2*ULTIMATE.start_min1 + 1 Supporting invariants [1*ULTIMATE.start_min1 - 1*readerThread1of1ForFork1_end + 1 >= 0] [2025-04-26 16:54:04,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:54:04,737 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:04,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:04,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-26 16:54:04,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-26 16:54:04,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:04,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-26 16:54:04,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:04,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:04,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:04,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:04,988 WARN L254 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-26 16:54:04,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:05,018 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.10 stem predicates 2 loop predicates [2025-04-26 16:54:05,018 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 68 transitions. cyclomatic complexity: 19 Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (in total 25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:05,427 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 68 transitions. cyclomatic complexity: 19. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (in total 25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 121 states and 144 transitions. Complement of second has 15 states. [2025-04-26 16:54:05,427 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 10 stem states 1 non-accepting loop states 2 accepting loop states [2025-04-26 16:54:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (in total 25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:05,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2025-04-26 16:54:05,428 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 77 transitions. Stem has 21 letters. Loop has 4 letters. [2025-04-26 16:54:05,428 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:05,428 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 77 transitions. Stem has 25 letters. Loop has 4 letters. [2025-04-26 16:54:05,428 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:05,428 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 13 states and 77 transitions. Stem has 21 letters. Loop has 8 letters. [2025-04-26 16:54:05,428 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:05,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 144 transitions. [2025-04-26 16:54:05,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-04-26 16:54:05,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 105 states and 125 transitions. [2025-04-26 16:54:05,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-04-26 16:54:05,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-04-26 16:54:05,432 INFO L74 IsDeterministic]: Start isDeterministic. Operand 105 states and 125 transitions. [2025-04-26 16:54:05,432 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:05,432 INFO L218 hiAutomatonCegarLoop]: Abstraction has 105 states and 125 transitions. [2025-04-26 16:54:05,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 125 transitions. [2025-04-26 16:54:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2025-04-26 16:54:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.1940298507462686) internal successors, (in total 80), 66 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:05,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2025-04-26 16:54:05,437 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 80 transitions. [2025-04-26 16:54:05,437 INFO L438 stractBuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2025-04-26 16:54:05,437 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:54:05,437 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. [2025-04-26 16:54:05,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-04-26 16:54:05,438 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:05,438 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:05,440 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:05,440 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:54:05,441 INFO L752 eck$LassoCheckResult]: Stem: "[63] $Ultimate##0-->L56: Formula: (and (<= v_ULTIMATE.start_max1_3 v_N_3) (<= 0 v_ULTIMATE.start_min1_3)) InVars {ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3, N=v_N_3} OutVars{ULTIMATE.start_max1=v_ULTIMATE.start_max1_3, ULTIMATE.start_min1=v_ULTIMATE.start_min1_3, N=v_N_3} AuxVars[] AssignedVars[]" "[41] L56-->L59: Formula: (and (<= v_ULTIMATE.start_max2_3 v_N_4) (<= 0 v_ULTIMATE.start_min2_3)) InVars {ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} OutVars{ULTIMATE.start_max2=v_ULTIMATE.start_max2_3, N=v_N_4, ULTIMATE.start_min2=v_ULTIMATE.start_min2_3} AuxVars[] AssignedVars[]" "[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]" "[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]" "[85] L41-1-->writerFINAL: Formula: (<= v_writerThread1of1ForFork2_end_1 v_writerThread1of1ForFork2_j_3) InVars {writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_1, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_3} OutVars{writerThread1of1ForFork2_end=v_writerThread1of1ForFork2_end_1, writerThread1of1ForFork2_j=v_writerThread1of1ForFork2_j_3} AuxVars[] AssignedVars[]" "[87] writerFINAL-->writerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[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]" "[66] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork0_sum_1 0) InVars {} OutVars{readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum]" "[67] L27-->L28-1: Formula: (= v_readerThread1of1ForFork0_start_1 v_readerThread1of1ForFork0_i_1) InVars {readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_1, readerThread1of1ForFork0_start=v_readerThread1of1ForFork0_start_1} AuxVars[] AssignedVars[readerThread1of1ForFork0_i]" "[69] L28-1-->L29: Formula: (< v_readerThread1of1ForFork0_i_5 v_readerThread1of1ForFork0_end_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} AuxVars[] AssignedVars[]" "[72] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork0_i_9 v_N_2) (<= 0 v_readerThread1of1ForFork0_i_9)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} AuxVars[] AssignedVars[]" "[73] L30-->L31: Formula: (= (+ v_readerThread1of1ForFork0_sum_3 (select v_A_1 v_readerThread1of1ForFork0_i_11)) v_readerThread1of1ForFork0_sum_4) InVars {A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum]" "[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[]" "[74] L31-->L28-1: Formula: (= v_readerThread1of1ForFork0_i_14 (+ v_readerThread1of1ForFork0_i_13 1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_13} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_14} AuxVars[] AssignedVars[readerThread1of1ForFork0_i]" "[69] L28-1-->L29: Formula: (< v_readerThread1of1ForFork0_i_5 v_readerThread1of1ForFork0_end_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_5, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_3} AuxVars[] AssignedVars[]" "[72] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork0_i_9 v_N_2) (<= 0 v_readerThread1of1ForFork0_i_9)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_9, N=v_N_2} AuxVars[] AssignedVars[]" "[73] L30-->L31: Formula: (= (+ v_readerThread1of1ForFork0_sum_3 (select v_A_1 v_readerThread1of1ForFork0_i_11)) v_readerThread1of1ForFork0_sum_4) InVars {A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_11, readerThread1of1ForFork0_sum=v_readerThread1of1ForFork0_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork0_sum]" "[74] L31-->L28-1: Formula: (= v_readerThread1of1ForFork0_i_14 (+ v_readerThread1of1ForFork0_i_13 1)) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_13} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_14} AuxVars[] AssignedVars[readerThread1of1ForFork0_i]" "[68] L28-1-->readerFINAL: Formula: (<= v_readerThread1of1ForFork0_end_1 v_readerThread1of1ForFork0_i_3) InVars {readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_3, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_1} OutVars{readerThread1of1ForFork0_i=v_readerThread1of1ForFork0_i_3, readerThread1of1ForFork0_end=v_readerThread1of1ForFork0_end_1} AuxVars[] AssignedVars[]" "[70] readerFINAL-->readerEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[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]" "[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[]" "[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]" "[75] $Ultimate##0-->L27: Formula: (= v_readerThread1of1ForFork1_sum_1 0) InVars {} OutVars{readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_1} AuxVars[] AssignedVars[readerThread1of1ForFork1_sum]" "[76] L27-->L28-1: Formula: (= v_readerThread1of1ForFork1_i_1 v_readerThread1of1ForFork1_start_1) InVars {readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_1} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_1, readerThread1of1ForFork1_start=v_readerThread1of1ForFork1_start_1} AuxVars[] AssignedVars[readerThread1of1ForFork1_i]" [2025-04-26 16:54:05,441 INFO L754 eck$LassoCheckResult]: Loop: "[78] L28-1-->L29: Formula: (< v_readerThread1of1ForFork1_i_5 v_readerThread1of1ForFork1_end_3) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_5, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_3} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_5, readerThread1of1ForFork1_end=v_readerThread1of1ForFork1_end_3} AuxVars[] AssignedVars[]" "[81] L29-->L30: Formula: (and (<= v_readerThread1of1ForFork1_i_9 v_N_2) (<= 0 v_readerThread1of1ForFork1_i_9)) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_9, N=v_N_2} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_9, N=v_N_2} AuxVars[] AssignedVars[]" "[82] L30-->L31: Formula: (= v_readerThread1of1ForFork1_sum_4 (+ (select v_A_1 v_readerThread1of1ForFork1_i_11) v_readerThread1of1ForFork1_sum_3)) InVars {A=v_A_1, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_11, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_3} OutVars{A=v_A_1, readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_11, readerThread1of1ForFork1_sum=v_readerThread1of1ForFork1_sum_4} AuxVars[] AssignedVars[readerThread1of1ForFork1_sum]" "[83] L31-->L28-1: Formula: (= (+ v_readerThread1of1ForFork1_i_13 1) v_readerThread1of1ForFork1_i_14) InVars {readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_13} OutVars{readerThread1of1ForFork1_i=v_readerThread1of1ForFork1_i_14} AuxVars[] AssignedVars[readerThread1of1ForFork1_i]" [2025-04-26 16:54:05,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:05,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1329103113, now seen corresponding path program 2 times [2025-04-26 16:54:05,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:05,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469735343] [2025-04-26 16:54:05,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:05,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:05,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-26 16:54:05,451 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:54:05,451 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:54:05,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,451 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:05,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:54:05,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:54:05,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:05,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:05,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash 3327685, now seen corresponding path program 3 times [2025-04-26 16:54:05,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:05,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992583218] [2025-04-26 16:54:05,466 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:05,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:05,470 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:05,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:05,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:54:05,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,471 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:05,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:05,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:05,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:05,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:05,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:05,486 INFO L85 PathProgramCache]: Analyzing trace with hash -225060165, now seen corresponding path program 2 times [2025-04-26 16:54:05,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:05,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237452838] [2025-04-26 16:54:05,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:05,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:05,489 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-26 16:54:05,496 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:54:05,496 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:54:05,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,496 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:05,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:54:05,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:54:05,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:05,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:05,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:05,751 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:05,752 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:05,752 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:05,752 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:05,752 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:05,752 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,752 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:05,752 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:05,752 INFO L132 ssoRankerPreferences]: Filename of dumped script: optimistic-concurrency1.bpl_petrified1_Iteration5_Lasso [2025-04-26 16:54:05,752 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:05,752 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:05,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,822 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:05,962 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:05,962 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:05,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,965 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:05,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:54:05,967 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 [2025-04-26 16:54:05,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:05,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:05,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:05,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:05,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:05,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:05,986 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:05,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:54:05,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:05,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:05,998 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:05,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:54:06,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:06,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:06,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:06,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:06,013 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:06,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:06,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,021 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:06,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:54:06,024 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 [2025-04-26 16:54:06,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:06,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,036 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:06,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:06,041 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:06,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:06,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,050 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:06,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:54:06,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 [2025-04-26 16:54:06,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:06,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:06,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:06,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:06,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:06,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:06,078 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:06,093 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 16:54:06,093 INFO L437 ModelExtractionUtils]: 12 out of 46 variables were initially zero. Simplification set additionally 31 variables to zero. [2025-04-26 16:54:06,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:06,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:06,095 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:06,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:54:06,098 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:06,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:06,115 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:06,115 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:06,115 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(readerThread1of1ForFork1_i, readerThread1of1ForFork1_end) = -1*readerThread1of1ForFork1_i + 1*readerThread1of1ForFork1_end Supporting invariants [] [2025-04-26 16:54:06,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:06,124 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:06,136 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:06,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-26 16:54:06,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-26 16:54:06,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:06,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:06,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:06,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:06,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:54:06,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:54:06,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:06,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:06,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:06,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:06,201 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:54:06,201 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (in total 25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:06,229 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 20. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (in total 25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 71 states and 85 transitions. Complement of second has 4 states. [2025-04-26 16:54:06,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:06,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (in total 25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:06,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-26 16:54:06,230 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 25 letters. Loop has 4 letters. [2025-04-26 16:54:06,231 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:06,231 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 29 letters. Loop has 4 letters. [2025-04-26 16:54:06,231 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:06,231 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 25 letters. Loop has 8 letters. [2025-04-26 16:54:06,231 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:06,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 85 transitions. [2025-04-26 16:54:06,232 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:06,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 0 states and 0 transitions. [2025-04-26 16:54:06,232 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:06,232 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:06,232 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:06,232 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:06,232 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:06,232 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:06,232 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:06,232 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:54:06,232 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:06,232 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:06,232 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:06,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:54:06,243 INFO L201 PluginConnector]: Adding new model optimistic-concurrency1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:06 BoogieIcfgContainer [2025-04-26 16:54:06,243 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:06,244 INFO L158 Benchmark]: Toolchain (without parser) took 4688.39ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 83.8MB in the beginning and 106.2MB in the end (delta: -22.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:06,244 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:06,244 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.24ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 81.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:06,244 INFO L158 Benchmark]: Boogie Preprocessor took 26.69ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 80.9MB in the end (delta: 951.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:06,245 INFO L158 Benchmark]: RCFGBuilder took 183.83ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 71.5MB in the end (delta: 9.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:54:06,245 INFO L158 Benchmark]: BuchiAutomizer took 4444.14ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.4MB in the beginning and 106.2MB in the end (delta: -34.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:06,246 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.15ms. Allocated memory is still 155.2MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.24ms. Allocated memory is still 155.2MB. Free memory was 83.7MB in the beginning and 81.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.69ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 80.9MB in the end (delta: 951.3kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 183.83ms. Allocated memory is still 155.2MB. Free memory was 80.8MB in the beginning and 71.5MB in the end (delta: 9.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 4444.14ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.4MB in the beginning and 106.2MB in the end (delta: -34.8MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.8s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 52 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 363 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 360 mSDsluCounter, 327 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 217 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 286 IncrementalHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 110 mSDtfsCounter, 286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp86 ukn93 mio100 lsp86 div100 bol100 ite100 ukn100 eq164 hnf91 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms 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.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 177, Number of transitions in reduction automaton: 80, Number of states in reduction automaton: 64, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function end + -1 * j and consists of 4 locations. One deterministic module has affine ranking function 2 * N + -2 * i + 1 and consists of 4 locations. One deterministic module has affine ranking function min1 * 2 + -2 * i + 1 and consists of 13 locations. One deterministic module has affine ranking function end + -1 * i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 7 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:54:06,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...