/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-equiv.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:22:45,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:22:45,249 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:45,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:22:45,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:22:45,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:22:45,270 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:22:45,270 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:22:45,271 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:22:45,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:22:45,271 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:22:45,271 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:22:45,271 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:22:45,271 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:22:45,271 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:22:45,271 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:22:45,271 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:22:45,271 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:22:45,271 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:22:45,271 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:22:45,271 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:22:45,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:22:45,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:22:45,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:22:45,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:22:45,272 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:22:45,272 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:22:45,272 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:22:45,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:22:45,272 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:22:45,272 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:22:45,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:22:45,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:22:45,272 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:22:45,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:22:45,272 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:22:45,272 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:22:45,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:22:45,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:22:45,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:22:45,479 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:22:45,479 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:22:45,480 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-equiv.wvr.bpl [2025-04-26 16:22:45,480 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/parallel-sum-equiv.wvr.bpl' [2025-04-26 16:22:45,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:22:45,503 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:22:45,504 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:45,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:22:45,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:22:45,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:45" (1/1) ... [2025-04-26 16:22:45,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:45" (1/1) ... [2025-04-26 16:22:45,538 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:22:45,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:45,540 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:22:45,540 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:22:45,540 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:22:45,544 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:45" (1/1) ... [2025-04-26 16:22:45,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:45" (1/1) ... [2025-04-26 16:22:45,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:45" (1/1) ... [2025-04-26 16:22:45,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:45" (1/1) ... [2025-04-26 16:22:45,546 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:45" (1/1) ... [2025-04-26 16:22:45,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:45" (1/1) ... [2025-04-26 16:22:45,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:45" (1/1) ... [2025-04-26 16:22:45,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:45" (1/1) ... [2025-04-26 16:22:45,549 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:45" (1/1) ... [2025-04-26 16:22:45,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:22:45,560 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:22:45,560 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:22:45,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:22:45,561 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:45" (1/1) ... [2025-04-26 16:22:45,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:45,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:45,585 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:45,588 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:45,609 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:22:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:22:45,610 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:22:45,610 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:22:45,610 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:22:45,610 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:22:45,610 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:22:45,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:22:45,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:22:45,610 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:22:45,610 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:22:45,610 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:22:45,610 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:22:45,610 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:22:45,610 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:22:45,612 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:45,645 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:22:45,646 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:22:45,718 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:22:45,719 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:22:45,736 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:22:45,737 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 16:22:45,737 INFO L201 PluginConnector]: Adding new model parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:45 BoogieIcfgContainer [2025-04-26 16:22:45,737 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:22:45,738 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:22:45,738 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:22:45,743 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:22:45,743 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:45,743 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:45" (1/2) ... [2025-04-26 16:22:45,744 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b7de85f and model type parallel-sum-equiv.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,745 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:45,745 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:45" (2/2) ... [2025-04-26 16:22:45,746 INFO L376 chiAutomizerObserver]: Analyzing ICFG parallel-sum-equiv.wvr.bpl [2025-04-26 16:22:45,796 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-04-26 16:22:45,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 40 transitions, 120 flow [2025-04-26 16:22:45,843 INFO L116 PetriNetUnfolderBase]: 5/29 cut-off events. [2025-04-26 16:22:45,845 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:22:45,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 29 events. 5/29 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 32. Up to 3 conditions per place. [2025-04-26 16:22:45,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 40 transitions, 120 flow [2025-04-26 16:22:45,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 29 transitions, 88 flow [2025-04-26 16:22:45,853 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 37 places, 29 transitions, 88 flow [2025-04-26 16:22:45,861 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:22:45,861 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:22:45,861 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:22:45,861 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:22:45,862 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:22:45,862 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:22:45,862 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:22:45,862 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:22:45,864 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:22:45,922 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 122 [2025-04-26 16:22:45,923 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:45,923 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:45,926 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:22:45,926 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:22:45,926 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:22:45,927 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 178 states, but on-demand construction may add more states [2025-04-26 16:22:45,933 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 122 [2025-04-26 16:22:45,933 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:45,933 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:45,933 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:22:45,933 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:22:45,937 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[80] $Ultimate##0-->L50: Formula: (and (= v_s_2_7 0) (= v_i_3_12 0)) InVars {} OutVars{i_3=v_i_3_12, s_2=v_s_2_7} AuxVars[] AssignedVars[i_3, s_2]" "[113] L50-->L22: Formula: (and (= 2 v_thread2Thread1of1ForFork2_thidvar1_4) (= 2 v_thread2Thread1of1ForFork2_thidvar0_4)) InVars {} OutVars{thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_thidvar1, thread2Thread1of1ForFork2_thidvar0]" [2025-04-26 16:22:45,937 INFO L754 eck$LassoCheckResult]: Loop: "[87] L22-->L23: Formula: (and (= (select v_X_0_6 v_i_3_18) v_t_4_5) (= (+ v_i_3_19 1) v_i_3_18) (< v_i_3_19 v_n_1_7)) InVars {X_0=v_X_0_6, i_3=v_i_3_19, n_1=v_n_1_7} OutVars{X_0=v_X_0_6, n_1=v_n_1_7, i_3=v_i_3_18, t_4=v_t_4_5} AuxVars[] AssignedVars[i_3, t_4]" "[89] L23-->L22: Formula: (= v_s_2_2 (+ v_s_2_3 v_t_4_2)) InVars {s_2=v_s_2_3, t_4=v_t_4_2} OutVars{s_2=v_s_2_2, t_4=v_t_4_2} AuxVars[] AssignedVars[s_2]" [2025-04-26 16:22:45,941 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:45,941 INFO L85 PathProgramCache]: Analyzing trace with hash 129445, now seen corresponding path program 1 times [2025-04-26 16:22:45,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:45,946 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917549235] [2025-04-26 16:22:45,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:45,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:45,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:45,995 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,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:45,996 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:45,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:45,999 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,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,012 INFO L85 PathProgramCache]: Analyzing trace with hash 3747, now seen corresponding path program 1 times [2025-04-26 16:22:46,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124190918] [2025-04-26 16:22:46,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:46,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:46,020 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,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:46,023 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,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,026 INFO L85 PathProgramCache]: Analyzing trace with hash 124399431, now seen corresponding path program 1 times [2025-04-26 16:22:46,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037094606] [2025-04-26 16:22:46,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:46,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:46,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:46,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,037 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:46,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:46,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,149 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:46,150 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:46,150 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:46,150 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:46,151 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:46,151 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,151 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:46,151 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:46,151 INFO L132 ssoRankerPreferences]: Filename of dumped script: parallel-sum-equiv.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:22:46,151 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:46,151 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:46,161 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,272 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:46,275 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:46,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,278 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:46,279 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:46,281 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,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,298 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,325 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:46,331 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:46,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,333 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:46,335 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:46,336 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,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,352 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:46,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:46,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,361 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:46,363 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:46,364 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,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:46,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,376 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,386 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:46,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,388 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:46,389 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:46,390 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,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:46,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:46,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:46,401 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,410 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:46,415 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,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,418 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,418 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,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,429 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,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:46,436 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:46,442 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:46,457 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:22:46,457 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:46,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:46,461 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,462 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,463 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:46,480 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:46,480 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:46,481 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:46,481 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n_1, i_3) = 1*n_1 - 1*i_3 Supporting invariants [] [2025-04-26 16:22:46,490 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:46,492 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:46,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:46,520 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,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:46,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:46,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:46,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:46,551 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,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:46,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:46,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:46,589 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,627 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,642 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 178 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,719 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 178 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 494 states and 1592 transitions. Complement of second has 5 states. [2025-04-26 16:22:46,721 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,724 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,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2025-04-26 16:22:46,733 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:22:46,733 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,733 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:22:46,733 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,734 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:22:46,734 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:46,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 1592 transitions. [2025-04-26 16:22:46,744 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 58 [2025-04-26 16:22:46,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 285 states and 938 transitions. [2025-04-26 16:22:46,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2025-04-26 16:22:46,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2025-04-26 16:22:46,751 INFO L74 IsDeterministic]: Start isDeterministic. Operand 285 states and 938 transitions. [2025-04-26 16:22:46,751 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:46,751 INFO L218 hiAutomatonCegarLoop]: Abstraction has 285 states and 938 transitions. [2025-04-26 16:22:46,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 938 transitions. [2025-04-26 16:22:46,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 224. [2025-04-26 16:22:46,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 224 states have (on average 3.40625) internal successors, (in total 763), 223 states have internal predecessors, (763), 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,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 763 transitions. [2025-04-26 16:22:46,775 INFO L240 hiAutomatonCegarLoop]: Abstraction has 224 states and 763 transitions. [2025-04-26 16:22:46,775 INFO L438 stractBuchiCegarLoop]: Abstraction has 224 states and 763 transitions. [2025-04-26 16:22:46,775 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:22:46,775 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states and 763 transitions. [2025-04-26 16:22:46,778 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 58 [2025-04-26 16:22:46,778 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:46,778 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:46,778 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:22:46,778 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:22:46,779 INFO L752 eck$LassoCheckResult]: Stem: "[101] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[104] L81-->$Ultimate##0: Formula: (and (= 4 v_thread4Thread1of1ForFork1_thidvar1_2) (= 4 v_thread4Thread1of1ForFork1_thidvar0_2) (= 4 v_thread4Thread1of1ForFork1_thidvar2_2) (= 4 v_thread4Thread1of1ForFork1_thidvar3_2)) InVars {} OutVars{thread4Thread1of1ForFork1_thidvar0=v_thread4Thread1of1ForFork1_thidvar0_2, thread4Thread1of1ForFork1_thidvar1=v_thread4Thread1of1ForFork1_thidvar1_2, thread4Thread1of1ForFork1_thidvar2=v_thread4Thread1of1ForFork1_thidvar2_2, thread4Thread1of1ForFork1_thidvar3=v_thread4Thread1of1ForFork1_thidvar3_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork1_thidvar0, thread4Thread1of1ForFork1_thidvar1, thread4Thread1of1ForFork1_thidvar2, thread4Thread1of1ForFork1_thidvar3]" "[94] $Ultimate##0-->L67: Formula: (and (= v_i_7_7 0) (= v_s_6_5 0)) InVars {} OutVars{i_7=v_i_7_7, s_6=v_s_6_5} AuxVars[] AssignedVars[i_7, s_6]" [2025-04-26 16:22:46,779 INFO L754 eck$LassoCheckResult]: Loop: "[96] L67-->L68: Formula: (and (= (select v_X_0_14 v_i_7_13) v_t_8_5) (= (+ v_i_7_14 1) v_i_7_13) (< v_i_7_14 v_n_1_11)) InVars {X_0=v_X_0_14, i_7=v_i_7_14, n_1=v_n_1_11} OutVars{X_0=v_X_0_14, i_7=v_i_7_13, t_8=v_t_8_5, n_1=v_n_1_11} AuxVars[] AssignedVars[i_7, t_8]" "[98] L68-->L67: Formula: (= v_s_6_3 (+ v_s_6_4 v_t_8_2)) InVars {s_6=v_s_6_4, t_8=v_t_8_2} OutVars{s_6=v_s_6_3, t_8=v_t_8_2} AuxVars[] AssignedVars[s_6]" [2025-04-26 16:22:46,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,779 INFO L85 PathProgramCache]: Analyzing trace with hash 130170, now seen corresponding path program 1 times [2025-04-26 16:22:46,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119320008] [2025-04-26 16:22:46,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:46,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:46,785 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,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,785 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:46,790 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,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,792 INFO L85 PathProgramCache]: Analyzing trace with hash 4035, now seen corresponding path program 1 times [2025-04-26 16:22:46,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,792 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318330004] [2025-04-26 16:22:46,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:46,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:46,800 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,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,800 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:46,805 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,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,806 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:46,807 INFO L85 PathProgramCache]: Analyzing trace with hash 125096444, now seen corresponding path program 1 times [2025-04-26 16:22:46,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:46,807 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269753503] [2025-04-26 16:22:46,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:46,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:46,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:46,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:46,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,812 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:46,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:46,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:46,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:46,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:46,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:46,896 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:46,896 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:46,896 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:46,896 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:46,896 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:46,896 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,896 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:46,896 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:46,896 INFO L132 ssoRankerPreferences]: Filename of dumped script: parallel-sum-equiv.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:22:46,896 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:46,896 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:46,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:46,998 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:46,998 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:46,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:46,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:47,000 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:47,002 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:47,003 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:47,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:47,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:47,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:47,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:47,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:22:47,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:22:47,020 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:47,028 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:22:47,028 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:22:47,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:47,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:47,030 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:47,031 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:47,032 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:47,048 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:47,049 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:22:47,049 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:47,049 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n_1, i_7) = 1*n_1 - 1*i_7 Supporting invariants [] [2025-04-26 16:22:47,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:47,055 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:47,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:47,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:47,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:47,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:47,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:47,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:47,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:47,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:47,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:47,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:47,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:47,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:47,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:47,099 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:47,099 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:47,100 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 224 states and 763 transitions. cyclomatic complexity: 591 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:47,156 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 224 states and 763 transitions. cyclomatic complexity: 591. 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 629 states and 2273 transitions. Complement of second has 4 states. [2025-04-26 16:22:47,156 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,156 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:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2025-04-26 16:22:47,157 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:22:47,157 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:47,157 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:22:47,157 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:47,157 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 58 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:22:47,157 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:47,157 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 629 states and 2273 transitions. [2025-04-26 16:22:47,163 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:47,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 629 states to 0 states and 0 transitions. [2025-04-26 16:22:47,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:22:47,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:22:47,164 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:22:47,164 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:22:47,164 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:47,164 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:47,164 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:22:47,164 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:22:47,164 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:22:47,164 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:22:47,164 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:22:47,169 INFO L201 PluginConnector]: Adding new model parallel-sum-equiv.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:22:47 BoogieIcfgContainer [2025-04-26 16:22:47,169 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:22:47,170 INFO L158 Benchmark]: Toolchain (without parser) took 1666.21ms. 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 68.7MB in the end (delta: 17.1MB). Peak memory consumption was 18.0MB. Max. memory is 8.0GB. [2025-04-26 16:22:47,170 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:47,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.29ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 83.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:47,172 INFO L158 Benchmark]: Boogie Preprocessor took 19.38ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 82.8MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:22:47,172 INFO L158 Benchmark]: RCFGBuilder took 177.54ms. Allocated memory is still 159.4MB. Free memory was 82.8MB in the beginning and 72.7MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:22:47,174 INFO L158 Benchmark]: BuchiAutomizer took 1431.45ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.5MB in the beginning and 68.7MB in the end (delta: 3.8MB). Peak memory consumption was 5.4MB. Max. memory is 8.0GB. [2025-04-26 16:22:47,174 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.29ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 83.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 19.38ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 82.8MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 177.54ms. Allocated memory is still 159.4MB. Free memory was 82.8MB in the beginning and 72.7MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1431.45ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.5MB in the beginning and 68.7MB in the end (delta: 3.8MB). Peak memory consumption was 5.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. 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, 61 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, 69 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 25 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital40 mio100 ax100 hnf100 lsp70 ukn92 mio100 lsp53 div100 bol100 ite100 ukn100 eq185 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms 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 -1 * i_3 + n_1 and consists of 4 locations. One deterministic module has affine ranking function n_1 + -1 * i_7 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,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...