/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/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/parallel-sum-2.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:22:44,463 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:22:44,523 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:22:44,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:22:44,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:22:44,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:22:44,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:22:44,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:22:44,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:22:44,552 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:22:44,552 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:22:44,553 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:22:44,553 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:22:44,554 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:22:44,554 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:22:44,554 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:22:44,554 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:22:44,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:22:44,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:22:44,555 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:22:44,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:22:44,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:22:44,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:22:44,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:22:44,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:22:44,555 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:22:44,555 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:22:44,555 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:22:44,555 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:22:44,555 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:22:44,555 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:22:44,556 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:22:44,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:22:44,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:22:44,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:22:44,556 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:22:44,556 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:22:44,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:22:44,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:22:44,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:22:44,787 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:22:44,787 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:22:44,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/parallel-sum-2.wvr.bpl [2025-04-26 16:22:44,788 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/parallel-sum-2.wvr.bpl' [2025-04-26 16:22:44,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:22:44,806 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:22:44,809 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:44,809 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:22:44,809 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:22:44,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,840 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,847 INFO L138 Inliner]: procedures = 7, calls = 6, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:22:44,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:44,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:22:44,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:22:44,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:22:44,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,854 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,856 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:22:44,872 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:22:44,872 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:22:44,872 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:22:44,873 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,901 INFO L229 MonitoredProcess]: Starting monitored process 1 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:22:44,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:22:44,925 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:22:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:22:44,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:22:44,925 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:22:44,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:22:44,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:22:44,926 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:22:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:22:44,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:22:44,926 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:22:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:22:44,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:22:44,926 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:22:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:22:44,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:22:44,926 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread5 given in one single declaration [2025-04-26 16:22:44,926 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-26 16:22:44,926 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-26 16:22:44,926 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread6 given in one single declaration [2025-04-26 16:22:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-26 16:22:44,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-26 16:22:44,928 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:22:44,970 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:22:44,971 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:22:45,065 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:22:45,065 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:22:45,087 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:22:45,088 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-04-26 16:22:45,088 INFO L201 PluginConnector]: Adding new model parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:45 BoogieIcfgContainer [2025-04-26 16:22:45,088 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:22:45,092 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:22:45,092 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:22:45,097 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:22:45,097 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:45,098 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/2) ... [2025-04-26 16:22:45,099 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28e522b and model type parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:22:45, skipping insertion in model container [2025-04-26 16:22:45,099 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:45,099 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:45" (2/2) ... [2025-04-26 16:22:45,100 INFO L376 chiAutomizerObserver]: Analyzing ICFG parallel-sum-2.wvr.bpl [2025-04-26 16:22:45,176 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-04-26 16:22:45,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 66 places, 61 transitions, 188 flow [2025-04-26 16:22:45,231 INFO L116 PetriNetUnfolderBase]: 8/39 cut-off events. [2025-04-26 16:22:45,232 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 16:22:45,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 39 events. 8/39 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 66 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 49. Up to 3 conditions per place. [2025-04-26 16:22:45,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 66 places, 61 transitions, 188 flow [2025-04-26 16:22:45,238 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 39 transitions, 126 flow [2025-04-26 16:22:45,238 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 50 places, 39 transitions, 126 flow [2025-04-26 16:22:45,249 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:22:45,249 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:22:45,249 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:22:45,249 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:22:45,249 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:22:45,249 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:22:45,249 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:22:45,249 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:22:45,250 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:22:45,356 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 360 [2025-04-26 16:22:45,356 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:45,356 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:45,360 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:22:45,360 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:22:45,360 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:22:45,360 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 446 states, but on-demand construction may add more states [2025-04-26 16:22:45,378 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 360 [2025-04-26 16:22:45,378 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:45,379 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:45,379 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:22:45,379 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:22:45,385 INFO L752 eck$LassoCheckResult]: Stem: "[92] $Ultimate##0-->L102: Formula: (and (= v_i1_6 v_s11_4) (= v_s11_4 v_s22_1) (= v_s12_1 v_s11_4) (= v_i2_1 v_s11_4) (= v_s11_4 v_s21_2) (= v_s11_4 0)) InVars {s12=v_s12_1, i1=v_i1_6, i2=v_i2_1, s21=v_s21_2, s11=v_s11_4, s22=v_s22_1} OutVars{s12=v_s12_1, i1=v_i1_6, i2=v_i2_1, s21=v_s21_2, s11=v_s11_4, s22=v_s22_1} AuxVars[] AssignedVars[]" "[129] L102-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[144] $Ultimate##0-->L27: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_4) (= 2 v_thread2Thread1of1ForFork0_thidvar1_4)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 16:22:45,385 INFO L754 eck$LassoCheckResult]: Loop: "[106] L27-->L28: Formula: (and (= v_i1_15 (+ v_i1_16 1)) (< v_i1_16 v_n_7) (= v_t11_5 (select v_x_7 v_i1_15))) InVars {i1=v_i1_16, x=v_x_7, n=v_n_7} OutVars{t11=v_t11_5, i1=v_i1_15, x=v_x_7, n=v_n_7} AuxVars[] AssignedVars[t11, i1]" "[107] L28-->L27: Formula: (= (+ v_s11_3 v_t11_2) v_s11_2) InVars {t11=v_t11_2, s11=v_s11_3} OutVars{t11=v_t11_2, s11=v_s11_2} AuxVars[] AssignedVars[s11]" [2025-04-26 16:22:45,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:45,390 INFO L85 PathProgramCache]: Analyzing trace with hash 122346, now seen corresponding path program 1 times [2025-04-26 16:22:45,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:45,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382078302] [2025-04-26 16:22:45,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:45,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:45,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:45,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:45,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:45,473 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:45,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:45,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:45,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:45,491 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:45,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:45,494 INFO L85 PathProgramCache]: Analyzing trace with hash 4354, now seen corresponding path program 1 times [2025-04-26 16:22:45,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:45,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752590025] [2025-04-26 16:22:45,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:45,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:45,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:45,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:45,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:45,500 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:45,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:45,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:45,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:45,508 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:45,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:45,509 INFO L85 PathProgramCache]: Analyzing trace with hash 117577899, now seen corresponding path program 1 times [2025-04-26 16:22:45,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:45,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107084264] [2025-04-26 16:22:45,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:45,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:45,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:45,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:45,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:45,518 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:45,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:45,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:45,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:45,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:45,662 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:45,663 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:45,663 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:45,664 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:45,664 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:45,664 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:45,664 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:45,664 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:45,664 INFO L132 ssoRankerPreferences]: Filename of dumped script: parallel-sum-2.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:22:45,664 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:45,664 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:45,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:45,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:45,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:45,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:45,709 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:45,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:45,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:45,718 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:45,829 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:45,853 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:45,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:45,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:45,858 INFO L229 MonitoredProcess]: Starting monitored process 2 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:22:45,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:22:45,861 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:22:45,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:45,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:45,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:45,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:45,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:45,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:45,888 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:45,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:22:45,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:45,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:45,898 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:22:45,898 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:22:45,899 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:22:45,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:45,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:45,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:45,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:45,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:45,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:45,916 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:45,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:22:45,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:45,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:45,923 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:22:45,924 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:22:45,926 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:22:45,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:45,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:45,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:45,935 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:45,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:45,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:45,941 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:45,947 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:22:45,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:45,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:45,948 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:22:45,949 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:22:45,950 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:22:45,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:45,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:45,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:45,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:45,965 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:45,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:45,970 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:46,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:22:46,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,005 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:22:46,006 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:22:46,007 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:22:46,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,029 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:46,036 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:22:46,037 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:46,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,039 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:22:46,041 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:22:46,042 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:46,059 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:22:46,059 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:46,059 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:46,060 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, n) = -1*i1 + 1*n Supporting invariants [] [2025-04-26 16:22:46,066 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:22:46,068 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:46,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:46,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:46,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:46,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:46,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:46,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:46,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:46,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:46,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:46,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:46,192 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:22:46,216 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:22:46,219 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 446 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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:22:46,330 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 446 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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 1299 states and 5440 transitions. Complement of second has 5 states. [2025-04-26 16:22:46,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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:22:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-04-26 16:22:46,341 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:22:46,341 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,341 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:22:46,341 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,341 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 80 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:22:46,342 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1299 states and 5440 transitions. [2025-04-26 16:22:46,359 INFO L131 ngComponentsAnalysis]: Automaton has 105 accepting balls. 252 [2025-04-26 16:22:46,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1299 states to 815 states and 3597 transitions. [2025-04-26 16:22:46,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 324 [2025-04-26 16:22:46,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 517 [2025-04-26 16:22:46,383 INFO L74 IsDeterministic]: Start isDeterministic. Operand 815 states and 3597 transitions. [2025-04-26 16:22:46,383 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:46,383 INFO L218 hiAutomatonCegarLoop]: Abstraction has 815 states and 3597 transitions. [2025-04-26 16:22:46,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states and 3597 transitions. [2025-04-26 16:22:46,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 627. [2025-04-26 16:22:46,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 627 states have (on average 4.598086124401914) internal successors, (in total 2883), 626 states have internal predecessors, (2883), 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:22:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 2883 transitions. [2025-04-26 16:22:46,441 INFO L240 hiAutomatonCegarLoop]: Abstraction has 627 states and 2883 transitions. [2025-04-26 16:22:46,442 INFO L438 stractBuchiCegarLoop]: Abstraction has 627 states and 2883 transitions. [2025-04-26 16:22:46,442 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:22:46,442 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 627 states and 2883 transitions. [2025-04-26 16:22:46,447 INFO L131 ngComponentsAnalysis]: Automaton has 105 accepting balls. 252 [2025-04-26 16:22:46,447 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:46,447 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:46,447 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:22:46,447 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:22:46,449 INFO L752 eck$LassoCheckResult]: Stem: "[92] $Ultimate##0-->L102: Formula: (and (= v_i1_6 v_s11_4) (= v_s11_4 v_s22_1) (= v_s12_1 v_s11_4) (= v_i2_1 v_s11_4) (= v_s11_4 v_s21_2) (= v_s11_4 0)) InVars {s12=v_s12_1, i1=v_i1_6, i2=v_i2_1, s21=v_s21_2, s11=v_s11_4, s22=v_s22_1} OutVars{s12=v_s12_1, i1=v_i1_6, i2=v_i2_1, s21=v_s21_2, s11=v_s11_4, s22=v_s22_1} AuxVars[] AssignedVars[]" "[129] L102-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork1_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_thidvar0]" "[138] L102-1-->$Ultimate##0: Formula: (and (= v_thread4Thread1of1ForFork4_thidvar2_2 4) (= v_thread4Thread1of1ForFork4_thidvar0_2 4) (= v_thread4Thread1of1ForFork4_thidvar1_2 4) (= v_thread4Thread1of1ForFork4_thidvar3_2 4)) InVars {} OutVars{thread4Thread1of1ForFork4_thidvar0=v_thread4Thread1of1ForFork4_thidvar0_2, thread4Thread1of1ForFork4_thidvar1=v_thread4Thread1of1ForFork4_thidvar1_2, thread4Thread1of1ForFork4_thidvar2=v_thread4Thread1of1ForFork4_thidvar2_2, thread4Thread1of1ForFork4_thidvar3=v_thread4Thread1of1ForFork4_thidvar3_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork4_thidvar0, thread4Thread1of1ForFork4_thidvar1, thread4Thread1of1ForFork4_thidvar2, thread4Thread1of1ForFork4_thidvar3]" "[150] $Ultimate##0-->L64: Formula: (and (= v_thread5Thread1of1ForFork2_thidvar1_4 5) (= v_thread5Thread1of1ForFork2_thidvar4_4 5) (= v_thread5Thread1of1ForFork2_thidvar0_4 5) (= v_thread5Thread1of1ForFork2_thidvar3_4 5) (= v_thread5Thread1of1ForFork2_thidvar2_4 5)) InVars {} OutVars{thread5Thread1of1ForFork2_thidvar4=v_thread5Thread1of1ForFork2_thidvar4_4, thread5Thread1of1ForFork2_thidvar2=v_thread5Thread1of1ForFork2_thidvar2_4, thread5Thread1of1ForFork2_thidvar3=v_thread5Thread1of1ForFork2_thidvar3_4, thread5Thread1of1ForFork2_thidvar0=v_thread5Thread1of1ForFork2_thidvar0_4, thread5Thread1of1ForFork2_thidvar1=v_thread5Thread1of1ForFork2_thidvar1_4} AuxVars[] AssignedVars[thread5Thread1of1ForFork2_thidvar4, thread5Thread1of1ForFork2_thidvar2, thread5Thread1of1ForFork2_thidvar3, thread5Thread1of1ForFork2_thidvar0, thread5Thread1of1ForFork2_thidvar1]" [2025-04-26 16:22:46,449 INFO L754 eck$LassoCheckResult]: Loop: "[119] L64-->L65: Formula: (and (= (+ v_i2_16 1) v_i2_15) (< v_i2_16 v_n_11) (= v_t12_5 (select v_x_15 v_i2_15))) InVars {x=v_x_15, i2=v_i2_16, n=v_n_11} OutVars{t12=v_t12_5, x=v_x_15, i2=v_i2_15, n=v_n_11} AuxVars[] AssignedVars[t12, i2]" "[120] L65-->L64: Formula: (= v_s12_3 (+ v_s12_4 v_t12_2)) InVars {s12=v_s12_4, t12=v_t12_2} OutVars{s12=v_s12_3, t12=v_t12_2} AuxVars[] AssignedVars[s12]" [2025-04-26 16:22:46,451 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,451 INFO L85 PathProgramCache]: Analyzing trace with hash 3792690, now seen corresponding path program 1 times [2025-04-26 16:22:46,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,451 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718360998] [2025-04-26 16:22:46,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:46,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:46,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:46,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,461 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:46,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:46,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,473 INFO L85 PathProgramCache]: Analyzing trace with hash 4770, now seen corresponding path program 1 times [2025-04-26 16:22:46,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309143170] [2025-04-26 16:22:46,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:46,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:46,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:46,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,479 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:46,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:46,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,487 INFO L85 PathProgramCache]: Analyzing trace with hash -650188397, now seen corresponding path program 1 times [2025-04-26 16:22:46,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,487 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801736011] [2025-04-26 16:22:46,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:46,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:22:46,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:22:46,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,498 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:22:46,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:22:46,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,635 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:46,635 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:46,635 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:46,635 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:46,635 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:46,635 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,635 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:46,635 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:46,635 INFO L132 ssoRankerPreferences]: Filename of dumped script: parallel-sum-2.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:22:46,635 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:46,635 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:46,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,812 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:46,812 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:46,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,815 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:22:46,816 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:22:46,817 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:22:46,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,828 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,832 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:46,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:22:46,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,840 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:22:46,841 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:22:46,842 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:22:46,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,854 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,857 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:46,862 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:22:46,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,864 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:22:46,866 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:22:46,867 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:22:46,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,884 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:46,893 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:22:46,893 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:46,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,895 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:22:46,897 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:22:46,898 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:46,915 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:22:46,915 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:46,915 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:46,916 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, n) = -1*i2 + 1*n Supporting invariants [] [2025-04-26 16:22:46,922 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:22:46,923 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:46,934 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:46,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:46,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:46,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:46,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:46,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:46,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:46,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:46,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:46,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:46,972 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:22:46,973 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:22:46,973 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 627 states and 2883 transitions. cyclomatic complexity: 2406 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:22:47,070 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 627 states and 2883 transitions. cyclomatic complexity: 2406. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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 2444 states and 12108 transitions. Complement of second has 4 states. [2025-04-26 16:22:47,070 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:22:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 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:22:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2025-04-26 16:22:47,071 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:22:47,071 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:47,071 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:22:47,071 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:47,071 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 70 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:22:47,071 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:47,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2444 states and 12108 transitions. [2025-04-26 16:22:47,102 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:47,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2444 states to 0 states and 0 transitions. [2025-04-26 16:22:47,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:22:47,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:22:47,103 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:22:47,103 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:22:47,103 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:47,103 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:47,103 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:47,103 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:22:47,103 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:22:47,103 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:47,103 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:22:47,111 INFO L201 PluginConnector]: Adding new model parallel-sum-2.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:22:47 BoogieIcfgContainer [2025-04-26 16:22:47,111 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:22:47,111 INFO L158 Benchmark]: Toolchain (without parser) took 2305.27ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 85.7MB in the beginning and 77.1MB in the end (delta: 8.6MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. [2025-04-26 16:22:47,111 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:47,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.45ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 83.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:47,112 INFO L158 Benchmark]: Boogie Preprocessor took 22.64ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 81.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:47,112 INFO L158 Benchmark]: RCFGBuilder took 216.05ms. Allocated memory is still 159.4MB. Free memory was 81.9MB in the beginning and 71.0MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:22:47,112 INFO L158 Benchmark]: BuchiAutomizer took 2018.52ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 70.9MB in the beginning and 77.1MB in the end (delta: -6.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:47,113 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.17ms. Allocated memory is still 159.4MB. Free memory is still 86.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.45ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 83.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.64ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 81.9MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 216.05ms. Allocated memory is still 159.4MB. Free memory was 81.9MB in the beginning and 71.0MB in the end (delta: 11.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2018.52ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 70.9MB in the beginning and 77.1MB in the end (delta: -6.3MB). 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 1.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 188 StatesRemovedByMinimization, 1 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 [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 89 IncrementalHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 40 mSDtfsCounter, 89 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital59 mio100 ax100 hnf100 lsp48 ukn92 mio100 lsp53 div100 bol100 ite100 ukn100 eq185 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n + -1 * i1 and consists of 4 locations. One deterministic module has affine ranking function -1 * i2 + n and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:22:47,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...