/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-fun-alt.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:29:05,490 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:29:05,567 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:29:05,599 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:29:05,600 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:29:05,600 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:29:05,602 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:29:05,603 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:29:05,603 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:29:05,607 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:29:05,607 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:29:05,608 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:29:05,608 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:29:05,609 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:29:05,609 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:29:05,610 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:29:05,610 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:29:05,610 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:29:05,610 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:29:05,611 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:29:05,611 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:29:05,611 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:29:05,612 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:29:05,613 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:29:05,613 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:29:05,613 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:29:05,613 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:29:05,614 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:29:05,614 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:29:05,614 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:29:05,615 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:29:05,615 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:29:05,616 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:29:05,617 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:29:05,618 INFO L137 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET [2023-10-12 17:29:05,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:29:05,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:29:05,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:29:05,887 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:29:05,888 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:29:05,889 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-fun-alt.wvr.bpl [2023-10-12 17:29:05,889 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-fun-alt.wvr.bpl' [2023-10-12 17:29:05,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:29:05,919 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:29:05,920 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:29:05,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:29:05,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:29:05,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:05" (1/1) ... [2023-10-12 17:29:05,941 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:05" (1/1) ... [2023-10-12 17:29:05,947 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:29:05,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:29:05,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:29:05,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:29:05,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:29:05,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:05" (1/1) ... [2023-10-12 17:29:05,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:05" (1/1) ... [2023-10-12 17:29:05,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:05" (1/1) ... [2023-10-12 17:29:05,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:05" (1/1) ... [2023-10-12 17:29:05,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:05" (1/1) ... [2023-10-12 17:29:05,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:05" (1/1) ... [2023-10-12 17:29:05,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:05" (1/1) ... [2023-10-12 17:29:05,968 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:05" (1/1) ... [2023-10-12 17:29:05,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:29:05,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:29:05,974 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:29:05,974 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:29:05,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:05" (1/1) ... [2023-10-12 17:29:05,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:05,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:06,011 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:29:06,025 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:29:06,056 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2023-10-12 17:29:06,056 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-10-12 17:29:06,057 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-10-12 17:29:06,057 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2023-10-12 17:29:06,057 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-10-12 17:29:06,057 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-10-12 17:29:06,057 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:29:06,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:29:06,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:29:06,058 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2023-10-12 17:29:06,058 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-10-12 17:29:06,058 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-10-12 17:29:06,059 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:29:06,102 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:29:06,104 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:29:06,206 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:29:06,222 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:29:06,222 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-10-12 17:29:06,224 INFO L201 PluginConnector]: Adding new model max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:29:06 BoogieIcfgContainer [2023-10-12 17:29:06,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:29:06,225 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:29:06,225 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:29:06,229 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:29:06,230 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:29:06,230 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:29:05" (1/2) ... [2023-10-12 17:29:06,231 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7fb7a98a and model type max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:29:06, skipping insertion in model container [2023-10-12 17:29:06,231 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:29:06,231 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:29:06" (2/2) ... [2023-10-12 17:29:06,233 INFO L332 chiAutomizerObserver]: Analyzing ICFG max-fun-alt.wvr.bpl [2023-10-12 17:29:06,300 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-10-12 17:29:06,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:29:06,346 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:29:06,346 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:29:06,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:29:06,351 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 88 flow [2023-10-12 17:29:06,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2023-10-12 17:29:06,358 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:29:06,376 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:29:06,379 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 26 transitions, 70 flow [2023-10-12 17:29:06,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 26 transitions, 70 flow [2023-10-12 17:29:06,386 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-10-12 17:29:06,386 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-10-12 17:29:06,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2023-10-12 17:29:06,387 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-10-12 17:29:06,656 INFO L134 LiptonReduction]: Checked pairs total: 106 [2023-10-12 17:29:06,657 INFO L136 LiptonReduction]: Total number of compositions: 12 [2023-10-12 17:29:06,676 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:29:06,677 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:29:06,677 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:29:06,677 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:29:06,677 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:29:06,677 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:29:06,678 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:29:06,678 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2023-10-12 17:29:06,678 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:29:06,684 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:29:06,684 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:29:06,685 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:29:06,687 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:29:06,695 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:29:06,695 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 places, 15 transitions, 48 flow [2023-10-12 17:29:06,697 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:29:06,697 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-10-12 17:29:06,697 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-10-12 17:29:06,697 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:29:06,702 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_max1_19) (= v_i_19 v_j_19) (= v_i_19 v_max2_29)) InVars {N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} OutVars{N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [2023-10-12 17:29:06,702 INFO L750 eck$LassoCheckResult]: Loop: 44#[L22-1, L58-1]true [99] L22-1-->L22-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= v_max1_15 (let ((.cse0 (select v_A_14 v_i_16))) (ite (< v_max1_16 .cse0) .cse0 v_max1_16))) (< v_i_16 v_N_12)) InVars {A=v_A_14, N=v_N_12, i=v_i_16, max1=v_max1_16} OutVars{A=v_A_14, N=v_N_12, i=v_i_15, max1=v_max1_15} AuxVars[] AssignedVars[i, max1] 44#[L22-1, L58-1]true [2023-10-12 17:29:06,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:06,707 INFO L85 PathProgramCache]: Analyzing trace with hash 4204, now seen corresponding path program 1 times [2023-10-12 17:29:06,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:06,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332149780] [2023-10-12 17:29:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:06,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:06,814 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:06,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:06,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash 130, now seen corresponding path program 1 times [2023-10-12 17:29:06,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:06,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170214396] [2023-10-12 17:29:06,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:06,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:06,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:06,890 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:06,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:06,893 INFO L85 PathProgramCache]: Analyzing trace with hash 130423, now seen corresponding path program 1 times [2023-10-12 17:29:06,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:06,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215982615] [2023-10-12 17:29:06,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:06,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:06,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:06,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:06,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:07,102 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:29:07,103 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:29:07,103 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:29:07,103 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:29:07,103 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:29:07,103 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:07,103 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:29:07,104 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:29:07,104 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-fun-alt.wvr.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:29:07,104 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:29:07,104 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:29:07,117 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:29:07,126 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:29:07,167 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:29:07,170 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:29:07,284 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:29:07,287 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:29:07,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:07,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:07,292 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:29:07,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:29:07,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:07,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:07,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:07,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:07,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:07,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:07,324 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:29:07,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:07,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2023-10-12 17:29:07,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:07,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:07,342 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:29:07,344 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:29:07,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:29:07,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:07,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:07,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:07,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:07,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:07,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:07,390 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:29:07,406 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-10-12 17:29:07,407 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:29:07,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:07,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:07,411 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:29:07,413 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:29:07,443 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:29:07,461 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:29:07,461 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:29:07,462 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2023-10-12 17:29:07,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:07,470 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:29:07,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:07,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:29:07,506 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:07,519 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:29:07,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:07,520 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:29:07,552 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:29:07,553 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:29:07,667 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 256 transitions. [2023-10-12 17:29:07,669 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:29:07,675 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:29:07,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:29:07,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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:29:07,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:29:07,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 1 letters. [2023-10-12 17:29:07,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:07,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:29:07,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:07,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 2 letters. Loop has 2 letters. [2023-10-12 17:29:07,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:07,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:29:07,716 INFO L124 PetriNetUnfolderBase]: 135/207 cut-off events. [2023-10-12 17:29:07,716 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-10-12 17:29:07,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 207 events. 135/207 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 554 event pairs, 18 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 344. Up to 71 conditions per place. [2023-10-12 17:29:07,718 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:29:07,722 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 32 places, 172 transitions, 904 flow [2023-10-12 17:29:07,723 INFO L430 stractBuchiCegarLoop]: Abstraction has has 32 places, 172 transitions, 904 flow [2023-10-12 17:29:07,723 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:29:07,723 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 places, 172 transitions, 904 flow [2023-10-12 17:29:07,731 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:29:07,733 INFO L124 PetriNetUnfolderBase]: 29/44 cut-off events. [2023-10-12 17:29:07,736 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-10-12 17:29:07,736 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:29:07,739 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_max1_19) (= v_i_19 v_j_19) (= v_i_19 v_max2_29)) InVars {N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} OutVars{N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [84] L58-1-->L33-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 89#[L22-1, L59, L33-1]true [2023-10-12 17:29:07,739 INFO L750 eck$LassoCheckResult]: Loop: 89#[L22-1, L59, L33-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 89#[L22-1, L59, L33-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 89#[L22-1, L59, L33-1]true [2023-10-12 17:29:07,740 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:07,740 INFO L85 PathProgramCache]: Analyzing trace with hash 130408, now seen corresponding path program 1 times [2023-10-12 17:29:07,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:07,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008231067] [2023-10-12 17:29:07,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:07,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:07,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:07,753 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:07,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:07,754 INFO L85 PathProgramCache]: Analyzing trace with hash 4065, now seen corresponding path program 1 times [2023-10-12 17:29:07,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:07,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036067527] [2023-10-12 17:29:07,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:07,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:07,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:07,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:07,773 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:07,773 INFO L85 PathProgramCache]: Analyzing trace with hash 125325192, now seen corresponding path program 1 times [2023-10-12 17:29:07,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:07,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277655223] [2023-10-12 17:29:07,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:07,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:07,785 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:07,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:08,030 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:29:08,031 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:29:08,031 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:29:08,031 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:29:08,031 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:29:08,031 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:08,031 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:29:08,031 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:29:08,032 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-fun-alt.wvr.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:29:08,032 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:29:08,032 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:29:08,037 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:29:08,040 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:29:08,138 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:29:08,142 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:29:08,145 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:29:08,149 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:29:08,342 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:29:08,342 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:29:08,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:08,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:08,345 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:29:08,355 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:29:08,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:08,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:08,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:08,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:08,368 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:29:08,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:08,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:08,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:08,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-10-12 17:29:08,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:08,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:08,402 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:29:08,405 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:29:08,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:29:08,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:08,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:08,416 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:29:08,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:08,444 INFO L401 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2023-10-12 17:29:08,444 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:29:08,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:08,485 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:29:08,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:08,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:08,489 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:29:08,493 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:29:08,494 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:29:08,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:08,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:08,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:08,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:08,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:08,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:08,521 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:29:08,531 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2023-10-12 17:29:08,531 INFO L444 ModelExtractionUtils]: 6 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2023-10-12 17:29:08,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:08,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:08,541 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:29:08,545 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:29:08,554 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:29:08,570 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2023-10-12 17:29:08,570 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:29:08,570 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, j) = 1*k - 1*j Supporting invariants [-1*M + 1*k >= 0] [2023-10-12 17:29:08,574 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:29:08,580 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2023-10-12 17:29:08,602 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:08,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core [2023-10-12 17:29:08,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:08,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjunts are in the unsatisfiable core [2023-10-12 17:29:08,639 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:29:08,658 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2023-10-12 17:29:08,658 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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:29:08,961 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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) Result 10 states and 469 transitions. [2023-10-12 17:29:08,961 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:29:08,984 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:29:08,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2023-10-12 17:29:08,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 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:29:08,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 266 transitions. [2023-10-12 17:29:08,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 266 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:29:08,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:08,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 266 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:29:08,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:08,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 266 transitions. Stem has 3 letters. Loop has 4 letters. [2023-10-12 17:29:08,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:08,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 3616 transitions, 26448 flow [2023-10-12 17:29:09,133 INFO L124 PetriNetUnfolderBase]: 470/718 cut-off events. [2023-10-12 17:29:09,137 INFO L125 PetriNetUnfolderBase]: For 195/195 co-relation queries the response was YES. [2023-10-12 17:29:09,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2351 conditions, 718 events. 470/718 cut-off events. For 195/195 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2834 event pairs, 38 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 1548. Up to 250 conditions per place. [2023-10-12 17:29:09,142 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 52 places, 3616 transitions, 26448 flow [2023-10-12 17:29:09,181 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:29:09,185 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:29:09,225 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 52 places, 3616 transitions, 26448 flow [2023-10-12 17:29:09,225 INFO L430 stractBuchiCegarLoop]: Abstraction has has 52 places, 3616 transitions, 26448 flow [2023-10-12 17:29:09,225 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:29:09,225 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 52 places, 3616 transitions, 26448 flow [2023-10-12 17:29:09,273 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:29:09,273 INFO L124 PetriNetUnfolderBase]: 200/280 cut-off events. [2023-10-12 17:29:09,273 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-10-12 17:29:09,273 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:29:09,274 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_max1_19) (= v_i_19 v_j_19) (= v_i_19 v_max2_29)) InVars {N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} OutVars{N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [84] L58-1-->L33-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 89#[L22-1, L59, L33-1]true [87] L59-->L44-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 166#[L22-1, L60, L33-1, L44-1]true [99] L22-1-->L22-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= v_max1_15 (let ((.cse0 (select v_A_14 v_i_16))) (ite (< v_max1_16 .cse0) .cse0 v_max1_16))) (< v_i_16 v_N_12)) InVars {A=v_A_14, N=v_N_12, i=v_i_16, max1=v_max1_16} OutVars{A=v_A_14, N=v_N_12, i=v_i_15, max1=v_max1_15} AuxVars[] AssignedVars[i, max1] 166#[L22-1, L60, L33-1, L44-1]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= (let ((.cse0 (select v_A_10 v_k_16))) (ite (< v_max2_22 .cse0) .cse0 v_max2_22)) v_max2_21) (< v_k_16 v_N_8)) InVars {A=v_A_10, N=v_N_8, k=v_k_16, max2=v_max2_22} OutVars{A=v_A_10, N=v_N_8, k=v_k_15, max2=v_max2_21} AuxVars[] AssignedVars[k, max2] 166#[L22-1, L60, L33-1, L44-1]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= (let ((.cse0 (select v_A_10 v_k_16))) (ite (< v_max2_22 .cse0) .cse0 v_max2_22)) v_max2_21) (< v_k_16 v_N_8)) InVars {A=v_A_10, N=v_N_8, k=v_k_16, max2=v_max2_22} OutVars{A=v_A_10, N=v_N_8, k=v_k_15, max2=v_max2_21} AuxVars[] AssignedVars[k, max2] 166#[L22-1, L60, L33-1, L44-1]true [2023-10-12 17:29:09,275 INFO L750 eck$LassoCheckResult]: Loop: 166#[L22-1, L60, L33-1, L44-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 166#[L22-1, L60, L33-1, L44-1]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= (let ((.cse0 (select v_A_10 v_k_16))) (ite (< v_max2_22 .cse0) .cse0 v_max2_22)) v_max2_21) (< v_k_16 v_N_8)) InVars {A=v_A_10, N=v_N_8, k=v_k_16, max2=v_max2_22} OutVars{A=v_A_10, N=v_N_8, k=v_k_15, max2=v_max2_21} AuxVars[] AssignedVars[k, max2] 166#[L22-1, L60, L33-1, L44-1]true [2023-10-12 17:29:09,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:09,275 INFO L85 PathProgramCache]: Analyzing trace with hash 178132276, now seen corresponding path program 1 times [2023-10-12 17:29:09,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:09,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635865210] [2023-10-12 17:29:09,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:09,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:09,313 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:09,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:09,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:09,328 INFO L85 PathProgramCache]: Analyzing trace with hash 4063, now seen corresponding path program 1 times [2023-10-12 17:29:09,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:09,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948020997] [2023-10-12 17:29:09,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:09,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:09,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:09,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:09,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:09,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:09,357 INFO L85 PathProgramCache]: Analyzing trace with hash -613571502, now seen corresponding path program 1 times [2023-10-12 17:29:09,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:09,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626905227] [2023-10-12 17:29:09,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:09,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:09,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:09,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:09,825 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:29:09,825 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:29:09,825 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:29:09,825 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:29:09,825 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:29:09,825 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:09,825 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:29:09,825 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:29:09,825 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-fun-alt.wvr.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:29:09,825 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:29:09,826 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:29:09,834 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:29:09,839 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-10-12 17:29:10,102 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:29:10,104 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:29:10,106 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:29:10,111 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:29:10,114 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:29:10,116 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:29:10,303 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2023-10-12 17:29:10,840 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:29:10,841 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:29:10,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:10,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:10,849 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:29:10,858 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:29:10,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:10,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:10,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:10,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:10,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:10,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:10,871 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:29:10,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:10,893 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:29:10,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:10,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:10,895 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:29:10,897 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:29:10,903 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:29:10,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:10,910 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2023-10-12 17:29:10,910 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2023-10-12 17:29:10,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:10,967 INFO L401 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2023-10-12 17:29:10,968 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2023-10-12 17:29:11,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:11,051 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:29:11,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:11,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:11,053 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:29:11,071 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:29:11,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:11,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:11,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:11,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:11,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:11,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:11,088 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:29:11,097 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:29:11,107 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:29:11,108 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2023-10-12 17:29:11,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:11,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:11,110 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:29:11,124 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:29:11,132 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:29:11,140 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:29:11,141 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:29:11,141 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2023-10-12 17:29:11,148 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:29:11,153 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:29:11,163 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:11,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:29:11,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:11,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:29:11,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:11,190 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:29:11,190 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:29:11,190 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:29:11,251 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 5 states and 256 transitions. [2023-10-12 17:29:11,251 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:29:11,522 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:29:11,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:29:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:29:11,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2023-10-12 17:29:11,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 7 letters. Loop has 2 letters. [2023-10-12 17:29:11,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:11,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 9 letters. Loop has 2 letters. [2023-10-12 17:29:11,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:11,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 176 transitions. Stem has 7 letters. Loop has 4 letters. [2023-10-12 17:29:11,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:11,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 42016 transitions, 393152 flow [2023-10-12 17:29:11,864 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:29:13,561 INFO L124 PetriNetUnfolderBase]: 825/1213 cut-off events. [2023-10-12 17:29:13,561 INFO L125 PetriNetUnfolderBase]: For 324/324 co-relation queries the response was YES. [2023-10-12 17:29:13,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5128 conditions, 1213 events. 825/1213 cut-off events. For 324/324 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5025 event pairs, 30 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 3192. Up to 475 conditions per place. [2023-10-12 17:29:13,563 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 62 places, 42016 transitions, 393152 flow [2023-10-12 17:29:13,945 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 62 places, 42016 transitions, 393152 flow [2023-10-12 17:29:13,945 INFO L430 stractBuchiCegarLoop]: Abstraction has has 62 places, 42016 transitions, 393152 flow [2023-10-12 17:29:13,945 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:29:13,946 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 62 places, 42016 transitions, 393152 flow [2023-10-12 17:29:14,817 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:29:14,817 INFO L124 PetriNetUnfolderBase]: 328/464 cut-off events. [2023-10-12 17:29:14,817 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2023-10-12 17:29:14,817 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:29:14,818 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_max1_19) (= v_i_19 v_j_19) (= v_i_19 v_max2_29)) InVars {N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} OutVars{N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [84] L58-1-->L33-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 89#[L22-1, L59, L33-1]true [99] L22-1-->L22-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= v_max1_15 (let ((.cse0 (select v_A_14 v_i_16))) (ite (< v_max1_16 .cse0) .cse0 v_max1_16))) (< v_i_16 v_N_12)) InVars {A=v_A_14, N=v_N_12, i=v_i_16, max1=v_max1_16} OutVars{A=v_A_14, N=v_N_12, i=v_i_15, max1=v_max1_15} AuxVars[] AssignedVars[i, max1] 89#[L22-1, L59, L33-1]true [87] L59-->L44-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 166#[L22-1, L60, L33-1, L44-1]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= (let ((.cse0 (select v_A_10 v_k_16))) (ite (< v_max2_22 .cse0) .cse0 v_max2_22)) v_max2_21) (< v_k_16 v_N_8)) InVars {A=v_A_10, N=v_N_8, k=v_k_16, max2=v_max2_22} OutVars{A=v_A_10, N=v_N_8, k=v_k_15, max2=v_max2_21} AuxVars[] AssignedVars[k, max2] 166#[L22-1, L60, L33-1, L44-1]true [98] L22-1-->thread1EXIT: Formula: (<= v_N_10 v_i_13) InVars {N=v_N_10, i=v_i_13} OutVars{N=v_N_10, i=v_i_13} AuxVars[] AssignedVars[] 244#[L60, L33-1, L44-1, thread1EXIT]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 244#[L60, L33-1, L44-1, thread1EXIT]true [2023-10-12 17:29:14,818 INFO L750 eck$LassoCheckResult]: Loop: 244#[L60, L33-1, L44-1, thread1EXIT]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 244#[L60, L33-1, L44-1, thread1EXIT]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 244#[L60, L33-1, L44-1, thread1EXIT]true [2023-10-12 17:29:14,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:14,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1237858210, now seen corresponding path program 1 times [2023-10-12 17:29:14,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:14,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194671438] [2023-10-12 17:29:14,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:14,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:14,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:29:14,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-10-12 17:29:14,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194671438] [2023-10-12 17:29:14,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194671438] provided 0 perfect and 1 imperfect interpolant sequences [2023-10-12 17:29:14,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755273058] [2023-10-12 17:29:14,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:14,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-10-12 17:29:14,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:14,909 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-10-12 17:29:14,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-10-12 17:29:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:14,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:29:14,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:15,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:29:15,000 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-10-12 17:29:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:29:15,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755273058] provided 0 perfect and 2 imperfect interpolant sequences [2023-10-12 17:29:15,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-10-12 17:29:15,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-10-12 17:29:15,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538945220] [2023-10-12 17:29:15,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-10-12 17:29:15,051 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-10-12 17:29:15,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:15,052 INFO L85 PathProgramCache]: Analyzing trace with hash 4065, now seen corresponding path program 2 times [2023-10-12 17:29:15,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:15,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709771974] [2023-10-12 17:29:15,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:15,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:15,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:15,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:15,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:15,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-10-12 17:29:15,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-10-12 17:29:15,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-10-12 17:29:15,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42016 transitions, 393152 flow. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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:29:15,156 INFO L124 encePairwiseOnDemand]: Subtrahend is not yet constructed. Will not use universal subtrahend loopers optimization. [2023-10-12 17:29:15,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-10-12 17:29:27,157 INFO L124 PetriNetUnfolderBase]: 2213/3571 cut-off events. [2023-10-12 17:29:27,157 INFO L125 PetriNetUnfolderBase]: For 1177/1177 co-relation queries the response was YES. [2023-10-12 17:29:27,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18761 conditions, 3571 events. 2213/3571 cut-off events. For 1177/1177 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 20781 event pairs, 42 based on Foata normal form. 0/2242 useless extension candidates. Maximal degree in co-relation 12021. Up to 1395 conditions per place. [2023-10-12 17:29:27,182 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 867 selfloop transitions, 277 changer transitions 516/1660 dead transitions. [2023-10-12 17:29:27,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 1660 transitions, 17959 flow [2023-10-12 17:29:27,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 1660 transitions, 17959 flow [2023-10-12 17:29:27,611 INFO L124 PetriNetUnfolderBase]: 2213/3571 cut-off events. [2023-10-12 17:29:27,611 INFO L125 PetriNetUnfolderBase]: For 1177/1177 co-relation queries the response was YES. [2023-10-12 17:29:27,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18761 conditions, 3571 events. 2213/3571 cut-off events. For 1177/1177 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 20783 event pairs, 42 based on Foata normal form. 0/2242 useless extension candidates. Maximal degree in co-relation 12021. Up to 1395 conditions per place. [2023-10-12 17:29:27,615 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 56 places, 1660 transitions, 17959 flow [2023-10-12 17:29:27,633 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 56 places, 1660 transitions, 17959 flow [2023-10-12 17:29:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-10-12 17:29:27,635 INFO L430 stractBuchiCegarLoop]: Abstraction has has 56 places, 1660 transitions, 17959 flow [2023-10-12 17:29:27,636 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:29:27,636 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 56 places, 1660 transitions, 17959 flow [2023-10-12 17:29:27,770 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-10-12 17:29:27,770 INFO L124 PetriNetUnfolderBase]: 619/935 cut-off events. [2023-10-12 17:29:27,770 INFO L125 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2023-10-12 17:29:27,770 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2023-10-12 17:29:27,771 INFO L748 eck$LassoCheckResult]: Stem: 40#[$Ultimate##0]true [102] $Ultimate##0-->L58: Formula: (and (= v_M_14 v_k_19) (< v_M_14 v_N_16) (= v_i_19 0) (<= 0 v_M_14) (= v_i_19 v_max1_19) (= v_i_19 v_j_19) (= v_i_19 v_max2_29)) InVars {N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} OutVars{N=v_N_16, M=v_M_14, k=v_k_19, j=v_j_19, i=v_i_19, max1=v_max1_19, max2=v_max2_29} AuxVars[] AssignedVars[] 42#[L58]true [81] L58-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0] 44#[L22-1, L58-1]true [84] L58-1-->L33-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 89#[L22-1, L59, L33-1]true [99] L22-1-->L22-1: Formula: (and (= v_i_15 (+ v_i_16 1)) (= v_max1_15 (let ((.cse0 (select v_A_14 v_i_16))) (ite (< v_max1_16 .cse0) .cse0 v_max1_16))) (< v_i_16 v_N_12)) InVars {A=v_A_14, N=v_N_12, i=v_i_16, max1=v_max1_16} OutVars{A=v_A_14, N=v_N_12, i=v_i_15, max1=v_max1_15} AuxVars[] AssignedVars[i, max1] 89#[L22-1, L59, L33-1]true [87] L59-->L44-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0] 166#[L22-1, L60, L33-1, L44-1]true [95] L44-1-->L44-1: Formula: (and (= v_k_15 (+ v_k_16 1)) (= (let ((.cse0 (select v_A_10 v_k_16))) (ite (< v_max2_22 .cse0) .cse0 v_max2_22)) v_max2_21) (< v_k_16 v_N_8)) InVars {A=v_A_10, N=v_N_8, k=v_k_16, max2=v_max2_22} OutVars{A=v_A_10, N=v_N_8, k=v_k_15, max2=v_max2_21} AuxVars[] AssignedVars[k, max2] 166#[L22-1, L60, L33-1, L44-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 166#[L22-1, L60, L33-1, L44-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 166#[L22-1, L60, L33-1, L44-1]true [2023-10-12 17:29:27,771 INFO L750 eck$LassoCheckResult]: Loop: 166#[L22-1, L60, L33-1, L44-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 166#[L22-1, L60, L33-1, L44-1]true [97] L33-1-->L33-1: Formula: (and (= v_j_15 (+ v_j_16 1)) (= (let ((.cse0 (select v_A_12 v_j_16))) (ite (< v_max2_26 .cse0) .cse0 v_max2_26)) v_max2_25) (< v_j_16 v_M_10)) InVars {A=v_A_12, M=v_M_10, j=v_j_16, max2=v_max2_26} OutVars{A=v_A_12, M=v_M_10, j=v_j_15, max2=v_max2_25} AuxVars[] AssignedVars[j, max2] 166#[L22-1, L60, L33-1, L44-1]true [2023-10-12 17:29:27,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:27,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1237858179, now seen corresponding path program 2 times [2023-10-12 17:29:27,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:27,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427114060] [2023-10-12 17:29:27,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:27,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:27,796 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:27,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:27,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:27,824 INFO L85 PathProgramCache]: Analyzing trace with hash 4065, now seen corresponding path program 3 times [2023-10-12 17:29:27,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:27,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991477770] [2023-10-12 17:29:27,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:27,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:27,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:27,833 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:27,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:27,834 INFO L85 PathProgramCache]: Analyzing trace with hash -124227869, now seen corresponding path program 3 times [2023-10-12 17:29:27,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:29:27,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377925721] [2023-10-12 17:29:27,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:29:27,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:29:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:27,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:29:27,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:29:27,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:29:28,349 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:29:28,349 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:29:28,349 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:29:28,349 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:29:28,349 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:29:28,349 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:28,349 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:29:28,349 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:29:28,349 INFO L133 ssoRankerPreferences]: Filename of dumped script: max-fun-alt.wvr.bpl_BEv2_Iteration5_Lasso [2023-10-12 17:29:28,350 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:29:28,350 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:29:28,410 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:29:33,561 WARN L223 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 505 DAG size of output: 55 (called from [L 269] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.setFormulaAndSimplify) [2023-10-12 17:29:33,665 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:29:33,668 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:29:33,670 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:29:33,672 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:29:33,675 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:29:33,677 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:29:33,679 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:29:33,809 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2023-10-12 17:29:36,906 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:29:36,906 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:29:36,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:36,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:36,932 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:29:36,933 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:29:37,048 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:29:37,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:37,056 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2023-10-12 17:29:37,056 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2023-10-12 17:29:37,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:37,132 INFO L401 nArgumentSynthesizer]: We have 104 Motzkin's Theorem applications. [2023-10-12 17:29:37,133 INFO L402 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2023-10-12 17:29:37,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:29:37,274 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:29:37,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:37,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:37,275 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:29:37,277 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:29:37,279 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:29:37,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:29:37,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:29:37,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:29:37,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:29:37,289 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:29:37,289 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:29:37,296 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:29:37,309 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2023-10-12 17:29:37,309 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2023-10-12 17:29:37,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:29:37,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:29:37,311 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:29:37,313 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:29:37,314 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:29:37,322 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:29:37,322 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:29:37,323 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2023-10-12 17:29:37,329 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:29:37,335 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2023-10-12 17:29:37,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:29:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:37,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:29:37,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:29:37,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2023-10-12 17:29:37,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:29:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-10-12 17:29:37,380 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-10-12 17:29:37,380 INFO L74 BuchiComplementNCSB]: Start buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:29:37,491 INFO L82 BuchiComplementNCSB]: Finished buchiComplementNCSB. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 7 states and 338 transitions. [2023-10-12 17:29:37,491 INFO L79 BuchiIntersect]: Starting Intersection [2023-10-12 17:29:37,626 INFO L86 BuchiIntersect]: Exiting Intersection [2023-10-12 17:29:37,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-10-12 17:29:37,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:29:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 220 transitions. [2023-10-12 17:29:37,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 8 letters. Loop has 2 letters. [2023-10-12 17:29:37,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:37,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 10 letters. Loop has 2 letters. [2023-10-12 17:29:37,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:37,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 220 transitions. Stem has 8 letters. Loop has 4 letters. [2023-10-12 17:29:37,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:29:37,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 25832 transitions, 331728 flow [2023-10-12 17:29:39,993 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:30:02,931 INFO L124 PetriNetUnfolderBase]: 5745/9190 cut-off events. [2023-10-12 17:30:02,932 INFO L125 PetriNetUnfolderBase]: For 3009/3009 co-relation queries the response was YES. [2023-10-12 17:30:02,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57383 conditions, 9190 events. 5745/9190 cut-off events. For 3009/3009 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 62022 event pairs, 67 based on Foata normal form. 0/5611 useless extension candidates. Maximal degree in co-relation 41720. Up to 3711 conditions per place. [2023-10-12 17:30:02,939 INFO L82 GeneralOperation]: Start removeDeadBuchi. Operand has 70 places, 25832 transitions, 331728 flow [2023-10-12 17:30:03,246 INFO L88 GeneralOperation]: Finished RemoveDeadBuchi, result has has 70 places, 25832 transitions, 331728 flow [2023-10-12 17:30:03,246 INFO L430 stractBuchiCegarLoop]: Abstraction has has 70 places, 25832 transitions, 331728 flow [2023-10-12 17:30:03,246 INFO L337 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-10-12 17:30:03,246 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 70 places, 25832 transitions, 331728 flow [2023-10-12 17:30:29,833 INFO L124 PetriNetUnfolderBase]: 5745/9190 cut-off events. [2023-10-12 17:30:29,834 INFO L125 PetriNetUnfolderBase]: For 3009/3009 co-relation queries the response was YES. [2023-10-12 17:30:29,834 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2023-10-12 17:30:29,838 INFO L201 PluginConnector]: Adding new model max-fun-alt.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:30:29 BoogieIcfgContainer [2023-10-12 17:30:29,838 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:30:29,839 INFO L158 Benchmark]: Toolchain (without parser) took 83920.06ms. Allocated memory was 201.3MB in the beginning and 1.1GB in the end (delta: 892.3MB). Free memory was 150.4MB in the beginning and 281.7MB in the end (delta: -131.3MB). Peak memory consumption was 925.3MB. Max. memory is 8.0GB. [2023-10-12 17:30:29,839 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:30:29,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.09ms. Allocated memory is still 201.3MB. Free memory was 150.4MB in the beginning and 148.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:30:29,840 INFO L158 Benchmark]: Boogie Preprocessor took 23.78ms. Allocated memory is still 201.3MB. Free memory was 148.9MB in the beginning and 147.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:30:29,841 INFO L158 Benchmark]: RCFGBuilder took 250.50ms. Allocated memory is still 201.3MB. Free memory was 147.8MB in the beginning and 137.7MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-10-12 17:30:29,841 INFO L158 Benchmark]: BuchiAutomizer took 83613.02ms. Allocated memory was 201.3MB in the beginning and 1.1GB in the end (delta: 892.3MB). Free memory was 137.5MB in the beginning and 281.7MB in the end (delta: -144.2MB). Peak memory consumption was 912.7MB. Max. memory is 8.0GB. [2023-10-12 17:30:29,845 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.32ms. Allocated memory is still 201.3MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.09ms. Allocated memory is still 201.3MB. Free memory was 150.4MB in the beginning and 148.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.78ms. Allocated memory is still 201.3MB. Free memory was 148.9MB in the beginning and 147.8MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 250.50ms. Allocated memory is still 201.3MB. Free memory was 147.8MB in the beginning and 137.7MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 83613.02ms. Allocated memory was 201.3MB in the beginning and 1.1GB in the end (delta: 892.3MB). Free memory was 137.5MB in the beginning and 281.7MB in the end (delta: -144.2MB). Peak memory consumption was 912.7MB. 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 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function k + -1 * j and consists of 7 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function M + -1 * j and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 83.5s and 6 iterations. TraceHistogramMax:0. Analysis of lassos took 13.4s. Construction of modules took 0.4s. Büchi inclusion checks took 13.3s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 532 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 529 mSDsluCounter, 392 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 687 IncrementalHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 211 mSDtfsCounter, 687 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital170 mio100 ax100 hnf100 lsp1526 ukn23 mio100 lsp69 div100 bol100 ite100 ukn100 eq160 hnf96 smp97 dnf2178 smp32 tf100 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 359ms VariablesStem: 9 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 104 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s - 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.3s, 33 PlacesBefore, 22 PlacesAfterwards, 26 TransitionsBefore, 15 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 2 FixpointIterations, 6 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, independent: 106, independent conditional: 0, independent unconditional: 106, 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: 82, independent: 82, independent conditional: 0, independent unconditional: 82, 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: 82, independent: 82, independent conditional: 0, independent unconditional: 82, 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: 106, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 82, unknown conditional: 0, unknown unconditional: 82] , Statistics on independence cache: Total cache size (in pairs): 18, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, 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:30:29,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:30:30,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...