/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 RABIN_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:37:03,247 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:37:03,316 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:37:03,353 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:37:03,354 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:37:03,354 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:37:03,356 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:37:03,356 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:37:03,357 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:37:03,360 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:37:03,360 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:37:03,361 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:37:03,361 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:37:03,362 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:37:03,362 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:37:03,363 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:37:03,363 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:37:03,363 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:37:03,363 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:37:03,363 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:37:03,364 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:37:03,364 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:37:03,364 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:37:03,364 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:37:03,365 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:37:03,365 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:37:03,365 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:37:03,365 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:37:03,366 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:37:03,366 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:37:03,367 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:37:03,367 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:37:03,367 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:37:03,368 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:37:03,369 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 -> RABIN_PETRI_NET [2023-10-12 17:37:03,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:37:03,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:37:03,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:37:03,633 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:37:03,634 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:37:03,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum3.bpl [2023-10-12 17:37:03,635 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/max-tailsum3.bpl' [2023-10-12 17:37:03,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:37:03,665 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:37:03,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:03,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:37:03,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:37:03,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,689 INFO L138 Inliner]: procedures = 3, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:37:03,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:37:03,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:37:03,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:37:03,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:37:03,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,700 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,704 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:37:03,713 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:37:03,713 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:37:03,713 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:37:03,714 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/1) ... [2023-10-12 17:37:03,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:03,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:03,751 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:37:03,761 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:37:03,783 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:37:03,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:37:03,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:37:03,784 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2023-10-12 17:37:03,784 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2023-10-12 17:37:03,784 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2023-10-12 17:37:03,785 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:37:03,831 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:37:03,833 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:37:03,911 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:37:03,916 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:37:03,917 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:37:03,918 INFO L201 PluginConnector]: Adding new model max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:03 BoogieIcfgContainer [2023-10-12 17:37:03,918 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:37:03,919 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:37:03,919 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:37:03,925 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:37:03,925 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:03,926 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:37:03" (1/2) ... [2023-10-12 17:37:03,927 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@22e211b1 and model type max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:37:03, skipping insertion in model container [2023-10-12 17:37:03,927 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:37:03,927 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:37:03" (2/2) ... [2023-10-12 17:37:03,928 INFO L332 chiAutomizerObserver]: Analyzing ICFG max-tailsum3.bpl [2023-10-12 17:37:04,069 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:37:04,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 110 flow [2023-10-12 17:37:04,114 INFO L124 PetriNetUnfolderBase]: 3/37 cut-off events. [2023-10-12 17:37:04,115 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:37:04,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 3/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2023-10-12 17:37:04,119 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 43 transitions, 110 flow [2023-10-12 17:37:04,123 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 37 transitions, 92 flow [2023-10-12 17:37:04,126 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:37:04,138 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 37 transitions, 92 flow [2023-10-12 17:37:04,140 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 37 transitions, 92 flow [2023-10-12 17:37:04,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 37 transitions, 92 flow [2023-10-12 17:37:04,151 INFO L124 PetriNetUnfolderBase]: 3/37 cut-off events. [2023-10-12 17:37:04,151 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:37:04,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 37 events. 3/37 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2023-10-12 17:37:04,153 INFO L119 LiptonReduction]: Number of co-enabled transitions 594 [2023-10-12 17:37:04,538 INFO L134 LiptonReduction]: Checked pairs total: 452 [2023-10-12 17:37:04,538 INFO L136 LiptonReduction]: Total number of compositions: 19 [2023-10-12 17:37:04,550 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:37:04,550 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:37:04,550 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:37:04,550 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:37:04,550 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:37:04,550 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:37:04,550 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:37:04,550 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == RabinPetriNetCegarLoop ======== [2023-10-12 17:37:04,551 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:37:04,554 ERROR L47 etriNetUnfolderRabin]: [1:1A:[39] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k2_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[][6], 2:2A:[71] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo][0], 4:3A:[97] $Ultimate##0-->L31-1: Formula: (and (= v_sumThread1of1ForFork0_i_27 v_sumThread1of1ForFork0_lo_5) (= 0 v_sumThread1of1ForFork0_x_21) (= 0 v_sumThread1of1ForFork0_z_13)) InVars {sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_5} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_21, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_13, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_27, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_5} AuxVars[] AssignedVars[sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i][16]][5:4A:[99] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork0_i_30 v_sumThread1of1ForFork0_hi_11) (= (+ (select v_A_19 v_sumThread1of1ForFork0_i_30) v_sumThread1of1ForFork0_x_24) v_sumThread1of1ForFork0_x_23) (= (+ v_sumThread1of1ForFork0_i_30 1) v_sumThread1of1ForFork0_i_29) (= (let ((.cse0 (+ (select v_A_19 v_sumThread1of1ForFork0_i_29) v_sumThread1of1ForFork0_z_16))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork0_z_15)) InVars {A=v_A_19, sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_11, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_24, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_16, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_30} OutVars{A=v_A_19, sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_11, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_23, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_15, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_29} AuxVars[] AssignedVars[sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i][17]] [2023-10-12 17:37:04,556 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:04,556 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:37:04,556 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:04,556 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:04,559 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:37:04,559 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 25 places, 18 transitions, 54 flow [2023-10-12 17:37:04,560 ERROR L47 etriNetUnfolderRabin]: [1:1A:[39] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k2_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[][6], 2:2A:[71] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo][0], 4:3A:[97] $Ultimate##0-->L31-1: Formula: (and (= v_sumThread1of1ForFork0_i_27 v_sumThread1of1ForFork0_lo_5) (= 0 v_sumThread1of1ForFork0_x_21) (= 0 v_sumThread1of1ForFork0_z_13)) InVars {sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_5} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_21, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_13, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_27, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_5} AuxVars[] AssignedVars[sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i][16]][5:4A:[99] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork0_i_30 v_sumThread1of1ForFork0_hi_11) (= (+ (select v_A_19 v_sumThread1of1ForFork0_i_30) v_sumThread1of1ForFork0_x_24) v_sumThread1of1ForFork0_x_23) (= (+ v_sumThread1of1ForFork0_i_30 1) v_sumThread1of1ForFork0_i_29) (= (let ((.cse0 (+ (select v_A_19 v_sumThread1of1ForFork0_i_29) v_sumThread1of1ForFork0_z_16))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork0_z_15)) InVars {A=v_A_19, sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_11, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_24, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_16, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_30} OutVars{A=v_A_19, sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_11, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_23, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_15, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_29} AuxVars[] AssignedVars[sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i][17]] [2023-10-12 17:37:04,561 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:04,561 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2023-10-12 17:37:04,561 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:37:04,561 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:04,565 INFO L748 eck$LassoCheckResult]: Stem: 51#[$Ultimate##0]true [39] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k2_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 53#[L54]true [71] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo] 55#[L54-1, $Ultimate##0]true [97] $Ultimate##0-->L31-1: Formula: (and (= v_sumThread1of1ForFork0_i_27 v_sumThread1of1ForFork0_lo_5) (= 0 v_sumThread1of1ForFork0_x_21) (= 0 v_sumThread1of1ForFork0_z_13)) InVars {sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_5} OutVars{sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_21, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_13, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_27, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_5} AuxVars[] AssignedVars[sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i] 57#[L54-1, L31-1]true [2023-10-12 17:37:04,565 INFO L750 eck$LassoCheckResult]: Loop: 57#[L54-1, L31-1]true [99] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork0_i_30 v_sumThread1of1ForFork0_hi_11) (= (+ (select v_A_19 v_sumThread1of1ForFork0_i_30) v_sumThread1of1ForFork0_x_24) v_sumThread1of1ForFork0_x_23) (= (+ v_sumThread1of1ForFork0_i_30 1) v_sumThread1of1ForFork0_i_29) (= (let ((.cse0 (+ (select v_A_19 v_sumThread1of1ForFork0_i_29) v_sumThread1of1ForFork0_z_16))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork0_z_15)) InVars {A=v_A_19, sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_11, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_24, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_16, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_30} OutVars{A=v_A_19, sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_11, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_23, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_15, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_29} AuxVars[] AssignedVars[sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i] 57#[L54-1, L31-1]true [2023-10-12 17:37:04,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:04,570 INFO L85 PathProgramCache]: Analyzing trace with hash 69568, now seen corresponding path program 1 times [2023-10-12 17:37:04,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:04,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709565827] [2023-10-12 17:37:04,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:04,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,641 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:04,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:04,662 INFO L85 PathProgramCache]: Analyzing trace with hash 130, now seen corresponding path program 1 times [2023-10-12 17:37:04,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:04,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570882829] [2023-10-12 17:37:04,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:04,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:04,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:04,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:04,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:04,686 INFO L85 PathProgramCache]: Analyzing trace with hash 2156707, now seen corresponding path program 1 times [2023-10-12 17:37:04,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:04,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045862274] [2023-10-12 17:37:04,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:04,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:04,707 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:04,876 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:04,876 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:04,877 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:04,877 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:04,877 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:04,877 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:04,877 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:04,877 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:04,877 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum3.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:37:04,877 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:04,878 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:04,907 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:37:04,924 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:37:04,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:37:05,119 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:05,122 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:05,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:05,129 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:37:05,143 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:37:05,144 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:37:05,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:05,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:05,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:05,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:05,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:05,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:05,177 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:05,181 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:37:05,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:05,183 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:37:05,191 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:37:05,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:05,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:05,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:05,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:05,203 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:05,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:05,209 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:37:05,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:05,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2023-10-12 17:37:05,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:05,219 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:37:05,232 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:37:05,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:05,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:05,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:05,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:05,245 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:37:05,250 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:05,251 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:05,269 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:05,281 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2023-10-12 17:37:05,281 INFO L444 ModelExtractionUtils]: 6 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. [2023-10-12 17:37:05,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:05,289 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:37:05,297 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:37:05,298 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:05,311 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:05,311 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:05,312 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:37:05,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:05,318 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:05,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:05,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:05,350 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:05,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:05,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:05,369 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:37:05,403 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:37:05,521 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:37:05,525 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:37:05,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2023-10-12 17:37:05,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 180 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:37:05,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:05,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 180 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:05,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:05,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 180 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:37:05,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:05,535 INFO L430 stractBuchiCegarLoop]: Abstraction has has 29 places, 72 transitions, 360 flow [2023-10-12 17:37:05,535 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:37:05,535 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 29 places, 72 transitions, 360 flow [2023-10-12 17:37:05,540 ERROR L47 etriNetUnfolderRabin]: [1:1A:[39] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k2_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[][24], 2:2A:[71] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo][0], 3:3A:[74] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo][16], 7:4A:[96] $Ultimate##0-->L31-1: Formula: (and (= v_sumThread1of1ForFork1_lo_5 v_sumThread1of1ForFork1_i_29) (= 0 v_sumThread1of1ForFork1_z_21) (= 0 v_sumThread1of1ForFork1_x_21)) InVars {sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_5} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_21, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_29, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_21, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_5} AuxVars[] AssignedVars[sumThread1of1ForFork1_z, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x][48]][9:5A:[95] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork1_i_26 v_sumThread1of1ForFork1_hi_11) (= (+ (select v_A_15 v_sumThread1of1ForFork1_i_26) v_sumThread1of1ForFork1_x_18) v_sumThread1of1ForFork1_x_17) (= (+ v_sumThread1of1ForFork1_i_26 1) v_sumThread1of1ForFork1_i_25) (= (let ((.cse0 (+ (select v_A_15 v_sumThread1of1ForFork1_i_25) v_sumThread1of1ForFork1_z_18))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork1_z_17)) InVars {A=v_A_15, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_11, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_18, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_26, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_18} OutVars{A=v_A_15, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_11, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_17, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_25, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_17} AuxVars[] AssignedVars[sumThread1of1ForFork1_z, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x][52]] [2023-10-12 17:37:05,541 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:05,542 INFO L124 PetriNetUnfolderBase]: 2/8 cut-off events. [2023-10-12 17:37:05,543 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-10-12 17:37:05,545 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:05,546 INFO L748 eck$LassoCheckResult]: Stem: 51#[$Ultimate##0]true [39] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k2_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 53#[L54]true [71] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo] 55#[L54-1, $Ultimate##0]true [74] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo] 97#[$Ultimate##0, $Ultimate##0, L55]true [96] $Ultimate##0-->L31-1: Formula: (and (= v_sumThread1of1ForFork1_lo_5 v_sumThread1of1ForFork1_i_29) (= 0 v_sumThread1of1ForFork1_z_21) (= 0 v_sumThread1of1ForFork1_x_21)) InVars {sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_5} OutVars{sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_21, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_29, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_21, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_5} AuxVars[] AssignedVars[sumThread1of1ForFork1_z, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x] 99#[L31-1, $Ultimate##0, L55]true [2023-10-12 17:37:05,550 INFO L750 eck$LassoCheckResult]: Loop: 99#[L31-1, $Ultimate##0, L55]true [95] L31-1-->L31-1: Formula: (and (< v_sumThread1of1ForFork1_i_26 v_sumThread1of1ForFork1_hi_11) (= (+ (select v_A_15 v_sumThread1of1ForFork1_i_26) v_sumThread1of1ForFork1_x_18) v_sumThread1of1ForFork1_x_17) (= (+ v_sumThread1of1ForFork1_i_26 1) v_sumThread1of1ForFork1_i_25) (= (let ((.cse0 (+ (select v_A_15 v_sumThread1of1ForFork1_i_25) v_sumThread1of1ForFork1_z_18))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork1_z_17)) InVars {A=v_A_15, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_11, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_18, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_26, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_18} OutVars{A=v_A_15, sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_11, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_17, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_25, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_17} AuxVars[] AssignedVars[sumThread1of1ForFork1_z, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x] 99#[L31-1, $Ultimate##0, L55]true [2023-10-12 17:37:05,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:05,551 INFO L85 PathProgramCache]: Analyzing trace with hash 2155991, now seen corresponding path program 1 times [2023-10-12 17:37:05,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:05,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885700239] [2023-10-12 17:37:05,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:05,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,566 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:05,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:05,578 INFO L85 PathProgramCache]: Analyzing trace with hash 126, now seen corresponding path program 1 times [2023-10-12 17:37:05,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:05,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032399011] [2023-10-12 17:37:05,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:05,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:05,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:05,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:05,610 INFO L85 PathProgramCache]: Analyzing trace with hash 66835816, now seen corresponding path program 1 times [2023-10-12 17:37:05,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:05,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681394768] [2023-10-12 17:37:05,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:05,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:05,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:05,820 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:05,820 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:05,820 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:05,820 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:05,820 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:05,821 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:05,821 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:05,821 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:05,821 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum3.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:37:05,821 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:05,821 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:05,826 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:37:05,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:37:05,831 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:37:05,835 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:37:05,838 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:37:05,841 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:37:05,843 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:37:05,845 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:37:06,069 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:06,070 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:06,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:06,073 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:37:06,105 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:37:06,106 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:37:06,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:06,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:06,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:06,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:06,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:06,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:06,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:06,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:06,130 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:37:06,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:06,131 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:37:06,138 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:37:06,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:06,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:06,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:06,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:06,146 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:37:06,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:06,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:06,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:06,169 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:37:06,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:06,171 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:37:06,174 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:37:06,175 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:37:06,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:06,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:06,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:06,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:06,186 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:06,186 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:06,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:06,216 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:37:06,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:06,218 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:37:06,232 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:37:06,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:06,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:06,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:06,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:06,243 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:06,243 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:06,246 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:37:06,261 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:06,266 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:37:06,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:06,267 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:37:06,268 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:37:06,272 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:37:06,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:06,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:06,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:06,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:06,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:06,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:06,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:06,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:06,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:06,315 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:37:06,321 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:37:06,365 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:37:06,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:06,373 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:06,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:06,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:06,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:06,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:06,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:06,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:06,389 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:37:06,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:06,391 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:37:06,391 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:37:06,395 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:37:06,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:06,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:06,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:06,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:06,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:06,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:06,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:06,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:06,410 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:37:06,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:06,412 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:37:06,414 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:37:06,415 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:37:06,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:06,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:06,422 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:37:06,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:06,431 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:37:06,432 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:37:06,454 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:06,460 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:37:06,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:06,462 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:37:06,465 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:37:06,466 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:37:06,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:06,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:06,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:06,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:06,480 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:06,480 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:06,492 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:06,510 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-10-12 17:37:06,510 INFO L444 ModelExtractionUtils]: 7 out of 25 variables were initially zero. Simplification set additionally 15 variables to zero. [2023-10-12 17:37:06,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:06,656 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:37:06,658 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:37:06,660 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:06,667 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:06,667 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:06,667 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:37:06,673 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:37:06,674 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:06,686 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:06,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:06,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:06,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:06,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:06,715 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:37:06,715 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:37:06,798 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:37:06,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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:37:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2023-10-12 17:37:06,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 180 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:37:06,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:06,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 180 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:06,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:06,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 180 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:37:06,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:06,800 INFO L430 stractBuchiCegarLoop]: Abstraction has has 33 places, 288 transitions, 2016 flow [2023-10-12 17:37:06,800 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:37:06,801 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 33 places, 288 transitions, 2016 flow [2023-10-12 17:37:06,807 ERROR L47 etriNetUnfolderRabin]: [1:1A:[39] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k2_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[][99], 2:2A:[71] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo][3], 3:3A:[74] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo][67], 6:4A:[77] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2) (= v_N_3 v_sumThread1of1ForFork2_hi_6) (= v_sumThread1of1ForFork2_lo_4 (+ v_ULTIMATE.start_k2_5 1))) InVars {N=v_N_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, N=v_N_3, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_8, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_16, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_8, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_4, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x, sumThread1of1ForFork2_lo, sumThread1of1ForFork2_hi][83], 25:5A:[94] $Ultimate##0-->L31-1: Formula: (and (= 0 v_sumThread1of1ForFork2_z_17) (= 0 v_sumThread1of1ForFork2_x_15) (= v_sumThread1of1ForFork2_i_27 v_sumThread1of1ForFork2_lo_7)) InVars {sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_7} OutVars{sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_17, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_27, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_15, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_7} AuxVars[] AssignedVars[sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x][243]][26:6A:[98] L31-1-->L31-1: Formula: (and (= (let ((.cse0 (+ (select v_A_17 v_sumThread1of1ForFork2_i_29) v_sumThread1of1ForFork2_z_20))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork2_z_19) (= (+ 1 v_sumThread1of1ForFork2_i_30) v_sumThread1of1ForFork2_i_29) (= (+ v_sumThread1of1ForFork2_x_18 (select v_A_17 v_sumThread1of1ForFork2_i_30)) v_sumThread1of1ForFork2_x_17) (< v_sumThread1of1ForFork2_i_30 v_sumThread1of1ForFork2_hi_11)) InVars {A=v_A_17, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_20, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_30, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_18, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_11} OutVars{A=v_A_17, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_19, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_29, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_17, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_11} AuxVars[] AssignedVars[sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x][227]] [2023-10-12 17:37:06,807 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:37:06,807 INFO L124 PetriNetUnfolderBase]: 13/25 cut-off events. [2023-10-12 17:37:06,807 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:37:06,807 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is not empty [2023-10-12 17:37:06,808 INFO L748 eck$LassoCheckResult]: Stem: 51#[$Ultimate##0]true [39] $Ultimate##0-->L54: Formula: (and (<= v_ULTIMATE.start_k1_1 v_ULTIMATE.start_k2_1) (<= v_ULTIMATE.start_k2_1 v_N_1) (<= 0 v_ULTIMATE.start_k1_1)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} OutVars{ULTIMATE.start_k2=v_ULTIMATE.start_k2_1, ULTIMATE.start_k1=v_ULTIMATE.start_k1_1, N=v_N_1} AuxVars[] AssignedVars[] 53#[L54]true [71] L54-->$Ultimate##0: Formula: (and (= 0 v_sumThread1of1ForFork0_lo_4) (= v_ULTIMATE.start_k1_3 v_sumThread1of1ForFork0_hi_6) (= v_sumThread1of1ForFork0_thidvar0_2 1)) InVars {ULTIMATE.start_k1=v_ULTIMATE.start_k1_3} OutVars{sumThread1of1ForFork0_hi=v_sumThread1of1ForFork0_hi_6, sumThread1of1ForFork0_x=v_sumThread1of1ForFork0_x_8, sumThread1of1ForFork0_z=v_sumThread1of1ForFork0_z_8, ULTIMATE.start_k1=v_ULTIMATE.start_k1_3, sumThread1of1ForFork0_i=v_sumThread1of1ForFork0_i_16, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2, sumThread1of1ForFork0_lo=v_sumThread1of1ForFork0_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork0_hi, sumThread1of1ForFork0_x, sumThread1of1ForFork0_z, sumThread1of1ForFork0_i, sumThread1of1ForFork0_thidvar0, sumThread1of1ForFork0_lo] 55#[L54-1, $Ultimate##0]true [74] L54-1-->$Ultimate##0: Formula: (and (= (+ v_ULTIMATE.start_k1_5 1) v_sumThread1of1ForFork1_lo_4) (= v_ULTIMATE.start_k2_3 v_sumThread1of1ForFork1_hi_6) (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5} OutVars{sumThread1of1ForFork1_hi=v_sumThread1of1ForFork1_hi_6, sumThread1of1ForFork1_z=v_sumThread1of1ForFork1_z_8, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2, ULTIMATE.start_k2=v_ULTIMATE.start_k2_3, sumThread1of1ForFork1_i=v_sumThread1of1ForFork1_i_16, ULTIMATE.start_k1=v_ULTIMATE.start_k1_5, sumThread1of1ForFork1_x=v_sumThread1of1ForFork1_x_8, sumThread1of1ForFork1_lo=v_sumThread1of1ForFork1_lo_4} AuxVars[] AssignedVars[sumThread1of1ForFork1_hi, sumThread1of1ForFork1_z, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_thidvar1, sumThread1of1ForFork1_i, sumThread1of1ForFork1_x, sumThread1of1ForFork1_lo] 97#[$Ultimate##0, $Ultimate##0, L55]true [77] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2) (= v_N_3 v_sumThread1of1ForFork2_hi_6) (= v_sumThread1of1ForFork2_lo_4 (+ v_ULTIMATE.start_k2_5 1))) InVars {N=v_N_3, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, N=v_N_3, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_8, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_16, ULTIMATE.start_k2=v_ULTIMATE.start_k2_5, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_8, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_4, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_6} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x, sumThread1of1ForFork2_lo, sumThread1of1ForFork2_hi] 137#[L56, $Ultimate##0, $Ultimate##0, $Ultimate##0]true [94] $Ultimate##0-->L31-1: Formula: (and (= 0 v_sumThread1of1ForFork2_z_17) (= 0 v_sumThread1of1ForFork2_x_15) (= v_sumThread1of1ForFork2_i_27 v_sumThread1of1ForFork2_lo_7)) InVars {sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_7} OutVars{sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_17, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_27, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_15, sumThread1of1ForFork2_lo=v_sumThread1of1ForFork2_lo_7} AuxVars[] AssignedVars[sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x] 139#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [2023-10-12 17:37:06,808 INFO L750 eck$LassoCheckResult]: Loop: 139#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [98] L31-1-->L31-1: Formula: (and (= (let ((.cse0 (+ (select v_A_17 v_sumThread1of1ForFork2_i_29) v_sumThread1of1ForFork2_z_20))) (ite (< 0 .cse0) .cse0 0)) v_sumThread1of1ForFork2_z_19) (= (+ 1 v_sumThread1of1ForFork2_i_30) v_sumThread1of1ForFork2_i_29) (= (+ v_sumThread1of1ForFork2_x_18 (select v_A_17 v_sumThread1of1ForFork2_i_30)) v_sumThread1of1ForFork2_x_17) (< v_sumThread1of1ForFork2_i_30 v_sumThread1of1ForFork2_hi_11)) InVars {A=v_A_17, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_20, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_30, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_18, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_11} OutVars{A=v_A_17, sumThread1of1ForFork2_z=v_sumThread1of1ForFork2_z_19, sumThread1of1ForFork2_i=v_sumThread1of1ForFork2_i_29, sumThread1of1ForFork2_x=v_sumThread1of1ForFork2_x_17, sumThread1of1ForFork2_hi=v_sumThread1of1ForFork2_hi_11} AuxVars[] AssignedVars[sumThread1of1ForFork2_z, sumThread1of1ForFork2_i, sumThread1of1ForFork2_x] 139#[L56, $Ultimate##0, $Ultimate##0, L31-1]true [2023-10-12 17:37:06,808 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:06,809 INFO L85 PathProgramCache]: Analyzing trace with hash 66835226, now seen corresponding path program 1 times [2023-10-12 17:37:06,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:06,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575720249] [2023-10-12 17:37:06,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:06,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:06,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:06,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:06,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:06,821 INFO L85 PathProgramCache]: Analyzing trace with hash 129, now seen corresponding path program 1 times [2023-10-12 17:37:06,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:06,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325844934] [2023-10-12 17:37:06,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:06,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:06,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:06,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:06,833 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:06,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2071892104, now seen corresponding path program 1 times [2023-10-12 17:37:06,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:37:06,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369159283] [2023-10-12 17:37:06,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:37:06,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:37:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:06,840 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:37:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:37:06,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:37:06,998 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:37:06,998 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:37:06,998 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:37:06,999 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:37:06,999 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:37:06,999 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:06,999 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:37:06,999 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:37:06,999 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-tailsum3.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:37:06,999 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:37:06,999 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:37:07,001 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:37:07,003 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:37:07,005 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:37:07,007 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:37:07,010 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:37:07,012 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:37:07,014 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:37:07,016 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:37:07,018 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:37:07,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:37:07,069 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:37:07,072 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:37:07,074 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:37:07,081 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:37:07,285 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:37:07,285 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:37:07,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,289 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:37:07,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:37:07,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:07,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,309 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:37:07,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:07,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:07,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,338 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:37:07,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,340 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:37:07,343 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:37:07,344 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:37:07,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:07,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:07,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:07,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,369 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:37:07,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,371 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:37:07,381 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:37:07,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,388 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:37:07,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:07,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:07,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:07,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,414 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:37:07,417 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:37:07,418 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:37:07,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:07,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:07,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,452 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:37:07,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,454 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:37:07,463 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:37:07,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:07,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:07,475 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:37:07,489 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,495 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:37:07,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,497 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:37:07,504 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:37:07,504 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:37:07,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:07,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:07,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,532 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:37:07,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,534 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:37:07,534 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:37:07,541 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:37:07,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,548 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:07,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:07,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,578 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:37:07,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,579 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:37:07,580 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:37:07,584 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:37:07,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-10-12 17:37:07,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-10-12 17:37:07,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-10-12 17:37:07,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:37:07,600 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:37:07,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,602 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:37:07,602 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:37:07,605 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:37:07,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:37:07,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:37:07,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:37:07,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:37:07,626 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:37:07,626 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:37:07,640 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:37:07,649 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:37:07,651 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:37:07,651 INFO L444 ModelExtractionUtils]: 24 out of 31 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:37:07,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:37:07,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:37:07,653 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:37:07,659 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:37:07,665 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:37:07,673 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:37:07,686 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:37:07,686 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:37:07,686 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:37:07,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:37:07,691 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:37:07,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:37:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:07,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:37:07,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:37:07,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:37:07,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:37:07,727 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:37:07,727 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:37:07,820 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:37:07,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 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:37:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 178 transitions. [2023-10-12 17:37:07,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 178 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:37:07,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:07,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 178 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:37:07,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:07,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 178 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:37:07,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:37:07,823 INFO L430 stractBuchiCegarLoop]: Abstraction has has 37 places, 1152 transitions, 10368 flow [2023-10-12 17:37:07,823 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:37:07,823 INFO L67 RabinIsEmpty]: Start rabinIsEmpty. Operand has 37 places, 1152 transitions, 10368 flow [2023-10-12 17:37:07,880 INFO L124 PetriNetUnfolderBase]: 193/282 cut-off events. [2023-10-12 17:37:07,880 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-10-12 17:37:07,880 INFO L72 RabinIsEmpty]: Finished rabinIsEmpty language is empty [2023-10-12 17:37:07,885 INFO L201 PluginConnector]: Adding new model max-tailsum3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:37:07 BoogieIcfgContainer [2023-10-12 17:37:07,885 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:37:07,886 INFO L158 Benchmark]: Toolchain (without parser) took 4221.06ms. Allocated memory was 206.6MB in the beginning and 292.6MB in the end (delta: 86.0MB). Free memory was 159.1MB in the beginning and 227.2MB in the end (delta: -68.1MB). Peak memory consumption was 19.5MB. Max. memory is 8.0GB. [2023-10-12 17:37:07,886 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.25ms. Allocated memory is still 206.6MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:37:07,887 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.97ms. Allocated memory is still 206.6MB. Free memory was 159.1MB in the beginning and 157.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:07,887 INFO L158 Benchmark]: Boogie Preprocessor took 20.07ms. Allocated memory is still 206.6MB. Free memory was 157.6MB in the beginning and 156.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:37:07,887 INFO L158 Benchmark]: RCFGBuilder took 205.78ms. Allocated memory is still 206.6MB. Free memory was 156.4MB in the beginning and 147.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-10-12 17:37:07,888 INFO L158 Benchmark]: BuchiAutomizer took 3966.18ms. Allocated memory was 206.6MB in the beginning and 292.6MB in the end (delta: 86.0MB). Free memory was 147.1MB in the beginning and 227.2MB in the end (delta: -80.1MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. [2023-10-12 17:37:07,889 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.25ms. Allocated memory is still 206.6MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.97ms. Allocated memory is still 206.6MB. Free memory was 159.1MB in the beginning and 157.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.07ms. Allocated memory is still 206.6MB. Free memory was 157.6MB in the beginning and 156.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 205.78ms. Allocated memory is still 206.6MB. Free memory was 156.4MB in the beginning and 147.3MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3966.18ms. Allocated memory was 206.6MB in the beginning and 292.6MB in the end (delta: 86.0MB). Free memory was 147.1MB in the beginning and 227.2MB in the end (delta: -80.1MB). Peak memory consumption was 7.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + hi and consists of 3 locations. One deterministic module has affine ranking function -1 * i + hi and consists of 3 locations. One deterministic module has affine ranking function -1 * i + hi and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 2.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 352 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 264 IncrementalHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 207 mSDtfsCounter, 264 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital86 mio100 ax100 hnf100 lsp115 ukn65 mio100 lsp55 div100 bol100 ite100 ukn100 eq176 hnf93 smp100 dnf189 smp58 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 43ms VariablesStem: 2 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 44 PlacesBefore, 25 PlacesAfterwards, 37 TransitionsBefore, 18 TransitionsAfterwards, 594 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 19 TotalNumberOfCompositions, 452 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 452, independent: 452, independent conditional: 0, independent unconditional: 452, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 364, independent: 364, independent conditional: 0, independent unconditional: 364, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 364, independent: 364, independent conditional: 0, independent unconditional: 364, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 452, independent: 88, independent conditional: 0, independent unconditional: 88, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 364, unknown conditional: 0, unknown unconditional: 364] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be correct! [2023-10-12 17:37:07,901 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:37:08,103 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...