/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-tailsum4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:18:55,173 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:18:55,231 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:55,254 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:18:55,254 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:18:55,255 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:18:55,255 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:18:55,256 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:18:55,256 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:18:55,259 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:18:55,259 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:18:55,259 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:18:55,259 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:18:55,260 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:18:55,260 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:18:55,261 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:18:55,261 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:18:55,261 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:18:55,261 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:18:55,261 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:18:55,261 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:18:55,262 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:18:55,262 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:18:55,263 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:18:55,263 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:18:55,263 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:18:55,263 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:18:55,263 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:18:55,263 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:18:55,263 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:18:55,264 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:18:55,264 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:18:55,264 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:18:55,265 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:18:55,265 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:55,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:18:55,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:18:55,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:18:55,458 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:18:55,459 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:18:55,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum4.bpl [2023-10-12 17:18:55,460 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum4.bpl' [2023-10-12 17:18:55,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:18:55,482 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:18:55,483 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:55,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:18:55,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:18:55,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:55" (1/1) ... [2023-10-12 17:18:55,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:55" (1/1) ... [2023-10-12 17:18:55,499 INFO L138 Inliner]: procedures = 3, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:18:55,500 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:18:55,501 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:18:55,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:18:55,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:18:55,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:55" (1/1) ... [2023-10-12 17:18:55,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:55" (1/1) ... [2023-10-12 17:18:55,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:55" (1/1) ... [2023-10-12 17:18:55,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:55" (1/1) ... [2023-10-12 17:18:55,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:55" (1/1) ... [2023-10-12 17:18:55,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:55" (1/1) ... [2023-10-12 17:18:55,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:55" (1/1) ... [2023-10-12 17:18:55,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:55" (1/1) ... [2023-10-12 17:18:55,519 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:18:55,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:18:55,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:18:55,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:18:55,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:55" (1/1) ... [2023-10-12 17:18:55,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:55,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:55,544 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:55,561 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:55,569 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:18:55,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:18:55,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:18:55,572 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2023-10-12 17:18:55,573 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2023-10-12 17:18:55,573 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2023-10-12 17:18:55,574 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:55,611 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:18:55,612 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:18:55,740 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:18:55,745 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:18:55,745 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:18:55,746 INFO L201 PluginConnector]: Adding new model max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:55 BoogieIcfgContainer [2023-10-12 17:18:55,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:18:55,747 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:18:55,747 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:18:55,753 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:18:55,754 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:55,754 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:18:55" (1/2) ... [2023-10-12 17:18:55,755 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1505c162 and model type max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:18:55, skipping insertion in model container [2023-10-12 17:18:55,755 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:18:55,755 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:18:55" (2/2) ... [2023-10-12 17:18:55,756 INFO L332 chiAutomizerObserver]: Analyzing ICFG max-tailsum4.bpl [2023-10-12 17:18:55,883 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:18:55,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 56 transitions, 144 flow [2023-10-12 17:18:55,947 INFO L124 PetriNetUnfolderBase]: 4/48 cut-off events. [2023-10-12 17:18:55,947 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:18:55,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 48 events. 4/48 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2023-10-12 17:18:55,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 56 transitions, 144 flow [2023-10-12 17:18:55,957 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 48 transitions, 120 flow [2023-10-12 17:18:55,959 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:18:55,980 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 48 transitions, 120 flow [2023-10-12 17:18:55,982 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 48 transitions, 120 flow [2023-10-12 17:18:55,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 48 transitions, 120 flow [2023-10-12 17:18:55,996 INFO L124 PetriNetUnfolderBase]: 4/48 cut-off events. [2023-10-12 17:18:55,997 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:18:55,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 48 events. 4/48 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 128 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2023-10-12 17:18:55,998 INFO L119 LiptonReduction]: Number of co-enabled transitions 1188 [2023-10-12 17:18:56,472 INFO L134 LiptonReduction]: Checked pairs total: 906 [2023-10-12 17:18:56,473 INFO L136 LiptonReduction]: Total number of compositions: 25 [2023-10-12 17:18:56,497 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:18:56,497 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:18:56,497 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:18:56,497 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:18:56,497 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:18:56,498 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:18:56,498 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:18:56,498 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:18:56,498 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:18:56,501 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:56,501 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:18:56,501 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:56,501 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:56,503 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:18:56,503 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 23 transitions, 70 flow [2023-10-12 17:18:56,504 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:56,504 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:18:56,504 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:18:56,504 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:56,507 INFO L748 eck$LassoCheckResult]: Stem: 65#[$Ultimate##0]true [43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 67#[L54]true [84] 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] 69#[L54-1, $Ultimate##0]true [120] $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] 71#[L54-1, L31-1]true [2023-10-12 17:18:56,507 INFO L750 eck$LassoCheckResult]: Loop: 71#[L54-1, L31-1]true [122] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork0_i_30 v_sumThread1of1ForFork0_hi_11) (= (+ v_sumThread1of1ForFork0_i_30 1) v_sumThread1of1ForFork0_i_29) (= (+ (select v_A_25 v_sumThread1of1ForFork0_i_30) v_sumThread1of1ForFork0_x_24) v_sumThread1of1ForFork0_x_23) (= (let ((.cse0 (+ (select v_A_25 v_sumThread1of1ForFork0_i_29) v_sumThread1of1ForFork0_z_16))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork0_z_15)) InVars {A=v_A_25, 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_25, 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] 71#[L54-1, L31-1]true [2023-10-12 17:18:56,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:56,510 INFO L85 PathProgramCache]: Analyzing trace with hash 73838, now seen corresponding path program 1 times [2023-10-12 17:18:56,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:56,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309540246] [2023-10-12 17:18:56,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:56,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:56,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:56,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:56,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:56,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:56,622 INFO L85 PathProgramCache]: Analyzing trace with hash 153, now seen corresponding path program 1 times [2023-10-12 17:18:56,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:56,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379303503] [2023-10-12 17:18:56,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:56,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:56,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:56,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:56,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2289100, now seen corresponding path program 1 times [2023-10-12 17:18:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:56,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059831394] [2023-10-12 17:18:56,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:56,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:56,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:56,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:56,807 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:56,808 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:56,808 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:56,808 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:56,808 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:56,808 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:56,808 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:56,808 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:56,809 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:18:56,809 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:56,809 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:56,819 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:56,828 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:56,842 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:57,033 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:57,036 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:57,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:57,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:57,202 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:57,203 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:57,246 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:57,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:57,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:57,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:57,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:57,256 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:57,256 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:57,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:57,296 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:57,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:57,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:57,297 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:57,298 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:57,300 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:57,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:57,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:57,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:57,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:57,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:57,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:57,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:57,343 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:57,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:57,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:57,357 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:57,358 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:57,361 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:57,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:57,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:57,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:57,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:57,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:57,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:57,401 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:57,432 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2023-10-12 17:18:57,433 INFO L444 ModelExtractionUtils]: 7 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. [2023-10-12 17:18:57,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:57,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:57,436 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:57,437 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:57,439 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:57,458 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:18:57,458 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:57,465 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:57,472 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:57,474 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:18:57,488 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:57,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:57,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:57,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:57,522 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:18:57,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:57,524 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:57,544 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:57,545 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:57,674 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 476 transitions. [2023-10-12 17:18:57,674 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:57,677 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:57,678 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:57,681 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:57,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2023-10-12 17:18:57,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 237 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:18:57,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:57,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 237 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:18:57,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:57,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 237 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:18:57,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:57,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 264 transitions, 1332 flow [2023-10-12 17:18:57,772 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:57,847 INFO L124 PetriNetUnfolderBase]: 1740/2256 cut-off events. [2023-10-12 17:18:57,848 INFO L125 PetriNetUnfolderBase]: For 337/337 co-relation queries the response was YES. [2023-10-12 17:18:57,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4928 conditions, 2256 events. 1740/2256 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7670 event pairs, 53 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 4589. Up to 716 conditions per place. [2023-10-12 17:18:57,855 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 42 places, 264 transitions, 1332 flow [2023-10-12 17:18:57,859 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 42 places, 264 transitions, 1332 flow [2023-10-12 17:18:57,862 INFO L430 stractBuchiCegarLoop]: Abstraction has has 42 places, 264 transitions, 1332 flow [2023-10-12 17:18:57,862 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:18:57,862 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 42 places, 264 transitions, 1332 flow [2023-10-12 17:18:57,867 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:57,867 INFO L124 PetriNetUnfolderBase]: 26/48 cut-off events. [2023-10-12 17:18:57,867 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-10-12 17:18:57,867 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:57,867 INFO L748 eck$LassoCheckResult]: Stem: 65#[$Ultimate##0]true [43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 67#[L54]true [84] 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] 69#[L54-1, $Ultimate##0]true [87] 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] 120#[$Ultimate##0, $Ultimate##0, L55]true [116] $Ultimate##0-->L31-1: Formula: (and (= 0 v_sumThread1of1ForFork1_z_17) (= v_sumThread1of1ForFork1_lo_5 v_sumThread1of1ForFork1_i_25) (= 0 v_sumThread1of1ForFork1_x_17)) InVars {sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_5} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_17, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_25, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_17, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_5} AuxVars[] AssignedVars[sumThread1of1ForFork1_z, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x] 122#[L31-1, $Ultimate##0, L55]true [2023-10-12 17:18:57,867 INFO L750 eck$LassoCheckResult]: Loop: 122#[L31-1, $Ultimate##0, L55]true [119] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork1_i_28 v_sumThread1of1ForFork1_hi_11) (= (+ (select v_A_21 v_sumThread1of1ForFork1_i_28) v_sumThread1of1ForFork1_x_20) v_sumThread1of1ForFork1_x_19) (= (let ((.cse0 (+ (select v_A_21 v_sumThread1of1ForFork1_i_27) v_sumThread1of1ForFork1_z_20))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork1_z_19) (= (+ v_sumThread1of1ForFork1_i_28 1) v_sumThread1of1ForFork1_i_27)) InVars {A=v_A_21, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_11, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_20, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_28, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_20} OutVars{A=v_A_21, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_11, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_19, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_27, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_19} AuxVars[] AssignedVars[sumThread1of1ForFork1_z, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x] 122#[L31-1, $Ultimate##0, L55]true [119] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork1_i_28 v_sumThread1of1ForFork1_hi_11) (= (+ (select v_A_21 v_sumThread1of1ForFork1_i_28) v_sumThread1of1ForFork1_x_20) v_sumThread1of1ForFork1_x_19) (= (let ((.cse0 (+ (select v_A_21 v_sumThread1of1ForFork1_i_27) v_sumThread1of1ForFork1_z_20))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork1_z_19) (= (+ v_sumThread1of1ForFork1_i_28 1) v_sumThread1of1ForFork1_i_27)) InVars {A=v_A_21, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_11, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_20, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_28, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_20} OutVars{A=v_A_21, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_11, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_19, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_27, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_19} AuxVars[] AssignedVars[sumThread1of1ForFork1_z, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x] 122#[L31-1, $Ultimate##0, L55]true [2023-10-12 17:18:57,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:57,869 INFO L85 PathProgramCache]: Analyzing trace with hash 2288071, now seen corresponding path program 1 times [2023-10-12 17:18:57,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:57,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467009419] [2023-10-12 17:18:57,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:57,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:57,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:57,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:57,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:57,892 INFO L85 PathProgramCache]: Analyzing trace with hash 4769, now seen corresponding path program 1 times [2023-10-12 17:18:57,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:57,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819630783] [2023-10-12 17:18:57,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:57,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:57,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:57,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:57,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:57,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2096127257, now seen corresponding path program 1 times [2023-10-12 17:18:57,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:57,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243805670] [2023-10-12 17:18:57,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:57,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:57,913 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:57,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:58,150 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:58,150 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:58,150 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:58,150 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:58,150 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:58,150 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:58,150 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:58,150 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:58,151 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:18:58,151 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:58,151 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:58,156 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:58,157 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:58,159 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:58,161 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:58,163 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:58,259 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:58,262 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:58,263 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:58,468 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:18:58,468 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:18:58,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:58,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:58,470 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:58,473 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:58,477 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:58,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:58,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:18:58,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:58,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:58,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:58,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:18:58,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:18:58,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:58,504 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:58,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:58,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:58,506 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:58,508 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:58,510 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:58,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:58,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:58,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:58,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:58,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:58,523 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:58,540 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:58,546 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:58,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:58,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:58,547 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:58,550 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:58,551 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:58,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:58,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:58,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:58,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:58,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:58,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:58,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:58,583 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:58,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:58,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:58,585 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:58,609 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:58,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:58,616 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:58,616 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:58,616 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:58,619 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:58,619 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:58,622 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:58,632 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:18:58,637 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:58,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:58,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:58,639 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:58,641 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:58,643 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:58,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:18:58,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:18:58,650 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:18:58,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:18:58,655 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:18:58,655 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:18:58,672 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:18:58,694 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:18:58,695 INFO L444 ModelExtractionUtils]: 8 out of 28 variables were initially zero. Simplification set additionally 17 variables to zero. [2023-10-12 17:18:58,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:58,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:18:58,737 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:58,738 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:58,740 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:18:58,768 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:18:58,769 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:18:58,769 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:58,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2023-10-12 17:18:58,783 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:18:58,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:58,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:18:58,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:58,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:18:58,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:18:58,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:18:58,813 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:58,813 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:58,813 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:58,907 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:59,004 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 634 transitions. [2023-10-12 17:18:59,004 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:18:59,032 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:18:59,033 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:59,033 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:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 315 transitions. [2023-10-12 17:18:59,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 315 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:18:59,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:59,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 315 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:18:59,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:59,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 315 transitions. Stem has 4 letters. Loop has 4 letters. [2023-10-12 17:18:59,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:18:59,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 4008 transitions, 28248 flow [2023-10-12 17:18:59,625 INFO L124 PetriNetUnfolderBase]: 5546/7018 cut-off events. [2023-10-12 17:18:59,625 INFO L125 PetriNetUnfolderBase]: For 1124/1124 co-relation queries the response was YES. [2023-10-12 17:18:59,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22339 conditions, 7018 events. 5546/7018 cut-off events. For 1124/1124 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 26645 event pairs, 33 based on Foata normal form. 0/3964 useless extension candidates. Maximal degree in co-relation 21170. Up to 2412 conditions per place. [2023-10-12 17:18:59,632 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 56 places, 4008 transitions, 28248 flow [2023-10-12 17:18:59,662 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 56 places, 4008 transitions, 28248 flow [2023-10-12 17:18:59,662 INFO L430 stractBuchiCegarLoop]: Abstraction has has 56 places, 4008 transitions, 28248 flow [2023-10-12 17:18:59,662 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:18:59,662 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 56 places, 4008 transitions, 28248 flow [2023-10-12 17:18:59,685 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:18:59,685 INFO L124 PetriNetUnfolderBase]: 105/161 cut-off events. [2023-10-12 17:18:59,685 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2023-10-12 17:18:59,685 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:18:59,686 INFO L748 eck$LassoCheckResult]: Stem: 65#[$Ultimate##0]true [43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 67#[L54]true [84] 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] 69#[L54-1, $Ultimate##0]true [87] 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] 120#[$Ultimate##0, $Ultimate##0, L55]true [90] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2) (= v_ULTIMATE.start_k3_3 v_sumThread1of1ForFork2_hi_6) (= v_sumThread1of1ForFork2_lo_4 (+ v_ULTIMATE.start_k2_5 1))) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_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, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_8, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_16, ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, 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] 183#[L56, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [117] $Ultimate##0-->L31-1: Formula: (and (= 0 v_sumThread1of1ForFork2_z_17) (= 0 v_sumThread1of1ForFork2_x_17) (= v_sumThread1of1ForFork2_i_25 v_sumThread1of1ForFork2_lo_5)) InVars {sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_5} OutVars{sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_17, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_25, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_17, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_5} AuxVars[] AssignedVars[sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x] 185#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [2023-10-12 17:18:59,686 INFO L750 eck$LassoCheckResult]: Loop: 185#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [118] L31-1-->L31-1: Formula: (and (= (+ (select v_A_19 v_sumThread1of1ForFork2_i_28) v_sumThread1of1ForFork2_x_20) v_sumThread1of1ForFork2_x_19) (= (let ((.cse0 (+ v_sumThread1of1ForFork2_z_20 (select v_A_19 v_sumThread1of1ForFork2_i_27)))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork2_z_19) (= (+ 1 v_sumThread1of1ForFork2_i_28) v_sumThread1of1ForFork2_i_27) (< v_sumThread1of1ForFork2_i_28 v_sumThread1of1ForFork2_hi_11)) InVars {A=v_A_19, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_20, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_28, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_20, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_11} OutVars{A=v_A_19, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_19, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_27, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_19, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_11} AuxVars[] AssignedVars[sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x] 185#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [118] L31-1-->L31-1: Formula: (and (= (+ (select v_A_19 v_sumThread1of1ForFork2_i_28) v_sumThread1of1ForFork2_x_20) v_sumThread1of1ForFork2_x_19) (= (let ((.cse0 (+ v_sumThread1of1ForFork2_z_20 (select v_A_19 v_sumThread1of1ForFork2_i_27)))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork2_z_19) (= (+ 1 v_sumThread1of1ForFork2_i_28) v_sumThread1of1ForFork2_i_27) (< v_sumThread1of1ForFork2_i_28 v_sumThread1of1ForFork2_hi_11)) InVars {A=v_A_19, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_20, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_28, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_20, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_11} OutVars{A=v_A_19, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_19, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_27, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_19, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_11} AuxVars[] AssignedVars[sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x] 185#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [2023-10-12 17:18:59,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:59,687 INFO L85 PathProgramCache]: Analyzing trace with hash 70929512, now seen corresponding path program 1 times [2023-10-12 17:18:59,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:59,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210923020] [2023-10-12 17:18:59,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:59,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:59,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:59,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:59,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:59,698 INFO L85 PathProgramCache]: Analyzing trace with hash 4737, now seen corresponding path program 1 times [2023-10-12 17:18:59,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:59,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741675628] [2023-10-12 17:18:59,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:59,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:59,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:59,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:59,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:18:59,707 INFO L85 PathProgramCache]: Analyzing trace with hash -556211928, now seen corresponding path program 1 times [2023-10-12 17:18:59,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:18:59,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018203662] [2023-10-12 17:18:59,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:18:59,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:18:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:59,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:18:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:18:59,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:18:59,941 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:18:59,941 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:18:59,941 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:18:59,941 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:18:59,941 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:18:59,941 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:18:59,941 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:18:59,941 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:18:59,941 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:18:59,941 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:18:59,941 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:18:59,944 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:59,945 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:59,947 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:59,950 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:59,952 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:19:00,052 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:19:00,054 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:19:00,056 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:19:00,058 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:19:00,059 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:19:00,061 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:19:00,063 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:19:00,065 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:19:00,067 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:19:00,166 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-10-12 17:19:00,302 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:19:00,302 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:19:00,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:00,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:00,304 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:19:00,309 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:19:00,318 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:19:00,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:00,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:19:00,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:00,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:00,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:00,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:19:00,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:19:00,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:00,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:00,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:00,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:00,341 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:19:00,344 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:19:00,345 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:19:00,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:00,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:00,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:00,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:00,352 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:00,352 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:00,364 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:00,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:00,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:00,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:00,373 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:19:00,375 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:19:00,376 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:19:00,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:00,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:00,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:00,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:00,383 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:00,383 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:00,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:00,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:00,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:00,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:00,406 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:19:00,408 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:19:00,410 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:19:00,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:00,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:00,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:00,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:00,418 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:00,418 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:00,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:00,433 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,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:00,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:00,435 INFO L229 MonitoredProcess]: Starting monitored process 16 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:19:00,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-10-12 17:19:00,438 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:19:00,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:00,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:00,444 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:19:00,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:00,462 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:19:00,462 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:19:00,496 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:00,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:00,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:00,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:00,506 INFO L229 MonitoredProcess]: Starting monitored process 17 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:19:00,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:19:00,509 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:19:00,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:00,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:00,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:00,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:00,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:00,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:00,537 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:19:00,549 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:19:00,549 INFO L444 ModelExtractionUtils]: 10 out of 34 variables were initially zero. Simplification set additionally 21 variables to zero. [2023-10-12 17:19:00,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:00,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:00,550 INFO L229 MonitoredProcess]: Starting monitored process 18 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:19:00,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:19:00,556 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:19:00,561 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:19:00,562 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:19:00,562 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:19:00,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:00,567 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:19:00,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:19:00,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:19:00,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:19:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:19:00,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:19:00,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:19:00,612 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:19:00,613 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:19:00,613 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:19:00,775 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 634 transitions. [2023-10-12 17:19:00,775 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:19:01,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-10-12 17:19:01,191 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:19:01,191 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:19:01,192 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:19:01,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 315 transitions. [2023-10-12 17:19:01,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 315 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:19:01,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:01,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 315 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:19:01,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:01,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 315 transitions. Stem has 5 letters. Loop has 4 letters. [2023-10-12 17:19:01,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:01,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 60672 transitions, 549120 flow [2023-10-12 17:19:26,489 INFO L124 PetriNetUnfolderBase]: 16747/20946 cut-off events. [2023-10-12 17:19:26,489 INFO L125 PetriNetUnfolderBase]: For 3526/3526 co-relation queries the response was YES. [2023-10-12 17:19:26,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87371 conditions, 20946 events. 16747/20946 cut-off events. For 3526/3526 co-relation queries the response was YES. Maximal size of possible extension queue 949. Compared 89360 event pairs, 18 based on Foata normal form. 0/11152 useless extension candidates. Maximal degree in co-relation 82466. Up to 7426 conditions per place. [2023-10-12 17:19:26,512 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 70 places, 60672 transitions, 549120 flow [2023-10-12 17:19:27,103 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 70 places, 60672 transitions, 549120 flow [2023-10-12 17:19:27,103 INFO L430 stractBuchiCegarLoop]: Abstraction has has 70 places, 60672 transitions, 549120 flow [2023-10-12 17:19:27,103 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:19:27,103 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 70 places, 60672 transitions, 549120 flow [2023-10-12 17:19:28,562 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:19:28,562 INFO L124 PetriNetUnfolderBase]: 317/450 cut-off events. [2023-10-12 17:19:28,563 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-10-12 17:19:28,563 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:19:28,563 INFO L748 eck$LassoCheckResult]: Stem: 65#[$Ultimate##0]true [43] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k3_1 v_N_1) (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= 0 v_ULTIMATE.start_k1_1) (<= v_ULTIMATE.start_k2_1 v_ULTIMATE.start_k3_1)) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k3=v_ULTIMATE.start_k3_1, ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 67#[L54]true [84] 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] 69#[L54-1, $Ultimate##0]true [87] 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] 120#[$Ultimate##0, $Ultimate##0, L55]true [90] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2) (= v_ULTIMATE.start_k3_3 v_sumThread1of1ForFork2_hi_6) (= v_sumThread1of1ForFork2_lo_4 (+ v_ULTIMATE.start_k2_5 1))) InVars {ULTIMATE.start_k3=v_ULTIMATE.start_k3_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, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_8, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_16, ULTIMATE.start_k3=v_ULTIMATE.start_k3_3, 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] 183#[L56, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [93] L56-->$Ultimate##0: Formula: (and (= v_N_3 v_sumThread1of1ForFork3_hi_6) (= (+ v_ULTIMATE.start_k3_5 1) v_sumThread1of1ForFork3_lo_4) (= v_sumThread1of1ForFork3_thidvar1_2 4) (= v_sumThread1of1ForFork3_thidvar2_2 4) (= v_sumThread1of1ForFork3_thidvar0_2 4) (= v_sumThread1of1ForFork3_thidvar3_2 4)) InVars {N=v_N_3, ULTIMATE.start_k3=v_ULTIMATE.start_k3_5} OutVars{N=v_N_3, sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_16, sumThread1of1ForFork3_thidvar0=v_sumThread1of1ForFork3_thidvar0_2, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_8, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_8, ULTIMATE.start_k3=v_ULTIMATE.start_k3_5, sumThread1of1ForFork3_thidvar3=v_sumThread1of1ForFork3_thidvar3_2, sumThread1of1ForFork3_thidvar2=v_sumThread1of1ForFork3_thidvar2_2, sumThread1of1ForFork3_thidvar1=v_sumThread1of1ForFork3_thidvar1_2, sumThread1of1ForFork3_lo=v_sumThread1of1ForFork3_lo_4, sumThread1of1ForFork3_hi=v_sumThread1of1ForFork3_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork3_i, sumThread1of1ForFork3_thidvar0, sumThread1of1ForFork3_x, sumThread1of1ForFork3_z, sumThread1of1ForFork3_thidvar3, sumThread1of1ForFork3_thidvar2, sumThread1of1ForFork3_thidvar1, sumThread1of1ForFork3_lo, sumThread1of1ForFork3_hi] 250#[$Ultimate##0, $Ultimate##0, L57, $Ultimate##0, $Ultimate##0]true [115] $Ultimate##0-->L31-1: Formula: (and (= v_sumThread1of1ForFork3_i_27 v_sumThread1of1ForFork3_lo_7) (= 0 v_sumThread1of1ForFork3_z_17) (= 0 v_sumThread1of1ForFork3_x_15)) InVars {sumThread1of1ForFork3_lo=v_sumThread1of1ForFork3_lo_7} OutVars{sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_27, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_15, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_17, sumThread1of1ForFork3_lo=v_sumThread1of1ForFork3_lo_7} AuxVars[] AssignedVars[sumThread1of1ForFork3_i, sumThread1of1ForFork3_x, sumThread1of1ForFork3_z] 252#[L31-1, $Ultimate##0, L57, $Ultimate##0, $Ultimate##0]true [2023-10-12 17:19:28,563 INFO L750 eck$LassoCheckResult]: Loop: 252#[L31-1, $Ultimate##0, L57, $Ultimate##0, $Ultimate##0]true [121] L31-1-->L31-1: Formula: (and (= (let ((.cse0 (+ (select v_A_23 v_sumThread1of1ForFork3_i_29) v_sumThread1of1ForFork3_z_20))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork3_z_19) (< v_sumThread1of1ForFork3_i_30 v_sumThread1of1ForFork3_hi_11) (= (+ 1 v_sumThread1of1ForFork3_i_30) v_sumThread1of1ForFork3_i_29) (= (+ v_sumThread1of1ForFork3_x_18 (select v_A_23 v_sumThread1of1ForFork3_i_30)) v_sumThread1of1ForFork3_x_17)) InVars {A=v_A_23, sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_30, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_18, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_20, sumThread1of1ForFork3_hi=v_sumThread1of1ForFork3_hi_11} OutVars{A=v_A_23, sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_29, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_17, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_19, sumThread1of1ForFork3_hi=v_sumThread1of1ForFork3_hi_11} AuxVars[] AssignedVars[sumThread1of1ForFork3_i, sumThread1of1ForFork3_x, sumThread1of1ForFork3_z] 252#[L31-1, $Ultimate##0, L57, $Ultimate##0, $Ultimate##0]true [121] L31-1-->L31-1: Formula: (and (= (let ((.cse0 (+ (select v_A_23 v_sumThread1of1ForFork3_i_29) v_sumThread1of1ForFork3_z_20))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork3_z_19) (< v_sumThread1of1ForFork3_i_30 v_sumThread1of1ForFork3_hi_11) (= (+ 1 v_sumThread1of1ForFork3_i_30) v_sumThread1of1ForFork3_i_29) (= (+ v_sumThread1of1ForFork3_x_18 (select v_A_23 v_sumThread1of1ForFork3_i_30)) v_sumThread1of1ForFork3_x_17)) InVars {A=v_A_23, sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_30, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_18, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_20, sumThread1of1ForFork3_hi=v_sumThread1of1ForFork3_hi_11} OutVars{A=v_A_23, sumThread1of1ForFork3_i=v_sumThread1of1ForFork3_i_29, sumThread1of1ForFork3_x=v_sumThread1of1ForFork3_x_17, sumThread1of1ForFork3_z=v_sumThread1of1ForFork3_z_19, sumThread1of1ForFork3_hi=v_sumThread1of1ForFork3_hi_11} AuxVars[] AssignedVars[sumThread1of1ForFork3_i, sumThread1of1ForFork3_x, sumThread1of1ForFork3_z] 252#[L31-1, $Ultimate##0, L57, $Ultimate##0, $Ultimate##0]true [2023-10-12 17:19:28,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:28,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2096153053, now seen corresponding path program 1 times [2023-10-12 17:19:28,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:28,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705230155] [2023-10-12 17:19:28,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:28,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:28,568 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:28,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:28,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:28,572 INFO L85 PathProgramCache]: Analyzing trace with hash 4833, now seen corresponding path program 1 times [2023-10-12 17:19:28,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:28,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178624695] [2023-10-12 17:19:28,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:28,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:28,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:28,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:28,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:28,581 INFO L85 PathProgramCache]: Analyzing trace with hash -63418237, now seen corresponding path program 1 times [2023-10-12 17:19:28,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:19:28,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11477676] [2023-10-12 17:19:28,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:19:28,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:19:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:28,586 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:19:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:19:28,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:19:28,824 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:19:28,825 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:19:28,825 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:19:28,825 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:19:28,825 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:19:28,825 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:28,825 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:19:28,825 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:19:28,825 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum4.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:19:28,825 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:19:28,825 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:19:28,832 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:19:28,833 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:19:28,834 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:19:28,836 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:19:28,837 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:19:28,839 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:19:28,840 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:19:28,935 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:19:28,937 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:19:28,939 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:19:28,941 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:19:28,943 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:19:28,945 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:19:28,947 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:19:28,948 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:19:28,950 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:19:28,952 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:19:28,953 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:19:28,956 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:19:28,958 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:19:28,960 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:19:29,270 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:19:29,270 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:19:29,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:29,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:29,273 INFO L229 MonitoredProcess]: Starting monitored process 19 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:19:29,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:19:29,282 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:19:29,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:29,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:19:29,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:29,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:29,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:29,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:19:29,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:19:29,304 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:29,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:29,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:29,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:29,310 INFO L229 MonitoredProcess]: Starting monitored process 20 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:19:29,316 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:19:29,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:29,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:19:29,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:29,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:29,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:29,322 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:19:29,322 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:19:29,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:19:29,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:29,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:29,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:29,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:29,338 INFO L229 MonitoredProcess]: Starting monitored process 21 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:19:29,352 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:19:29,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:29,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:19:29,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:29,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:29,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:29,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:19:29,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:19:29,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:19:29,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:29,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:29,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:29,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:29,362 INFO L229 MonitoredProcess]: Starting monitored process 22 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:19:29,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:19:29,366 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:19:29,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:29,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:19:29,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:29,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:29,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:29,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:19:29,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:19:29,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:29,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:29,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:29,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:29,376 INFO L229 MonitoredProcess]: Starting monitored process 23 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:19:29,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-10-12 17:19:29,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:19:29,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:29,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:29,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:29,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:29,385 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:29,385 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:29,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:29,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:29,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:29,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:29,404 INFO L229 MonitoredProcess]: Starting monitored process 24 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:19:29,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:19:29,407 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:19:29,412 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:29,412 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:19:29,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:29,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:29,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:29,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:19:29,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:19:29,420 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:19:29,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2023-10-12 17:19:29,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:29,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:29,425 INFO L229 MonitoredProcess]: Starting monitored process 25 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:19:29,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-10-12 17:19:29,428 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:19:29,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:19:29,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:19:29,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:19:29,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:19:29,449 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:19:29,449 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:19:29,476 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:19:29,492 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:19:29,492 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-10-12 17:19:29,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:19:29,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:19:29,493 INFO L229 MonitoredProcess]: Starting monitored process 26 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:19:29,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-10-12 17:19:29,496 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:19:29,502 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:19:29,502 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:19:29,503 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork3_i, sumThread1of1ForFork3_hi) = -1*sumThread1of1ForFork3_i + 1*sumThread1of1ForFork3_hi Supporting invariants [] [2023-10-12 17:19:29,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:29,514 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2023-10-12 17:19:29,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:19:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:19:29,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:19:29,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:19:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:19:29,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:19:29,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:19:29,556 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:19:29,557 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:19:29,557 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:19:29,718 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 631 transitions. [2023-10-12 17:19:29,718 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:19:30,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-10-12 17:19:41,769 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:19:41,769 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:19:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:19:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 312 transitions. [2023-10-12 17:19:41,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 312 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:19:41,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:41,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 312 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:19:41,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:41,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 312 transitions. Stem has 6 letters. Loop has 4 letters. [2023-10-12 17:19:41,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:19:41,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 84 places, 915456 transitions, 10119168 flow Received shutdown request... [2023-10-12 17:21:59,170 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-10-12 17:21:59,211 WARN L144 chiPetriNetCegarLoop]: Unhandled de.uni_freiburg.informatik.ultimate.automata.AutomataOperationCanceledException: Timeout or canceled by user.occured during abstraction size reduction. Continuing with non-reduced net [2023-10-12 17:21:59,212 INFO L430 stractBuchiCegarLoop]: Abstraction has has 84 places, 915456 transitions, 10119168 flow [2023-10-12 17:21:59,212 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:21:59,212 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 84 places, 915456 transitions, 10119168 flow [2023-10-12 17:21:59,642 WARN L343 stractBuchiCegarLoop]: Verification cancelled [2023-10-12 17:21:59,650 INFO L201 PluginConnector]: Adding new model max-tailsum4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:21:59 BoogieIcfgContainer [2023-10-12 17:21:59,651 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:21:59,654 INFO L158 Benchmark]: Toolchain (without parser) took 184169.08ms. Allocated memory was 174.1MB in the beginning and 5.2GB in the end (delta: 5.1GB). Free memory was 128.2MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2023-10-12 17:21:59,654 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 174.1MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:21:59,654 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.70ms. Allocated memory is still 174.1MB. Free memory was 128.2MB in the beginning and 126.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:21:59,655 INFO L158 Benchmark]: Boogie Preprocessor took 17.56ms. Allocated memory is still 174.1MB. Free memory was 126.6MB in the beginning and 125.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:21:59,656 INFO L158 Benchmark]: RCFGBuilder took 227.12ms. Allocated memory is still 174.1MB. Free memory was 125.6MB in the beginning and 116.1MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-10-12 17:21:59,657 INFO L158 Benchmark]: BuchiAutomizer took 183903.44ms. Allocated memory was 174.1MB in the beginning and 5.2GB in the end (delta: 5.1GB). Free memory was 115.9MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 3.2GB. Max. memory is 8.0GB. [2023-10-12 17:21:59,659 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.19ms. Allocated memory is still 174.1MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 17.70ms. Allocated memory is still 174.1MB. Free memory was 128.2MB in the beginning and 126.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.56ms. Allocated memory is still 174.1MB. Free memory was 126.6MB in the beginning and 125.6MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 227.12ms. Allocated memory is still 174.1MB. Free memory was 125.6MB in the beginning and 116.1MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 183903.44ms. Allocated memory was 174.1MB in the beginning and 5.2GB in the end (delta: 5.1GB). Free memory was 115.9MB in the beginning and 3.1GB in the end (delta: -2.9GB). Peak memory consumption was 3.2GB. 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 4 terminating modules (0 trivial, 4 deterministic, 0 nondeterministic) and one module whose termination is unknown.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. One deterministic module has affine ranking function -1 * i + hi and consists of 4 locations. The remainder module has 10119168 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 183.7s and 5 iterations. TraceHistogramMax:0. Analysis of lassos took 3.7s. Construction of modules took 0.3s. Büchi inclusion checks took 12.9s. 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 [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 3/3 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 840 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 836 mSDsluCounter, 913 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 420 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 792 IncrementalHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 493 mSDtfsCounter, 792 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital146 mio100 ax100 hnf100 lsp326 ukn29 mio100 lsp59 div100 bol100 ite100 ukn100 eq163 hnf95 smp100 dnf469 smp33 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 62ms 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 - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing PetriNetUnfolderBuchi. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 57 PlacesBefore, 32 PlacesAfterwards, 48 TransitionsBefore, 23 TransitionsAfterwards, 1188 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 24 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 25 TotalNumberOfCompositions, 906 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 906, independent: 906, independent conditional: 0, independent unconditional: 906, 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: 732, independent: 732, independent conditional: 0, independent unconditional: 732, 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: 732, independent: 732, independent conditional: 0, independent unconditional: 732, 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: 906, independent: 174, independent conditional: 0, independent unconditional: 174, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 732, unknown conditional: 0, unknown unconditional: 732] , Statistics on independence cache: Total cache size (in pairs): 48, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, 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 could not prove your program: Timeout Completed graceful shutdown