/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-1.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:22:44,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:22:44,419 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,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:22:44,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:22:44,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:22:44,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:22:44,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:22:44,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:22:44,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:22:44,446 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:22:44,446 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:22:44,446 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:22:44,446 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:22:44,446 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:22:44,446 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:22:44,446 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:22:44,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:22:44,446 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:22:44,448 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:22:44,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:22:44,448 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:22:44,448 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:22:44,448 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:22:44,448 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:22:44,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:22:44,449 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:22:44,449 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:22:44,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:22:44,449 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:22:44,449 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:22:44,449 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:22:44,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:22:44,449 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:22:44,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:22:44,449 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:22:44,450 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:22:44,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:22:44,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:22:44,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:22:44,686 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:22:44,686 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:22:44,687 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-1.wvr.bpl [2025-04-26 16:22:44,687 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/parallel-sum-1.wvr.bpl' [2025-04-26 16:22:44,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:22:44,707 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:22:44,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:44,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:22:44,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:22:44,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "parallel-sum-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,740 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "parallel-sum-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,750 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:22:44,751 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:44,752 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:22:44,752 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:22:44,752 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:22:44,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "parallel-sum-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "parallel-sum-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "parallel-sum-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "parallel-sum-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,765 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "parallel-sum-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,766 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "parallel-sum-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,768 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "parallel-sum-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "parallel-sum-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "parallel-sum-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,783 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:22:44,783 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:22:44,783 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:22:44,783 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:22:44,785 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "parallel-sum-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/1) ... [2025-04-26 16:22:44,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,809 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,812 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,833 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:22:44,833 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:22:44,833 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:22:44,833 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:22:44,833 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:22:44,833 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:22:44,833 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:22:44,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:22:44,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:22:44,834 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:22:44,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:22:44,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:22:44,834 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:22:44,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:22:44,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:22:44,835 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,872 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:22:44,874 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:22:44,970 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:22:44,971 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:22:44,997 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:22:44,997 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-04-26 16:22:44,999 INFO L201 PluginConnector]: Adding new model parallel-sum-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:44 BoogieIcfgContainer [2025-04-26 16:22:44,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:22:45,001 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:22:45,001 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:22:45,005 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:22:45,005 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:45,006 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "parallel-sum-1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:44" (1/2) ... [2025-04-26 16:22:45,007 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27609406 and model type parallel-sum-1.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,007 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:45,007 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "parallel-sum-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:44" (2/2) ... [2025-04-26 16:22:45,008 INFO L376 chiAutomizerObserver]: Analyzing ICFG parallel-sum-1.wvr.bpl [2025-04-26 16:22:45,061 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:22:45,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 33 transitions, 94 flow [2025-04-26 16:22:45,116 INFO L116 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-04-26 16:22:45,118 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:22:45,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 25 events. 4/25 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 16:22:45,125 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 33 transitions, 94 flow [2025-04-26 16:22:45,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 25 transitions, 74 flow [2025-04-26 16:22:45,128 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 34 places, 25 transitions, 74 flow [2025-04-26 16:22:45,138 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:22:45,139 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:22:45,139 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:22:45,139 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:22:45,139 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:22:45,139 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:22:45,139 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:22:45,139 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:22:45,140 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:22:45,203 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 152 [2025-04-26 16:22:45,204 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:45,204 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:45,207 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:45,207 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:22:45,207 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:22:45,208 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 165 states, but on-demand construction may add more states [2025-04-26 16:22:45,213 INFO L131 ngComponentsAnalysis]: Automaton has 37 accepting balls. 152 [2025-04-26 16:22:45,213 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:45,214 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:45,214 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:45,214 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:22:45,217 INFO L752 eck$LassoCheckResult]: Stem: "[74] $Ultimate##0-->L76: Formula: (and (= v_s1_5 v_s2_1) (= v_s1_5 0) (= v_i2_1 v_s1_5) (= v_i1_9 v_s1_5)) InVars {i1=v_i1_9, i2=v_i2_1, s1=v_s1_5, s2=v_s2_1} OutVars{i1=v_i1_9, i2=v_i2_1, s1=v_s1_5, s2=v_s2_1} AuxVars[] AssignedVars[]" "[92] L76-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:22:45,218 INFO L754 eck$LassoCheckResult]: Loop: "[79] L23-->L24: Formula: (and (< v_i1_16 v_n_6) (= v_i1_15 (+ v_i1_16 1)) (= v_t11_5 (select v_x_7 v_i1_15))) InVars {i1=v_i1_16, x=v_x_7, n=v_n_6} OutVars{t11=v_t11_5, i1=v_i1_15, x=v_x_7, n=v_n_6} AuxVars[] AssignedVars[t11, i1]" "[80] L24-->L23: Formula: (= (+ v_s1_2 v_t11_2) v_s1_1) InVars {t11=v_t11_2, s1=v_s1_2} OutVars{t11=v_t11_2, s1=v_s1_1} AuxVars[] AssignedVars[s1]" [2025-04-26 16:22:45,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:45,222 INFO L85 PathProgramCache]: Analyzing trace with hash 3347, now seen corresponding path program 1 times [2025-04-26 16:22:45,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:45,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816448462] [2025-04-26 16:22:45,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:45,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:45,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:45,280 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,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:45,281 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:45,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:45,283 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,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:45,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:45,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:45,302 INFO L85 PathProgramCache]: Analyzing trace with hash 3490, now seen corresponding path program 1 times [2025-04-26 16:22:45,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:45,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923055704] [2025-04-26 16:22:45,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:45,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:45,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:45,316 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,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:45,316 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:45,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:45,322 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,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:45,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:45,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:45,325 INFO L85 PathProgramCache]: Analyzing trace with hash 3218996, now seen corresponding path program 1 times [2025-04-26 16:22:45,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:45,328 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881023380] [2025-04-26 16:22:45,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:45,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:45,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:45,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:45,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:45,340 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:45,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:45,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:45,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:45,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:45,451 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:45,452 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:45,452 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:45,452 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:45,452 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:45,452 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:45,452 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:45,452 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:45,452 INFO L132 ssoRankerPreferences]: Filename of dumped script: parallel-sum-1.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:22:45,452 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:45,453 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:45,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:45,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:45,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:45,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:45,565 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:45,568 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:45,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:45,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:45,571 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,573 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,574 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,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:45,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:45,585 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:45,585 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:45,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:45,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:45,598 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:45,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:45,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:45,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:45,608 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,635 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,636 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,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:45,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:45,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:45,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:45,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:45,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:45,655 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:45,661 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,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:45,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:45,663 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,663 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,665 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,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:45,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:45,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:45,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:45,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:45,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:45,682 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:45,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:22:45,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:45,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:45,689 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,692 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,692 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,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:45,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:45,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:45,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:45,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:45,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:45,711 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:45,717 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:45,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:45,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:45,719 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:45,721 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:45,722 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,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:45,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:45,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:45,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:45,735 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:45,735 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:45,740 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:45,746 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:22:45,746 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:45,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:45,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:45,749 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:45,750 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:45,750 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:45,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:22:45,769 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:45,769 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:45,769 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, n) = -1*i1 + 1*n Supporting invariants [] [2025-04-26 16:22:45,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:22:45,779 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:45,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:45,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:45,829 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,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:45,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:45,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:45,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:45,845 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,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:45,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:45,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:45,917 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:45,936 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:45,938 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 165 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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,006 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 165 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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 520 states and 2109 transitions. Complement of second has 5 states. [2025-04-26 16:22:46,009 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,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 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,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2025-04-26 16:22:46,017 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:22:46,017 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,017 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:22:46,017 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,017 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 41 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:22:46,018 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 520 states and 2109 transitions. [2025-04-26 16:22:46,029 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 124 [2025-04-26 16:22:46,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 520 states to 438 states and 1813 transitions. [2025-04-26 16:22:46,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2025-04-26 16:22:46,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 256 [2025-04-26 16:22:46,044 INFO L74 IsDeterministic]: Start isDeterministic. Operand 438 states and 1813 transitions. [2025-04-26 16:22:46,046 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:46,046 INFO L218 hiAutomatonCegarLoop]: Abstraction has 438 states and 1813 transitions. [2025-04-26 16:22:46,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states and 1813 transitions. [2025-04-26 16:22:46,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 328. [2025-04-26 16:22:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 328 states have (on average 4.3567073170731705) internal successors, (in total 1429), 327 states have internal predecessors, (1429), 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,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 1429 transitions. [2025-04-26 16:22:46,098 INFO L240 hiAutomatonCegarLoop]: Abstraction has 328 states and 1429 transitions. [2025-04-26 16:22:46,098 INFO L438 stractBuchiCegarLoop]: Abstraction has 328 states and 1429 transitions. [2025-04-26 16:22:46,098 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:22:46,099 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 328 states and 1429 transitions. [2025-04-26 16:22:46,104 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 124 [2025-04-26 16:22:46,104 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:46,105 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:46,105 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:22:46,105 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:22:46,105 INFO L752 eck$LassoCheckResult]: Stem: "[74] $Ultimate##0-->L76: Formula: (and (= v_s1_5 v_s2_1) (= v_s1_5 0) (= v_i2_1 v_s1_5) (= v_i1_9 v_s1_5)) InVars {i1=v_i1_9, i2=v_i2_1, s1=v_s1_5, s2=v_s2_1} OutVars{i1=v_i1_9, i2=v_i2_1, s1=v_s1_5, s2=v_s2_1} AuxVars[] AssignedVars[]" "[92] L76-->L23: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[95] L76-1-->L36: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[98] L77-->L49: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:22:46,106 INFO L754 eck$LassoCheckResult]: Loop: "[85] L49-->L50: Formula: (and (= (+ v_i2_16 1) v_i2_15) (< v_i2_16 v_n_10) (= v_t12_5 (select v_x_15 v_i2_15))) InVars {x=v_x_15, i2=v_i2_16, n=v_n_10} OutVars{t12=v_t12_5, x=v_x_15, i2=v_i2_15, n=v_n_10} AuxVars[] AssignedVars[t12, i2]" "[86] L50-->L49: Formula: (= (+ v_s2_4 v_t12_2) v_s2_3) InVars {t12=v_t12_2, s2=v_s2_4} OutVars{t12=v_t12_2, s2=v_s2_3} AuxVars[] AssignedVars[s2]" [2025-04-26 16:22:46,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,106 INFO L85 PathProgramCache]: Analyzing trace with hash 3219510, now seen corresponding path program 1 times [2025-04-26 16:22:46,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172144953] [2025-04-26 16:22:46,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:46,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 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 4 of 4 statements. [2025-04-26 16:22:46,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,113 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:46,117 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,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash 3682, now seen corresponding path program 1 times [2025-04-26 16:22:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,121 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894976030] [2025-04-26 16:22:46,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:46,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:46,128 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,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [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,130 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 sat [2025-04-26 16:22:46,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1201015465, now seen corresponding path program 1 times [2025-04-26 16:22:46,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000936549] [2025-04-26 16:22:46,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:46,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:22:46,141 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,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,141 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:22:46,146 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,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,225 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:46,225 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:46,225 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:46,225 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:46,225 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:46,225 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,225 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:46,225 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:46,225 INFO L132 ssoRankerPreferences]: Filename of dumped script: parallel-sum-1.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:22:46,225 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:46,225 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:46,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,258 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,360 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:46,360 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:46,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,363 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,364 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,365 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,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,376 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,380 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:46,387 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,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,389 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,390 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,391 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,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,402 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,407 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:46,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:46,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,417 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,418 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,419 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,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,433 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,433 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,437 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:46,443 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,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,446 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,447 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,449 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,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,467 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:46,472 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:22:46,472 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:46,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,474 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:22:46,475 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:22:46,476 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:46,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:22:46,494 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:46,494 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:46,495 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, n) = -1*i2 + 1*n Supporting invariants [] [2025-04-26 16:22:46,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:22:46,501 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:46,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:46,521 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,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:46,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:46,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:46,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:46,532 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,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:46,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:46,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:46,547 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,548 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,548 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 328 states and 1429 transitions. cyclomatic complexity: 1172 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:46,604 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 328 states and 1429 transitions. cyclomatic complexity: 1172. 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 1038 states and 4524 transitions. Complement of second has 4 states. [2025-04-26 16:22:46,605 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:46,605 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:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-26 16:22:46,605 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:22:46,606 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,606 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:22:46,606 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,606 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 42 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:22:46,606 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1038 states and 4524 transitions. [2025-04-26 16:22:46,623 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:46,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1038 states to 0 states and 0 transitions. [2025-04-26 16:22:46,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:22:46,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:22:46,624 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:22:46,624 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:22:46,624 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:46,624 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:46,624 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:46,624 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:22:46,624 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:22:46,624 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:46,624 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:22:46,629 INFO L201 PluginConnector]: Adding new model parallel-sum-1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:22:46 BoogieIcfgContainer [2025-04-26 16:22:46,630 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:22:46,630 INFO L158 Benchmark]: Toolchain (without parser) took 1922.90ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 87.9MB in the beginning and 53.3MB in the end (delta: 34.6MB). Peak memory consumption was 43.6MB. Max. memory is 8.0GB. [2025-04-26 16:22:46,631 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.14ms. Allocated memory is still 159.4MB. Free memory was 89.1MB in the beginning and 88.9MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:46,632 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.39ms. Allocated memory is still 159.4MB. Free memory was 87.9MB in the beginning and 86.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:46,632 INFO L158 Benchmark]: Boogie Preprocessor took 31.11ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 85.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:46,632 INFO L158 Benchmark]: RCFGBuilder took 216.01ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 74.5MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:22:46,633 INFO L158 Benchmark]: BuchiAutomizer took 1629.09ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 74.3MB in the beginning and 53.3MB in the end (delta: 21.0MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. [2025-04-26 16:22:46,633 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.14ms. Allocated memory is still 159.4MB. Free memory was 89.1MB in the beginning and 88.9MB in the end (delta: 199.3kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.39ms. Allocated memory is still 159.4MB. Free memory was 87.9MB in the beginning and 86.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 31.11ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 85.0MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 216.01ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 74.5MB in the end (delta: 10.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 1629.09ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 74.3MB in the beginning and 53.3MB in the end (delta: 21.0MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 110 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, 45 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 43 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 23 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital44 mio100 ax100 hnf100 lsp64 ukn92 mio100 lsp53 div100 bol100 ite100 ukn100 eq185 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms 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:46,647 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...