/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 false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -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 01:34:43,004 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:34:43,068 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 01:34:43,077 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:34:43,077 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:34:43,078 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:34:43,112 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:34:43,113 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:34:43,113 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:34:43,115 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:34:43,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:34:43,116 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:34:43,116 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:34:43,117 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:34:43,117 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:34:43,117 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:34:43,117 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:34:43,118 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:34:43,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:34:43,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:34:43,119 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:34:43,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:34:43,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:34:43,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:34:43,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:34:43,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:34:43,125 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:34:43,125 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:34:43,125 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:34:43,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:34:43,126 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:34:43,126 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:34:43,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:34:43,127 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:34:43,127 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:34:43,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:34:43,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:34:43,128 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:34:43,128 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 -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 01:34:43,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:34:43,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:34:43,493 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:34:43,494 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 01:34:43,496 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 01:34:43,498 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 01:34:43,498 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum2.bpl' [2024-02-10 01:34:43,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:34:43,533 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 01:34:43,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:34:43,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:34:43,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:34:43,552 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 01:34:43" (1/1) ... [2024-02-10 01:34:43,565 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 01:34:43" (1/1) ... [2024-02-10 01:34:43,572 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-02-10 01:34:43,576 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:34:43,577 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:34:43,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:34:43,578 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:34:43,586 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 01:34:43" (1/1) ... [2024-02-10 01:34:43,586 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 01:34:43" (1/1) ... [2024-02-10 01:34:43,588 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 01:34:43" (1/1) ... [2024-02-10 01:34:43,588 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 01:34:43" (1/1) ... [2024-02-10 01:34:43,593 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 01:34:43" (1/1) ... [2024-02-10 01:34:43,596 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 01:34:43" (1/1) ... [2024-02-10 01:34:43,597 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 01:34:43" (1/1) ... [2024-02-10 01:34:43,598 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 01:34:43" (1/1) ... [2024-02-10 01:34:43,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:34:43,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:34:43,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:34:43,601 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:34:43,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:43" (1/1) ... [2024-02-10 01:34:43,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:43,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:43,647 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 01:34:43,712 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 01:34:43,788 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 01:34:43,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:34:43,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:34:43,789 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2024-02-10 01:34:43,789 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-02-10 01:34:43,789 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-02-10 01:34:43,791 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 01:34:43,848 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:34:43,852 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:34:43,955 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:34:43,962 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:34:43,962 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 01:34:43,964 INFO L201 PluginConnector]: Adding new model max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:34:43 BoogieIcfgContainer [2024-02-10 01:34:43,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:34:43,969 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:34:43,969 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:34:43,975 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:34:43,976 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:34:43,977 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 01:34:43" (1/2) ... [2024-02-10 01:34:43,979 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d9d2af7 and model type max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:34:43, skipping insertion in model container [2024-02-10 01:34:43,980 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:34:43,980 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 01:34:43" (2/2) ... [2024-02-10 01:34:43,983 INFO L332 chiAutomizerObserver]: Analyzing ICFG max-tailsum2.bpl [2024-02-10 01:34:44,071 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 01:34:44,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 74 flow [2024-02-10 01:34:44,119 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2024-02-10 01:34:44,120 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 01:34:44,127 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 01:34:44,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 30 transitions, 74 flow [2024-02-10 01:34:44,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 26 transitions, 64 flow [2024-02-10 01:34:44,142 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:34:44,143 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:34:44,143 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:34:44,143 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:34:44,143 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:34:44,143 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:34:44,143 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:34:44,144 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:34:44,144 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:34:44,145 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 31 places, 26 transitions, 64 flow [2024-02-10 01:34:44,171 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 105 states, 103 states have (on average 1.9805825242718447) internal successors, (204), 104 states have internal predecessors, (204), 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 01:34:44,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 105 states, 103 states have (on average 1.9805825242718447) internal successors, (204), 104 states have internal predecessors, (204), 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 01:34:44,197 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 64 [2024-02-10 01:34:44,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:34:44,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:34:44,202 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:34:44,202 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:34:44,202 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 31 places, 26 transitions, 64 flow [2024-02-10 01:34:44,210 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 105 states, 103 states have (on average 1.9805825242718447) internal successors, (204), 104 states have internal predecessors, (204), 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 01:34:44,211 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 105 states, 103 states have (on average 1.9805825242718447) internal successors, (204), 104 states have internal predecessors, (204), 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 01:34:44,217 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 64 [2024-02-10 01:34:44,217 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:34:44,217 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:34:44,223 INFO L748 eck$LassoCheckResult]: Stem: Black: 248#[$Ultimate##0]don't care [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[] 251#[L54]don't care [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] 253#[L54-1, $Ultimate##0]don't care [38] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork0_x_1 0) InVars {} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_x] 255#[L54-1, L28]don't care [39] L28-->L30: Formula: (= v_sumThread1of1ForFork0_z_1 0) InVars {} OutVars{sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork0_z] 259#[L54-1, L30]don't care [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] 265#[L54-1, L31-1]don't care [2024-02-10 01:34:44,224 INFO L750 eck$LassoCheckResult]: Loop: 265#[L54-1, L31-1]don't care [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[] 275#[L32, L54-1]don't care [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] 289#[L33, L54-1]don't care [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] 307#[L54-1, L34]don't care [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] 265#[L54-1, L31-1]don't care [2024-02-10 01:34:44,235 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:44,235 INFO L85 PathProgramCache]: Analyzing trace with hash 61794510, now seen corresponding path program 1 times [2024-02-10 01:34:44,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:44,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051677468] [2024-02-10 01:34:44,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:44,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:44,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:44,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:44,343 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:44,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2218468, now seen corresponding path program 1 times [2024-02-10 01:34:44,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:44,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382976671] [2024-02-10 01:34:44,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:44,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:44,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:44,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:44,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:44,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1298502705, now seen corresponding path program 1 times [2024-02-10 01:34:44,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:44,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633186448] [2024-02-10 01:34:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:44,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:44,414 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:44,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:44,709 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:34:44,710 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:34:44,710 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:34:44,710 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:34:44,710 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:34:44,710 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:44,711 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:34:44,711 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:34:44,711 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum2.bpl_BEv2_Iteration1_Lasso [2024-02-10 01:34:44,711 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:34:44,711 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:34:44,729 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 01:34:44,744 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 01:34:44,820 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 01:34:44,975 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:34:44,979 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:34:44,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:44,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:44,988 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 01:34:44,998 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 01:34:45,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:45,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:45,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:45,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:45,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:34:45,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:34:45,024 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 01:34:45,033 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:34:45,044 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 01:34:45,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:45,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:45,048 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 01:34:45,054 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 01:34:45,057 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 01:34:45,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:45,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:45,067 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-10 01:34:45,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:45,085 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-02-10 01:34:45,086 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-10 01:34:45,116 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:34:45,124 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 01:34:45,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:45,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:45,126 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 01:34:45,129 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 01:34:45,130 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 01:34:45,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:45,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:45,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:45,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:45,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:34:45,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:34:45,166 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:34:45,209 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 01:34:45,209 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-02-10 01:34:45,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:45,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:45,219 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 01:34:45,222 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:34:45,230 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 01:34:45,232 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:34:45,233 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:34:45,233 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 01:34:45,242 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 01:34:45,245 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:34:45,271 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:34:45,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:34:45,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:34:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:34:45,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:34:45,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:34:45,400 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 01:34:45,463 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 01:34:45,492 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 01:34:45,494 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 01:34:45,654 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 01:34:45,655 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:34:45,656 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:34:45,671 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:34:45,671 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:34:45,674 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 01:34:45,682 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 01:34:45,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-02-10 01:34:45,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 144 transitions. Stem has 5 letters. Loop has 4 letters. [2024-02-10 01:34:45,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:45,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 144 transitions. Stem has 9 letters. Loop has 4 letters. [2024-02-10 01:34:45,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:45,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 144 transitions. Stem has 5 letters. Loop has 8 letters. [2024-02-10 01:34:45,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:45,692 INFO L428 stractBuchiCegarLoop]: Abstraction has has 49 places, 644 transitions, 2858 flow [2024-02-10 01:34:45,693 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:34:45,695 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:34:45,696 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 49 places, 644 transitions, 2858 flow [2024-02-10 01:34:45,759 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 327 states, 317 states have (on average 2.6498422712933754) internal successors, (840), 326 states have internal predecessors, (840), 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 01:34:45,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 327 states, 317 states have (on average 2.6498422712933754) internal successors, (840), 326 states have internal predecessors, (840), 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 01:34:45,774 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 80 [2024-02-10 01:34:45,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:34:45,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:34:45,778 INFO L748 eck$LassoCheckResult]: Stem: Black: 521#[$Ultimate##0]don't care [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[] Black: 524#[L54]don't care [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] Black: 529#[L54-1, $Ultimate##0]don't care [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] Black: 537#[L55, $Ultimate##0, $Ultimate##0]don't care [47] $Ultimate##0-->L28: Formula: (= v_sumThread1of1ForFork1_x_1 0) InVars {} OutVars{sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_x] 556#[L55, $Ultimate##0, L28]don't care [48] L28-->L30: Formula: (= v_sumThread1of1ForFork1_z_1 0) InVars {} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_1} AuxVars[] AssignedVars[sumThread1of1ForFork1_z] Black: 587#[L55, L30, $Ultimate##0]don't care [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] 607#[L55, L31-1, $Ultimate##0]don't care [2024-02-10 01:34:45,778 INFO L750 eck$LassoCheckResult]: Loop: 607#[L55, L31-1, $Ultimate##0]don't care [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[] Black: 664#[L55, $Ultimate##0, L32]don't care [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] 740#[L55, L33, $Ultimate##0]don't care [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] Black: 833#[L55, $Ultimate##0, L34]don't care [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] 607#[L55, L31-1, $Ultimate##0]don't care [2024-02-10 01:34:45,778 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:45,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1916322988, now seen corresponding path program 1 times [2024-02-10 01:34:45,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:45,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302259248] [2024-02-10 01:34:45,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:45,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:45,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:45,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:45,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:45,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2495524, now seen corresponding path program 1 times [2024-02-10 01:34:45,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:45,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307042411] [2024-02-10 01:34:45,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:45,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:45,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:45,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:45,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:45,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1774619471, now seen corresponding path program 1 times [2024-02-10 01:34:45,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:34:45,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348399351] [2024-02-10 01:34:45,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:34:45,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:34:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:45,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:34:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:34:45,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:34:46,045 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:34:46,046 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:34:46,046 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:34:46,046 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:34:46,046 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:34:46,046 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:46,046 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:34:46,046 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:34:46,046 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum2.bpl_BEv2_Iteration2_Lasso [2024-02-10 01:34:46,047 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:34:46,047 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:34:46,050 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 01:34:46,053 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 01:34:46,061 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 01:34:46,065 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 01:34:46,067 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 01:34:46,070 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 01:34:46,073 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 01:34:46,076 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 01:34:46,287 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:34:46,288 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:34:46,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:46,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:46,293 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 01:34:46,302 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 01:34:46,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:46,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:46,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:46,312 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:46,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:34:46,316 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:34:46,321 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 01:34:46,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:34:46,342 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 01:34:46,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:46,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:46,345 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 01:34:46,356 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 01:34:46,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:46,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:46,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:46,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:46,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:34:46,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:34:46,373 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 01:34:46,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:34:46,388 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 01:34:46,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:46,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:46,390 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 01:34:46,397 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 01:34:46,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:46,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:34:46,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:46,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:46,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:46,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:34:46,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:34:46,410 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 01:34:46,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:34:46,427 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 01:34:46,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:46,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:46,431 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 01:34:46,440 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 01:34:46,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:46,450 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:34:46,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:46,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:46,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:46,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:34:46,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:34:46,456 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 01:34:46,464 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:34:46,471 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 01:34:46,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:46,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:46,473 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 01:34:46,480 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 01:34:46,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:46,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:34:46,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:46,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:46,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:46,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:34:46,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:34:46,493 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 01:34:46,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:34:46,511 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 01:34:46,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:46,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:46,513 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 01:34:46,527 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 01:34:46,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:46,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:46,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:46,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:46,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:34:46,543 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:34:46,547 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 01:34:46,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:34:46,559 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 01:34:46,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:46,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:46,561 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 01:34:46,572 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 01:34:46,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:46,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:46,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:46,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:46,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:34:46,583 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:34:46,586 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 01:34:46,601 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:34:46,609 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 01:34:46,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:46,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:46,612 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 01:34:46,619 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 01:34:46,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:46,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:46,629 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-02-10 01:34:46,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:46,645 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-02-10 01:34:46,646 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-02-10 01:34:46,650 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 01:34:46,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:34:46,680 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 01:34:46,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:46,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:46,682 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 01:34:46,688 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 01:34:46,689 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 01:34:46,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:34:46,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:34:46,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:34:46,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:34:46,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:34:46,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:34:46,724 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:34:46,736 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-02-10 01:34:46,736 INFO L444 ModelExtractionUtils]: 6 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-02-10 01:34:46,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:34:46,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:34:46,741 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 01:34:46,760 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 01:34:46,761 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:34:46,788 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 01:34:46,788 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:34:46,788 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 01:34:46,800 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 01:34:46,801 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:34:46,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:34:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:34:46,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:34:46,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:34:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:34:46,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:34:46,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:34:46,886 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 01:34:46,888 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 01:34:46,888 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 01:34:47,007 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 01:34:47,007 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:34:47,007 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:34:47,094 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:34:47,094 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:34:47,094 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 01:34:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 01:34:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 144 transitions. [2024-02-10 01:34:47,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 144 transitions. Stem has 6 letters. Loop has 4 letters. [2024-02-10 01:34:47,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:47,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 144 transitions. Stem has 10 letters. Loop has 4 letters. [2024-02-10 01:34:47,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:47,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 144 transitions. Stem has 6 letters. Loop has 8 letters. [2024-02-10 01:34:47,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:34:47,097 INFO L428 stractBuchiCegarLoop]: Abstraction has has 67 places, 15912 transitions, 102024 flow [2024-02-10 01:34:47,097 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:34:47,097 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:34:47,097 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 67 places, 15912 transitions, 102024 flow [2024-02-10 01:34:47,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-02-10 01:34:48,448 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 884 states, 830 states have (on average 3.540963855421687) internal successors, (2939), 883 states have internal predecessors, (2939), 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 01:34:48,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 884 states, 830 states have (on average 3.540963855421687) internal successors, (2939), 883 states have internal predecessors, (2939), 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 01:34:48,468 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-10 01:34:48,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-10 01:34:48,475 INFO L201 PluginConnector]: Adding new model max-tailsum2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:34:48 BoogieIcfgContainer [2024-02-10 01:34:48,475 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:34:48,475 INFO L158 Benchmark]: Toolchain (without parser) took 4942.13ms. Allocated memory was 155.2MB in the beginning and 262.1MB in the end (delta: 107.0MB). Free memory was 92.9MB in the beginning and 141.0MB in the end (delta: -48.2MB). Peak memory consumption was 159.7MB. Max. memory is 8.0GB. [2024-02-10 01:34:48,476 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:34:48,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.03ms. Allocated memory is still 155.2MB. Free memory was 92.9MB in the beginning and 91.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:34:48,477 INFO L158 Benchmark]: Boogie Preprocessor took 21.78ms. Allocated memory is still 155.2MB. Free memory was 91.1MB in the beginning and 90.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:34:48,477 INFO L158 Benchmark]: RCFGBuilder took 363.60ms. Allocated memory is still 155.2MB. Free memory was 90.1MB in the beginning and 120.6MB in the end (delta: -30.6MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2024-02-10 01:34:48,478 INFO L158 Benchmark]: BuchiAutomizer took 4506.27ms. Allocated memory was 155.2MB in the beginning and 262.1MB in the end (delta: 107.0MB). Free memory was 120.6MB in the beginning and 141.0MB in the end (delta: -20.4MB). Peak memory consumption was 187.5MB. Max. memory is 8.0GB. [2024-02-10 01:34:48,479 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.13ms. Allocated memory is still 155.2MB. Free memory is still 93.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.03ms. Allocated memory is still 155.2MB. Free memory was 92.9MB in the beginning and 91.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.78ms. Allocated memory is still 155.2MB. Free memory was 91.1MB in the beginning and 90.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 363.60ms. Allocated memory is still 155.2MB. Free memory was 90.1MB in the beginning and 120.6MB in the end (delta: -30.6MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 4506.27ms. Allocated memory was 155.2MB in the beginning and 262.1MB in the end (delta: 107.0MB). Free memory was 120.6MB in the beginning and 141.0MB in the end (delta: -20.4MB). Peak memory consumption was 187.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 4.3s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 2.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. 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, 162 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 160 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 120 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 136 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital77 mio100 ax100 hnf100 lsp121 ukn63 mio100 lsp56 div100 bol100 ite100 ukn100 eq172 hnf94 smp100 dnf203 smp56 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 71ms VariablesStem: 2 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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 01:34:48,507 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...