/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:18:50,203 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:18:50,252 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-10-12 17:18:50,270 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:18:50,270 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:18:50,270 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:18:50,271 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:18:50,272 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:18:50,272 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:18:50,272 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:18:50,273 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:18:50,273 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:18:50,273 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:18:50,274 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:18:50,274 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:18:50,274 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:18:50,274 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:18:50,275 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:18:50,275 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:18:50,275 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:18:50,276 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:18:50,276 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:18:50,276 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:18:50,277 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:18:50,277 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:18:50,277 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:18:50,278 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:18:50,278 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:18:50,278 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:18:50,279 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:18:50,279 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:18:50,279 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:18:50,279 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:18:50,280 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:18:50,280 INFO L137 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 [2023-10-12 17:18:50,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:18:50,483 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:18:50,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:18:50,487 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:18:50,489 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:18:50,490 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum3.bpl [2023-10-12 17:18:50,490 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum3.bpl' [2023-10-12 17:18:50,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:18:50,514 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:18:50,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:50,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:18:50,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:18:50,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:50" (1/1) ... [2023-10-12 17:18:50,535 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:50" (1/1) ... [2023-10-12 17:18:50,540 INFO L138 Inliner]: procedures = 3, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:18:50,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:50,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:18:50,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:18:50,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:18:50,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:50" (1/1) ... [2023-10-12 17:18:50,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:50" (1/1) ... [2023-10-12 17:18:50,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:50" (1/1) ... [2023-10-12 17:18:50,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:50" (1/1) ... [2023-10-12 17:18:50,556 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:50" (1/1) ... [2023-10-12 17:18:50,558 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:50" (1/1) ... [2023-10-12 17:18:50,559 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:50" (1/1) ... [2023-10-12 17:18:50,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:50" (1/1) ... [2023-10-12 17:18:50,560 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:18:50,561 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:18:50,561 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:18:50,561 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:18:50,563 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:50" (1/1) ... [2023-10-12 17:18:50,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:50,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:50,600 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) [2023-10-12 17:18:50,614 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 [2023-10-12 17:18:50,639 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:18:50,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:18:50,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:18:50,641 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2023-10-12 17:18:50,644 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2023-10-12 17:18:50,644 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2023-10-12 17:18:50,645 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-10-12 17:18:50,687 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:18:50,688 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:18:50,763 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:18:50,769 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:18:50,769 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:18:50,770 INFO L201 PluginConnector]: Adding new model max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:50 BoogieIcfgContainer [2023-10-12 17:18:50,771 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:18:50,771 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:18:50,772 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:18:50,775 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:18:50,776 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:50,776 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:50" (1/2) ... [2023-10-12 17:18:50,777 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ca1ac06 and model type max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:18:50, skipping insertion in model container [2023-10-12 17:18:50,777 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:50,777 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:50" (2/2) ... [2023-10-12 17:18:50,779 INFO L332 chiAutomizerObserver]: Analyzing ICFG max-tailsum3.bpl [2023-10-12 17:18:50,848 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:18:50,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 110 flow [2023-10-12 17:18:50,921 INFO L124 PetriNetUnfolderBase]: 3/37 cut-off events. [2023-10-12 17:18:50,921 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:18:50,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 3/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2023-10-12 17:18:50,927 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 43 transitions, 110 flow [2023-10-12 17:18:50,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 37 transitions, 92 flow [2023-10-12 17:18:50,934 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:18:50,962 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 37 transitions, 92 flow [2023-10-12 17:18:50,964 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 37 transitions, 92 flow [2023-10-12 17:18:50,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 92 flow [2023-10-12 17:18:50,975 INFO L124 PetriNetUnfolderBase]: 3/37 cut-off events. [2023-10-12 17:18:50,975 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:18:50,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 3/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2023-10-12 17:18:50,977 INFO L119 LiptonReduction]: Number of co-enabled transitions 594 [2023-10-12 17:18:51,409 INFO L134 LiptonReduction]: Checked pairs total: 452 [2023-10-12 17:18:51,409 INFO L136 LiptonReduction]: Total number of compositions: 19 [2023-10-12 17:18:51,420 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:18:51,420 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:18:51,420 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:18:51,420 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:18:51,420 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:18:51,420 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:18:51,420 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:18:51,421 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:18:51,421 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:18:51,425 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:51,425 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:18:51,425 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:51,425 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:51,427 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:18:51,428 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:18:51,429 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:51,429 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:18:51,429 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:51,429 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:51,433 INFO L748 eck$LassoCheckResult]: Stem: 51#[$Ultimate##0]true [39] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k2_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 53#[L54]true [71] 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] 55#[L54-1, $Ultimate##0]true [97] $Ultimate##0-->L31-1: Formula: (and (= v_sumThread1of1ForFork0_i_27 v_sumThread1of1ForFork0_lo_5) (= 0 v_sumThread1of1ForFork0_x_21) (= 0 v_sumThread1of1ForFork0_z_13)) InVars {sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_5} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_21, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_13, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_27, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_5} AuxVars[] AssignedVars[sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i] 57#[L54-1, L31-1]true [2023-10-12 17:18:51,433 INFO L750 eck$LassoCheckResult]: Loop: 57#[L54-1, L31-1]true [99] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork0_i_30 v_sumThread1of1ForFork0_hi_11) (= (+ (select v_A_19 v_sumThread1of1ForFork0_i_30) v_sumThread1of1ForFork0_x_24) v_sumThread1of1ForFork0_x_23) (= (+ v_sumThread1of1ForFork0_i_30 1) v_sumThread1of1ForFork0_i_29) (= (let ((.cse0 (+ (select v_A_19 v_sumThread1of1ForFork0_i_29) v_sumThread1of1ForFork0_z_16))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork0_z_15)) InVars {A=v_A_19, sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_11, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_24, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_16, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_30} OutVars{A=v_A_19, sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_11, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_23, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_15, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_29} AuxVars[] AssignedVars[sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i] 57#[L54-1, L31-1]true [2023-10-12 17:18:51,437 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:51,437 INFO L85 PathProgramCache]: Analyzing trace with hash 69568, now seen corresponding path program 1 times [2023-10-12 17:18:51,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:51,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229641739] [2023-10-12 17:18:51,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:51,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:51,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:51,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:51,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:51,534 INFO L85 PathProgramCache]: Analyzing trace with hash 130, now seen corresponding path program 1 times [2023-10-12 17:18:51,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:51,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156827518] [2023-10-12 17:18:51,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:51,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:51,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:51,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:51,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:51,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2156707, now seen corresponding path program 1 times [2023-10-12 17:18:51,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:51,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163186699] [2023-10-12 17:18:51,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:51,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:51,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:51,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:51,781 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:51,782 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:51,782 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:51,784 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:51,784 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:51,784 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:51,784 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:51,784 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:51,784 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum3.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:18:51,784 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:51,784 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:51,799 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:51,810 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:51,817 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:52,024 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:52,027 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:52,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:52,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:52,035 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) [2023-10-12 17:18:52,036 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 [2023-10-12 17:18:52,038 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 [2023-10-12 17:18:52,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:52,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:52,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:52,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:52,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:52,052 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:52,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:52,076 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 [2023-10-12 17:18:52,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:52,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:52,078 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) [2023-10-12 17:18:52,085 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 [2023-10-12 17:18:52,086 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 [2023-10-12 17:18:52,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:52,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:52,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:52,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:52,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:52,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:52,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:52,120 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 [2023-10-12 17:18:52,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:52,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:52,122 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) [2023-10-12 17:18:52,135 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 [2023-10-12 17:18:52,136 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 [2023-10-12 17:18:52,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:52,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:52,144 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:52,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:52,153 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:52,153 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:52,175 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:52,187 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:18:52,187 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-10-12 17:18:52,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:52,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:52,193 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) [2023-10-12 17:18:52,200 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:52,208 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 [2023-10-12 17:18:52,210 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:18:52,210 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:52,211 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork0_hi, sumThread1of1ForFork0_i) = 1*sumThread1of1ForFork0_hi - 1*sumThread1of1ForFork0_i Supporting invariants [] [2023-10-12 17:18:52,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2023-10-12 17:18:52,219 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:18:52,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:52,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:52,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:52,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:18:52,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:52,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:18:52,316 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2023-10-12 17:18:52,319 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2023-10-12 17:18:52,472 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 5 states and 362 transitions. [2023-10-12 17:18:52,473 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:52,477 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:52,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:18:52,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2023-10-12 17:18:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2023-10-12 17:18:52,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 180 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:18:52,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:52,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 180 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:18:52,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:52,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 180 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:18:52,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:52,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:52,589 INFO L124 PetriNetUnfolderBase]: 369/535 cut-off events. [2023-10-12 17:18:52,590 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2023-10-12 17:18:52,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1194 conditions, 535 events. 369/535 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1712 event pairs, 10 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 1049. Up to 168 conditions per place. [2023-10-12 17:18:52,596 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:52,603 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:52,603 INFO L430 stractBuchiCegarLoop]: Abstraction has has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:52,607 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:18:52,607 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 places, 204 transitions, 1020 flow [2023-10-12 17:18:52,623 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:52,623 INFO L124 PetriNetUnfolderBase]: 17/37 cut-off events. [2023-10-12 17:18:52,623 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:18:52,623 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:52,624 INFO L748 eck$LassoCheckResult]: Stem: 51#[$Ultimate##0]true [39] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k2_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 53#[L54]true [71] 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] 55#[L54-1, $Ultimate##0]true [74] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, 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] 106#[$Ultimate##0, $Ultimate##0, L55]true [96] $Ultimate##0-->L31-1: Formula: (and (= v_sumThread1of1ForFork1_lo_5 v_sumThread1of1ForFork1_i_29) (= 0 v_sumThread1of1ForFork1_z_21) (= 0 v_sumThread1of1ForFork1_x_21)) InVars {sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_5} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_21, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_29, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_21, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_5} AuxVars[] AssignedVars[sumThread1of1ForFork1_z, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x] 108#[L31-1, $Ultimate##0, L55]true [2023-10-12 17:18:52,624 INFO L750 eck$LassoCheckResult]: Loop: 108#[L31-1, $Ultimate##0, L55]true [95] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork1_i_26 v_sumThread1of1ForFork1_hi_11) (= (+ (select v_A_15 v_sumThread1of1ForFork1_i_26) v_sumThread1of1ForFork1_x_18) v_sumThread1of1ForFork1_x_17) (= (+ v_sumThread1of1ForFork1_i_26 1) v_sumThread1of1ForFork1_i_25) (= (let ((.cse0 (+ (select v_A_15 v_sumThread1of1ForFork1_i_25) v_sumThread1of1ForFork1_z_18))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork1_z_17)) InVars {A=v_A_15, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_11, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_18, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_26, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_18} OutVars{A=v_A_15, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_11, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_17, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_25, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_17} AuxVars[] AssignedVars[sumThread1of1ForFork1_z, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x] 108#[L31-1, $Ultimate##0, L55]true [95] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork1_i_26 v_sumThread1of1ForFork1_hi_11) (= (+ (select v_A_15 v_sumThread1of1ForFork1_i_26) v_sumThread1of1ForFork1_x_18) v_sumThread1of1ForFork1_x_17) (= (+ v_sumThread1of1ForFork1_i_26 1) v_sumThread1of1ForFork1_i_25) (= (let ((.cse0 (+ (select v_A_15 v_sumThread1of1ForFork1_i_25) v_sumThread1of1ForFork1_z_18))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork1_z_17)) InVars {A=v_A_15, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_11, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_18, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_26, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_18} OutVars{A=v_A_15, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_11, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_17, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_25, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_17} AuxVars[] AssignedVars[sumThread1of1ForFork1_z, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x] 108#[L31-1, $Ultimate##0, L55]true [2023-10-12 17:18:52,627 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:52,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2155991, now seen corresponding path program 1 times [2023-10-12 17:18:52,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:52,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635426675] [2023-10-12 17:18:52,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:52,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:52,638 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:52,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:52,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:52,645 INFO L85 PathProgramCache]: Analyzing trace with hash 4001, now seen corresponding path program 1 times [2023-10-12 17:18:52,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:52,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213853920] [2023-10-12 17:18:52,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:52,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:52,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:52,690 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 [2023-10-12 17:18:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:52,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:52,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:52,715 INFO L85 PathProgramCache]: Analyzing trace with hash 2071910391, now seen corresponding path program 1 times [2023-10-12 17:18:52,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:52,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378757280] [2023-10-12 17:18:52,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:52,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:52,740 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:52,752 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:52,983 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:52,983 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:52,983 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:52,983 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:52,983 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:52,983 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:52,983 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:52,983 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:52,983 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum3.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:18:52,984 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:52,984 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:52,987 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:52,989 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:52,992 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:52,995 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:52,998 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:53,001 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:53,117 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:53,120 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:53,341 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:53,341 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:53,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:53,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:53,343 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) [2023-10-12 17:18:53,344 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 [2023-10-12 17:18:53,347 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 [2023-10-12 17:18:53,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:53,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:53,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:53,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:53,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:53,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:53,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:53,365 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:53,370 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 [2023-10-12 17:18:53,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:53,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:53,372 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) [2023-10-12 17:18:53,379 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 [2023-10-12 17:18:53,379 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 [2023-10-12 17:18:53,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:53,387 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:53,387 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:53,387 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:53,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:53,389 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:53,404 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:53,413 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 [2023-10-12 17:18:53,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:53,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:53,414 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) [2023-10-12 17:18:53,417 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 [2023-10-12 17:18:53,420 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 [2023-10-12 17:18:53,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:53,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:53,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:53,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:53,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:53,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:53,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:53,446 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 [2023-10-12 17:18:53,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:53,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:53,448 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) [2023-10-12 17:18:53,450 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 [2023-10-12 17:18:53,452 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 [2023-10-12 17:18:53,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:53,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:53,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:53,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:53,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:53,461 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:53,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:53,486 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 [2023-10-12 17:18:53,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:53,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:53,488 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) [2023-10-12 17:18:53,496 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 [2023-10-12 17:18:53,501 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 [2023-10-12 17:18:53,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:53,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:53,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:53,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:53,507 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:53,507 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:53,521 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:53,531 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 [2023-10-12 17:18:53,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:53,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:53,534 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) [2023-10-12 17:18:53,536 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 [2023-10-12 17:18:53,538 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 [2023-10-12 17:18:53,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:53,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:53,545 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:18:53,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:53,565 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:18:53,565 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:18:53,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:53,606 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 [2023-10-12 17:18:53,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:53,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:53,607 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) [2023-10-12 17:18:53,609 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 [2023-10-12 17:18:53,610 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 [2023-10-12 17:18:53,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:53,617 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:53,617 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:53,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:53,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:53,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:53,638 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:53,652 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2023-10-12 17:18:53,653 INFO L444 ModelExtractionUtils]: 9 out of 25 variables were initially zero. Simplification set additionally 13 variables to zero. [2023-10-12 17:18:53,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:53,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:53,657 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) [2023-10-12 17:18:53,665 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 [2023-10-12 17:18:53,704 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:53,713 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:18:53,713 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:53,713 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_hi, sumThread1of1ForFork1_i) = 1*sumThread1of1ForFork1_hi - 1*sumThread1of1ForFork1_i Supporting invariants [] [2023-10-12 17:18:53,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2023-10-12 17:18:53,722 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:18:53,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:53,745 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:53,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:53,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:18:53,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:18:53,770 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:18:53,770 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2023-10-12 17:18:53,912 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 states and 482 transitions. [2023-10-12 17:18:53,912 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:53,929 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:53,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:18:53,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2023-10-12 17:18:53,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2023-10-12 17:18:53,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 239 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:18:53,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:53,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 239 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:18:53,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:53,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 239 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:18:53,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:53,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 3048 transitions, 21336 flow [2023-10-12 17:18:53,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-10-12 17:18:54,142 INFO L124 PetriNetUnfolderBase]: 1139/1592 cut-off events. [2023-10-12 17:18:54,143 INFO L125 PetriNetUnfolderBase]: For 294/294 co-relation queries the response was YES. [2023-10-12 17:18:54,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5111 conditions, 1592 events. 1139/1592 cut-off events. For 294/294 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6194 event pairs, 9 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 4703. Up to 550 conditions per place. [2023-10-12 17:18:54,145 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 49 places, 3048 transitions, 21336 flow [2023-10-12 17:18:54,179 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 49 places, 3048 transitions, 21336 flow [2023-10-12 17:18:54,179 INFO L430 stractBuchiCegarLoop]: Abstraction has has 49 places, 3048 transitions, 21336 flow [2023-10-12 17:18:54,179 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:18:54,179 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 49 places, 3048 transitions, 21336 flow [2023-10-12 17:18:54,204 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:54,204 INFO L124 PetriNetUnfolderBase]: 78/126 cut-off events. [2023-10-12 17:18:54,204 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-10-12 17:18:54,204 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:54,205 INFO L748 eck$LassoCheckResult]: Stem: 51#[$Ultimate##0]true [39] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k2_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 53#[L54]true [71] 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] 55#[L54-1, $Ultimate##0]true [74] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, 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] 106#[$Ultimate##0, $Ultimate##0, L55]true [77] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2) (= v_N_3 v_sumThread1of1ForFork2_hi_6) (= v_sumThread1of1ForFork2_lo_4 (+ v_ULTIMATE.start_k2_5 1))) InVars {N=v_N_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, N=v_N_3, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_8, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_16, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_8, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_4, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x, sumThread1of1ForFork2_lo, sumThread1of1ForFork2_hi] 169#[L56, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [94] $Ultimate##0-->L31-1: Formula: (and (= 0 v_sumThread1of1ForFork2_z_17) (= 0 v_sumThread1of1ForFork2_x_15) (= v_sumThread1of1ForFork2_i_27 v_sumThread1of1ForFork2_lo_7)) InVars {sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_7} OutVars{sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_17, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_27, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_15, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_7} AuxVars[] AssignedVars[sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x] 171#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [2023-10-12 17:18:54,205 INFO L750 eck$LassoCheckResult]: Loop: 171#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [98] L31-1-->L31-1: Formula: (and (= (let ((.cse0 (+ (select v_A_17 v_sumThread1of1ForFork2_i_29) v_sumThread1of1ForFork2_z_20))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork2_z_19) (= (+ 1 v_sumThread1of1ForFork2_i_30) v_sumThread1of1ForFork2_i_29) (= (+ v_sumThread1of1ForFork2_x_18 (select v_A_17 v_sumThread1of1ForFork2_i_30)) v_sumThread1of1ForFork2_x_17) (< v_sumThread1of1ForFork2_i_30 v_sumThread1of1ForFork2_hi_11)) InVars {A=v_A_17, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_20, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_30, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_18, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_11} OutVars{A=v_A_17, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_19, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_29, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_17, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_11} AuxVars[] AssignedVars[sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x] 171#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [98] L31-1-->L31-1: Formula: (and (= (let ((.cse0 (+ (select v_A_17 v_sumThread1of1ForFork2_i_29) v_sumThread1of1ForFork2_z_20))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork2_z_19) (= (+ 1 v_sumThread1of1ForFork2_i_30) v_sumThread1of1ForFork2_i_29) (= (+ v_sumThread1of1ForFork2_x_18 (select v_A_17 v_sumThread1of1ForFork2_i_30)) v_sumThread1of1ForFork2_x_17) (< v_sumThread1of1ForFork2_i_30 v_sumThread1of1ForFork2_hi_11)) InVars {A=v_A_17, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_20, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_30, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_18, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_11} OutVars{A=v_A_17, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_19, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_29, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_17, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_11} AuxVars[] AssignedVars[sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x] 171#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [2023-10-12 17:18:54,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:54,205 INFO L85 PathProgramCache]: Analyzing trace with hash 66835226, now seen corresponding path program 1 times [2023-10-12 17:18:54,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:54,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030563846] [2023-10-12 17:18:54,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:54,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:54,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:54,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:54,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:54,218 INFO L85 PathProgramCache]: Analyzing trace with hash 4097, now seen corresponding path program 1 times [2023-10-12 17:18:54,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:54,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261250199] [2023-10-12 17:18:54,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:54,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:54,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:54,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:54,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:54,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:54,241 INFO L85 PathProgramCache]: Analyzing trace with hash -195854118, now seen corresponding path program 1 times [2023-10-12 17:18:54,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:54,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290903315] [2023-10-12 17:18:54,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:54,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:54,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:54,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:54,506 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:54,506 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:54,507 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:54,507 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:54,507 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:54,507 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:54,507 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:54,507 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:54,507 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum3.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:18:54,507 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:54,507 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:54,510 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:54,629 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:54,631 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:54,635 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:54,637 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:54,639 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:54,641 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:54,644 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:54,646 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:54,648 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:54,650 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:54,652 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:54,654 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:54,656 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:18:54,914 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:54,914 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:54,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:54,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:54,915 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) [2023-10-12 17:18:54,918 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 [2023-10-12 17:18:54,920 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 [2023-10-12 17:18:54,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:54,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:54,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:54,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:54,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:54,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:54,952 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:54,981 INFO L443 ModelExtractionUtils]: Simplification made 19 calls to the SMT solver. [2023-10-12 17:18:54,981 INFO L444 ModelExtractionUtils]: 11 out of 31 variables were initially zero. Simplification set additionally 17 variables to zero. [2023-10-12 17:18:54,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:54,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:54,985 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) [2023-10-12 17:18:54,993 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 [2023-10-12 17:18:54,993 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:55,009 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:18:55,009 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:55,009 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork2_i, sumThread1of1ForFork2_hi) = -1*sumThread1of1ForFork2_i + 1*sumThread1of1ForFork2_hi Supporting invariants [] [2023-10-12 17:18:55,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2023-10-12 17:18:55,022 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:18:55,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:55,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:55,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:55,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:18:55,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:18:55,065 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:18:55,066 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-10-12 17:18:55,206 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 states and 479 transitions. [2023-10-12 17:18:55,206 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:55,486 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:55,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:18:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-10-12 17:18:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2023-10-12 17:18:55,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:18:55,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:55,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:18:55,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:55,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 236 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:18:55,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:55,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 45312 transitions, 407808 flow [2023-10-12 17:18:55,730 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 [2023-10-12 17:19:00,474 INFO L124 PetriNetUnfolderBase]: 2960/4109 cut-off events. [2023-10-12 17:19:00,474 INFO L125 PetriNetUnfolderBase]: For 886/886 co-relation queries the response was YES. [2023-10-12 17:19:00,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17105 conditions, 4109 events. 2960/4109 cut-off events. For 886/886 co-relation queries the response was YES. Maximal size of possible extension queue 305. Compared 18753 event pairs, 4 based on Foata normal form. 0/2169 useless extension candidates. Maximal degree in co-relation 15721. Up to 1487 conditions per place. [2023-10-12 17:19:00,479 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 63 places, 45312 transitions, 407808 flow [2023-10-12 17:19:00,898 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 63 places, 45312 transitions, 407808 flow [2023-10-12 17:19:00,898 INFO L430 stractBuchiCegarLoop]: Abstraction has has 63 places, 45312 transitions, 407808 flow [2023-10-12 17:19:00,898 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:19:00,898 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 63 places, 45312 transitions, 407808 flow [2023-10-12 17:19:07,349 INFO L124 PetriNetUnfolderBase]: 2960/4109 cut-off events. [2023-10-12 17:19:07,349 INFO L125 PetriNetUnfolderBase]: For 886/886 co-relation queries the response was YES. [2023-10-12 17:19:07,349 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2023-10-12 17:19:07,354 INFO L201 PluginConnector]: Adding new model max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:19:07 BoogieIcfgContainer [2023-10-12 17:19:07,354 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:19:07,354 INFO L158 Benchmark]: Toolchain (without parser) took 16840.33ms. Allocated memory was 175.1MB in the beginning and 1.2GB in the end (delta: 984.6MB). Free memory was 129.0MB in the beginning and 938.3MB in the end (delta: -809.3MB). Peak memory consumption was 462.5MB. Max. memory is 8.0GB. [2023-10-12 17:19:07,355 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.26ms. Allocated memory is still 175.1MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:19:07,355 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.69ms. Allocated memory is still 175.1MB. Free memory was 129.0MB in the beginning and 127.3MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-10-12 17:19:07,356 INFO L158 Benchmark]: Boogie Preprocessor took 17.03ms. Allocated memory is still 175.1MB. Free memory was 127.3MB in the beginning and 126.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:19:07,356 INFO L158 Benchmark]: RCFGBuilder took 209.71ms. Allocated memory is still 175.1MB. Free memory was 126.2MB in the beginning and 117.2MB in the end (delta: 9.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:19:07,356 INFO L158 Benchmark]: BuchiAutomizer took 16582.37ms. Allocated memory was 175.1MB in the beginning and 1.2GB in the end (delta: 984.6MB). Free memory was 117.0MB in the beginning and 938.3MB in the end (delta: -821.2MB). Peak memory consumption was 448.8MB. Max. memory is 8.0GB. [2023-10-12 17:19:07,358 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.26ms. Allocated memory is still 175.1MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.69ms. Allocated memory is still 175.1MB. Free memory was 129.0MB in the beginning and 127.3MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.03ms. Allocated memory is still 175.1MB. Free memory was 127.3MB in the beginning and 126.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 209.71ms. Allocated memory is still 175.1MB. Free memory was 126.2MB in the beginning and 117.2MB in the end (delta: 9.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 16582.37ms. Allocated memory was 175.1MB in the beginning and 1.2GB in the end (delta: 984.6MB). Free memory was 117.0MB in the beginning and 938.3MB in the end (delta: -821.2MB). Peak memory consumption was 448.8MB. 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 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + hi and consists of 3 locations. One deterministic module has affine ranking function -1 * i + hi and consists of 4 locations. One deterministic module has affine ranking function -1 * i + hi and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.4s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 2.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 459 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 456 mSDsluCounter, 488 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 217 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 436 IncrementalHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 271 mSDtfsCounter, 436 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital129 mio100 ax100 hnf100 lsp258 ukn34 mio100 lsp63 div100 bol100 ite100 ukn100 eq165 hnf96 smp100 dnf280 smp38 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 68ms VariablesStem: 2 VariablesLoop: 7 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 44 PlacesBefore, 25 PlacesAfterwards, 37 TransitionsBefore, 18 TransitionsAfterwards, 594 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 19 TotalNumberOfCompositions, 452 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 452, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 364, independent: 364, independent conditional: 0, independent unconditional: 364, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 364, independent: 364, independent conditional: 0, independent unconditional: 364, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 452, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 364, unknown conditional: 0, unknown unconditional: 364] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:19:07,377 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...