/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:59:34,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:59:34,996 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 00:59:35,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:59:35,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:59:35,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:59:35,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:59:35,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:59:35,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:59:35,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:59:35,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:59:35,057 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:59:35,058 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:59:35,059 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:59:35,059 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:59:35,059 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:59:35,059 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:59:35,059 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:59:35,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:59:35,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:59:35,060 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:59:35,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:59:35,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:59:35,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:59:35,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:59:35,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:59:35,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:59:35,062 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:59:35,062 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:59:35,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:59:35,063 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:59:35,063 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:59:35,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:59:35,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:59:35,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:59:35,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:59:35,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:59:35,065 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:59:35,065 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 00:59:35,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:59:35,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:59:35,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:59:35,660 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:59:35,668 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:59:35,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum2.bpl [2024-02-10 00:59:35,669 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum2.bpl' [2024-02-10 00:59:35,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:59:35,713 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:59:35,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:59:35,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:59:35,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:59:35,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:35" (1/1) ... [2024-02-10 00:59:35,770 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:35" (1/1) ... [2024-02-10 00:59:35,792 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 00:59:35,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:59:35,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:59:35,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:59:35,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:59:35,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:35" (1/1) ... [2024-02-10 00:59:35,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:35" (1/1) ... [2024-02-10 00:59:35,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:35" (1/1) ... [2024-02-10 00:59:35,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:35" (1/1) ... [2024-02-10 00:59:35,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:35" (1/1) ... [2024-02-10 00:59:35,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:35" (1/1) ... [2024-02-10 00:59:35,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:35" (1/1) ... [2024-02-10 00:59:35,879 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:35" (1/1) ... [2024-02-10 00:59:35,880 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:59:35,882 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:59:35,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:59:35,882 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:59:35,897 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:35" (1/1) ... [2024-02-10 00:59:35,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:35,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:35,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:35,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 00:59:36,050 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:59:36,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:59:36,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:59:36,051 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2024-02-10 00:59:36,051 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-02-10 00:59:36,051 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-02-10 00:59:36,052 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 00:59:36,122 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:59:36,132 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:59:36,310 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:59:36,315 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:59:36,315 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:59:36,333 INFO L201 PluginConnector]: Adding new model max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:59:36 BoogieIcfgContainer [2024-02-10 00:59:36,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:59:36,334 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:59:36,334 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:59:36,343 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:59:36,344 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:59:36,344 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:59:35" (1/2) ... [2024-02-10 00:59:36,355 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13c5df48 and model type max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:59:36, skipping insertion in model container [2024-02-10 00:59:36,355 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:59:36,355 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:59:36" (2/2) ... [2024-02-10 00:59:36,357 INFO L332 chiAutomizerObserver]: Analyzing ICFG max-tailsum2.bpl [2024-02-10 00:59:36,490 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 00:59:36,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 74 flow [2024-02-10 00:59:36,571 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2024-02-10 00:59:36,571 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:59:36,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 2/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-02-10 00:59:36,583 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 30 transitions, 74 flow [2024-02-10 00:59:36,587 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 26 transitions, 64 flow [2024-02-10 00:59:36,595 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:59:36,595 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:59:36,604 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:59:36,606 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:59:36,606 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:59:36,606 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:59:36,606 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:59:36,619 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:59:36,620 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 places, 26 transitions, 64 flow [2024-02-10 00:59:36,626 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:59:36,626 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-02-10 00:59:36,626 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 00:59:36,626 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:59:36,629 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:59:36,629 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 31 places, 26 transitions, 64 flow [2024-02-10 00:59:36,642 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:59:36,642 INFO L124 PetriNetUnfolderBase]: 0/18 cut-off events. [2024-02-10 00:59:36,642 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-02-10 00:59:36,642 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:59:36,652 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [34] $Ultimate##0-->L54: Formula: (and (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k1_1 v_N_1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 39#[L54]true [58] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo] 41#[L54-1, $Ultimate##0]true [38] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork0_x_1 0) InVars {} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_x] 43#[L28, L54-1]true [39] L28-->L30: Formula: (= v_sumThread1of1ForFork0_z_1 0) InVars {} OutVars{sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_z] 45#[L54-1, L30]true [40] L30-->L31-1: Formula: (= v_sumThread1of1ForFork0_i_1 v_sumThread1of1ForFork0_lo_1) InVars {sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1} OutVars{sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_1, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_i] 47#[L54-1, L31-1]true [2024-02-10 00:59:36,653 INFO L750 eck$LassoCheckResult]: Loop: 47#[L54-1, L31-1]true [42] L31-1-->L32: Formula: (< v_sumThread1of1ForFork0_i_5 v_sumThread1of1ForFork0_hi_3) InVars {sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_5} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_5} AuxVars[] AssignedVars[] 50#[L32, L54-1]true [44] L32-->L33: Formula: (= v_sumThread1of1ForFork0_x_4 (+ (select v_A_2 v_sumThread1of1ForFork0_i_7) v_sumThread1of1ForFork0_x_3)) InVars {A=v_A_2, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_7} OutVars{A=v_A_2, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_4, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_7} AuxVars[] AssignedVars[sumThread1of1ForFork0_x] 52#[L33, L54-1]true [45] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork0_i_9 1) v_sumThread1of1ForFork0_i_10) InVars {sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_9} OutVars{sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork0_i] 54#[L54-1, L34]true [46] L34-->L31-1: Formula: (= v_sumThread1of1ForFork0_z_4 (let ((.cse0 (+ (select v_A_1 v_sumThread1of1ForFork0_i_13) v_sumThread1of1ForFork0_z_3))) (ite (< 0 .cse0) .cse0 0))) InVars {A=v_A_1, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_13} OutVars{A=v_A_1, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_4, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_13} AuxVars[] AssignedVars[sumThread1of1ForFork0_z] 47#[L54-1, L31-1]true [2024-02-10 00:59:36,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:36,664 INFO L85 PathProgramCache]: Analyzing trace with hash 61794510, now seen corresponding path program 1 times [2024-02-10 00:59:36,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:36,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617717599] [2024-02-10 00:59:36,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:36,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:36,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:36,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:36,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:36,838 INFO L85 PathProgramCache]: Analyzing trace with hash 2218468, now seen corresponding path program 1 times [2024-02-10 00:59:36,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:36,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291369941] [2024-02-10 00:59:36,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:36,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:36,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:36,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:36,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:36,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1298502705, now seen corresponding path program 1 times [2024-02-10 00:59:36,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:36,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775481925] [2024-02-10 00:59:36,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:36,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:36,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:36,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:37,317 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:59:37,317 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:59:37,317 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:59:37,318 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:59:37,318 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:59:37,318 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:37,318 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:59:37,318 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:59:37,318 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum2.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:59:37,318 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:59:37,318 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:59:37,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:37,383 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:37,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:37,681 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:59:37,684 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:59:37,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:37,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:37,710 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:37,740 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 [2024-02-10 00:59:37,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:37,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:37,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:37,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:37,754 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:59:37,754 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:59:37,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-10 00:59:37,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:37,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:37,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:37,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:37,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:37,820 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 [2024-02-10 00:59:37,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:37,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:37,829 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-10 00:59:37,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:37,873 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-02-10 00:59:37,873 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-10 00:59:37,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-10 00:59:37,925 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:37,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:37,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:37,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:37,965 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:37,995 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 [2024-02-10 00:59:38,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:38,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:38,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:38,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:38,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:59:38,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:59:38,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-10 00:59:38,035 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:59:38,060 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 00:59:38,060 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-02-10 00:59:38,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:38,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:38,072 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:38,108 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:59:38,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-10 00:59:38,140 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:59:38,140 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:59:38,141 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork0_hi, sumThread1of1ForFork0_i) = 1*sumThread1of1ForFork0_hi - 1*sumThread1of1ForFork0_i Supporting invariants [] [2024-02-10 00:59:38,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:38,151 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 00:59:38,175 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:38,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:59:38,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:59:38,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:59:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:59:38,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:59:38,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:59:38,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:59:38,383 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 00:59:38,401 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:59:38,589 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 374 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:59:38,591 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:59:38,604 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:59:38,606 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:59:38,658 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:59:38,658 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:59:38,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 00:59:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:59:38,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-02-10 00:59:38,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 144 transitions. Stem has 5 letters. Loop has 4 letters. [2024-02-10 00:59:38,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:38,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 144 transitions. Stem has 9 letters. Loop has 4 letters. [2024-02-10 00:59:38,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:38,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 144 transitions. Stem has 5 letters. Loop has 8 letters. [2024-02-10 00:59:38,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:38,676 INFO L428 stractBuchiCegarLoop]: Abstraction has has 40 places, 322 transitions, 1429 flow [2024-02-10 00:59:38,679 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:59:38,680 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 40 places, 322 transitions, 1429 flow [2024-02-10 00:59:38,778 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:59:38,779 INFO L124 PetriNetUnfolderBase]: 138/219 cut-off events. [2024-02-10 00:59:38,780 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-02-10 00:59:38,781 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:59:38,783 INFO L748 eck$LassoCheckResult]: Stem: 37#[$Ultimate##0]true [34] $Ultimate##0-->L54: Formula: (and (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k1_1 v_N_1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 39#[L54]true [58] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo] 41#[L54-1, $Ultimate##0]true [61] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2) (= v_N_3 v_sumThread1of1ForFork1_hi_6)) InVars {N=v_N_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{N=v_N_3, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo] 124#[$Ultimate##0, $Ultimate##0, L55]true [47] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork1_x_1 0) InVars {} OutVars{sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_x] 126#[L28, $Ultimate##0, L55]true [48] L28-->L30: Formula: (= v_sumThread1of1ForFork1_z_1 0) InVars {} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_z] 128#[L30, $Ultimate##0, L55]true [49] L30-->L31-1: Formula: (= v_sumThread1of1ForFork1_i_1 v_sumThread1of1ForFork1_lo_1) InVars {sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_1} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_1, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_i] 130#[L31-1, $Ultimate##0, L55]true [51] L31-1-->L32: Formula: (< v_sumThread1of1ForFork1_i_5 v_sumThread1of1ForFork1_hi_3) InVars {sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_5, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_3} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_5, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_3} AuxVars[] AssignedVars[] 132#[$Ultimate##0, L32, L55]true [53] L32-->L33: Formula: (= (+ v_sumThread1of1ForFork1_x_3 (select v_A_2 v_sumThread1of1ForFork1_i_7)) v_sumThread1of1ForFork1_x_4) InVars {A=v_A_2, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_7, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_3} OutVars{A=v_A_2, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_7, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_x] 134#[L33, $Ultimate##0, L55]true [54] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork1_i_9 1) v_sumThread1of1ForFork1_i_10) InVars {sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_9} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork1_i] 136#[L34, $Ultimate##0, L55]true [55] L34-->L31-1: Formula: (= v_sumThread1of1ForFork1_z_4 (let ((.cse0 (+ v_sumThread1of1ForFork1_z_3 (select v_A_1 v_sumThread1of1ForFork1_i_13)))) (ite (< 0 .cse0) .cse0 0))) InVars {A=v_A_1, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_13, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_3} OutVars{A=v_A_1, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_13, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_z] 130#[L31-1, $Ultimate##0, L55]true [2024-02-10 00:59:38,783 INFO L750 eck$LassoCheckResult]: Loop: 130#[L31-1, $Ultimate##0, L55]true [51] L31-1-->L32: Formula: (< v_sumThread1of1ForFork1_i_5 v_sumThread1of1ForFork1_hi_3) InVars {sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_5, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_3} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_5, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_3} AuxVars[] AssignedVars[] 132#[$Ultimate##0, L32, L55]true [53] L32-->L33: Formula: (= (+ v_sumThread1of1ForFork1_x_3 (select v_A_2 v_sumThread1of1ForFork1_i_7)) v_sumThread1of1ForFork1_x_4) InVars {A=v_A_2, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_7, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_3} OutVars{A=v_A_2, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_7, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_x] 134#[L33, $Ultimate##0, L55]true [54] L33-->L34: Formula: (= (+ v_sumThread1of1ForFork1_i_9 1) v_sumThread1of1ForFork1_i_10) InVars {sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_9} OutVars{sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_10} AuxVars[] AssignedVars[sumThread1of1ForFork1_i] 136#[L34, $Ultimate##0, L55]true [55] L34-->L31-1: Formula: (= v_sumThread1of1ForFork1_z_4 (let ((.cse0 (+ v_sumThread1of1ForFork1_z_3 (select v_A_1 v_sumThread1of1ForFork1_i_13)))) (ite (< 0 .cse0) .cse0 0))) InVars {A=v_A_1, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_13, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_3} OutVars{A=v_A_1, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_13, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_z] 130#[L31-1, $Ultimate##0, L55]true [2024-02-10 00:59:38,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:38,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1774619471, now seen corresponding path program 1 times [2024-02-10 00:59:38,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:38,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830199630] [2024-02-10 00:59:38,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:38,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:38,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:38,847 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:38,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:38,848 INFO L85 PathProgramCache]: Analyzing trace with hash 2495524, now seen corresponding path program 1 times [2024-02-10 00:59:38,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:38,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804103157] [2024-02-10 00:59:38,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:38,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:38,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:38,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:38,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:38,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1040562062, now seen corresponding path program 2 times [2024-02-10 00:59:38,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:59:38,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788889543] [2024-02-10 00:59:38,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:59:38,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:59:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:38,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:59:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:59:38,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:59:39,266 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:59:39,266 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:59:39,266 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:59:39,266 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:59:39,267 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:59:39,267 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:39,267 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:59:39,267 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:59:39,267 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum2.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:59:39,267 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:59:39,267 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:59:39,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:39,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:39,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:39,278 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:39,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:39,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:39,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:39,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:59:39,714 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:59:39,714 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:59:39,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:39,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:39,717 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:39,751 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 [2024-02-10 00:59:39,759 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:39,760 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:39,760 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:39,760 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:39,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:59:39,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:59:39,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-10 00:59:39,786 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:39,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:39,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:39,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:39,810 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:39,833 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 [2024-02-10 00:59:39,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:39,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:39,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:39,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:39,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:59:39,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:59:39,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-10 00:59:39,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:39,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:39,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:39,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:39,909 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:39,944 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 [2024-02-10 00:59:39,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-10 00:59:39,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:39,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:59:39,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:39,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:39,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:39,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:59:39,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:59:39,976 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:39,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:39,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:39,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:40,001 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:40,044 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 [2024-02-10 00:59:40,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:40,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:59:40,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:40,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:40,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:40,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:59:40,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:59:40,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-10 00:59:40,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:40,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:40,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:40,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:40,109 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:40,143 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 [2024-02-10 00:59:40,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:40,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:59:40,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:40,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:40,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:40,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:59:40,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:59:40,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-10 00:59:40,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:40,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:40,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:40,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:40,203 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:40,243 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 [2024-02-10 00:59:40,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-10 00:59:40,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:40,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:40,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:40,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:40,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:59:40,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:59:40,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:40,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:40,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:40,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:40,302 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:40,339 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 [2024-02-10 00:59:40,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-10 00:59:40,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:40,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:40,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:40,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:40,351 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:59:40,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:59:40,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:40,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:40,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:40,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:40,407 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:40,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:59:40,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:40,444 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-02-10 00:59:40,445 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-10 00:59:40,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:40,461 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2024-02-10 00:59:40,461 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-10 00:59:40,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 00:59:40,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:59:40,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:40,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:40,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:40,541 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:40,550 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 [2024-02-10 00:59:40,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:59:40,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:59:40,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:59:40,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:59:40,579 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:59:40,579 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:59:40,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 00:59:40,594 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:59:40,606 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 00:59:40,607 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-10 00:59:40,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:59:40,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:59:40,620 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:59:40,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-10 00:59:40,655 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:59:40,679 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:59:40,679 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:59:40,679 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_i, sumThread1of1ForFork1_hi) = -1*sumThread1of1ForFork1_i + 1*sumThread1of1ForFork1_hi Supporting invariants [] [2024-02-10 00:59:40,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:40,689 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 00:59:40,727 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:59:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:59:40,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:59:40,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:59:40,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:59:40,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:59:40,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:59:40,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-10 00:59:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:59:40,825 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-10 00:59:40,825 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:59:40,932 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 374 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:59:40,932 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:59:40,933 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:59:40,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 374 transitions. [2024-02-10 00:59:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 374 transitions. [2024-02-10 00:59:40,972 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:59:40,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 374 transitions. [2024-02-10 00:59:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 374 transitions. [2024-02-10 00:59:41,282 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:59:41,282 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:59:41,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 00:59:41,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:59:41,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-02-10 00:59:41,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 144 transitions. Stem has 10 letters. Loop has 4 letters. [2024-02-10 00:59:41,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:41,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 144 transitions. Stem has 14 letters. Loop has 4 letters. [2024-02-10 00:59:41,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:41,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 144 transitions. Stem has 10 letters. Loop has 8 letters. [2024-02-10 00:59:41,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:59:41,312 INFO L428 stractBuchiCegarLoop]: Abstraction has has 53 places, 5175 transitions, 33174 flow [2024-02-10 00:59:41,312 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:59:41,313 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 53 places, 5175 transitions, 33174 flow [2024-02-10 00:59:43,344 INFO L124 PetriNetUnfolderBase]: 2666/3592 cut-off events. [2024-02-10 00:59:43,344 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2024-02-10 00:59:43,345 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2024-02-10 00:59:43,371 INFO L201 PluginConnector]: Adding new model max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:59:43 BoogieIcfgContainer [2024-02-10 00:59:43,371 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:59:43,372 INFO L158 Benchmark]: Toolchain (without parser) took 7658.91ms. Allocated memory was 177.2MB in the beginning and 280.0MB in the end (delta: 102.8MB). Free memory was 145.9MB in the beginning and 185.4MB in the end (delta: -39.6MB). Peak memory consumption was 166.0MB. Max. memory is 8.0GB. [2024-02-10 00:59:43,373 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:59:43,373 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.90ms. Allocated memory is still 177.2MB. Free memory was 145.7MB in the beginning and 144.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:59:43,374 INFO L158 Benchmark]: Boogie Preprocessor took 84.65ms. Allocated memory is still 177.2MB. Free memory was 144.2MB in the beginning and 151.8MB in the end (delta: -7.6MB). Peak memory consumption was 3.6MB. Max. memory is 8.0GB. [2024-02-10 00:59:43,375 INFO L158 Benchmark]: RCFGBuilder took 451.24ms. Allocated memory is still 177.2MB. Free memory was 151.8MB in the beginning and 142.5MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-10 00:59:43,376 INFO L158 Benchmark]: BuchiAutomizer took 7037.30ms. Allocated memory was 177.2MB in the beginning and 280.0MB in the end (delta: 102.8MB). Free memory was 142.3MB in the beginning and 185.4MB in the end (delta: -43.1MB). Peak memory consumption was 163.5MB. Max. memory is 8.0GB. [2024-02-10 00:59:43,389 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.12ms. Allocated memory is still 177.2MB. Free memory is still 147.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 72.90ms. Allocated memory is still 177.2MB. Free memory was 145.7MB in the beginning and 144.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 84.65ms. Allocated memory is still 177.2MB. Free memory was 144.2MB in the beginning and 151.8MB in the end (delta: -7.6MB). Peak memory consumption was 3.6MB. Max. memory is 8.0GB. * RCFGBuilder took 451.24ms. Allocated memory is still 177.2MB. Free memory was 151.8MB in the beginning and 142.5MB in the end (delta: 9.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 7037.30ms. Allocated memory was 177.2MB in the beginning and 280.0MB in the end (delta: 102.8MB). Free memory was 142.3MB in the beginning and 185.4MB in the end (delta: -43.1MB). Peak memory consumption was 163.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + hi and consists of 5 locations. One deterministic module has affine ranking function -1 * i + hi and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 3.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. 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, 163 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 136 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital89 mio100 ax100 hnf100 lsp128 ukn59 mio100 lsp59 div100 bol100 ite100 ukn100 eq170 hnf95 smp100 dnf224 smp53 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 101ms VariablesStem: 4 VariablesLoop: 7 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-10 00:59:43,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...