/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_AUTOMATON -i ../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.fs.rabin-petrinet-4c29625-m [2023-10-12 17:12:36,335 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-10-12 17:12:36,404 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:12:36,466 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-10-12 17:12:36,467 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-10-12 17:12:36,467 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-10-12 17:12:36,469 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-10-12 17:12:36,469 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-10-12 17:12:36,470 INFO L137 SettingsManager]: * Use SBE=true [2023-10-12 17:12:36,473 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-10-12 17:12:36,473 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-10-12 17:12:36,473 INFO L137 SettingsManager]: * Use old map elimination=false [2023-10-12 17:12:36,473 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-10-12 17:12:36,474 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-10-12 17:12:36,474 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-10-12 17:12:36,474 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-10-12 17:12:36,474 INFO L137 SettingsManager]: * sizeof long=4 [2023-10-12 17:12:36,475 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-10-12 17:12:36,475 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-10-12 17:12:36,475 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-10-12 17:12:36,475 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-10-12 17:12:36,475 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-10-12 17:12:36,476 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-10-12 17:12:36,476 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-10-12 17:12:36,476 INFO L137 SettingsManager]: * sizeof long double=12 [2023-10-12 17:12:36,476 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-10-12 17:12:36,476 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-10-12 17:12:36,476 INFO L137 SettingsManager]: * Use constant arrays=true [2023-10-12 17:12:36,476 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-10-12 17:12:36,477 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-10-12 17:12:36,477 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-10-12 17:12:36,477 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-10-12 17:12:36,477 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-10-12 17:12:36,481 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-10-12 17:12:36,481 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_AUTOMATON [2023-10-12 17:12:36,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-10-12 17:12:36,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-10-12 17:12:36,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-10-12 17:12:36,842 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2023-10-12 17:12:36,842 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2023-10-12 17:12:36,843 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl [2023-10-12 17:12:36,847 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/min-max-split-sample.bpl' [2023-10-12 17:12:36,886 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-10-12 17:12:36,887 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2023-10-12 17:12:36,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:36,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-10-12 17:12:36,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-10-12 17:12:36,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:36" (1/1) ... [2023-10-12 17:12:36,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:36" (1/1) ... [2023-10-12 17:12:36,930 INFO L138 Inliner]: procedures = 6, calls = 5, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2023-10-12 17:12:36,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-10-12 17:12:36,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-10-12 17:12:36,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-10-12 17:12:36,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-10-12 17:12:36,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:36" (1/1) ... [2023-10-12 17:12:36,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:36" (1/1) ... [2023-10-12 17:12:36,957 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:36" (1/1) ... [2023-10-12 17:12:36,957 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:36" (1/1) ... [2023-10-12 17:12:36,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:36" (1/1) ... [2023-10-12 17:12:36,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:36" (1/1) ... [2023-10-12 17:12:36,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:36" (1/1) ... [2023-10-12 17:12:36,974 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:36" (1/1) ... [2023-10-12 17:12:36,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-10-12 17:12:36,981 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-10-12 17:12:36,981 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-10-12 17:12:36,981 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-10-12 17:12:36,982 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:36" (1/1) ... [2023-10-12 17:12:36,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:37,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:37,014 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:12:37,019 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:12:37,070 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin2 given in one single declaration [2023-10-12 17:12:37,071 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin2 [2023-10-12 17:12:37,073 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin2 [2023-10-12 17:12:37,073 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2023-10-12 17:12:37,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-10-12 17:12:37,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-10-12 17:12:37,074 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMin1 given in one single declaration [2023-10-12 17:12:37,075 INFO L130 BoogieDeclarations]: Found specification of procedure computeMin1 [2023-10-12 17:12:37,076 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMin1 [2023-10-12 17:12:37,076 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax2 given in one single declaration [2023-10-12 17:12:37,076 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax2 [2023-10-12 17:12:37,076 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax2 [2023-10-12 17:12:37,077 INFO L124 BoogieDeclarations]: Specification and implementation of procedure computeMax1 given in one single declaration [2023-10-12 17:12:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure computeMax1 [2023-10-12 17:12:37,077 INFO L138 BoogieDeclarations]: Found implementation of procedure computeMax1 [2023-10-12 17:12:37,077 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sample given in one single declaration [2023-10-12 17:12:37,077 INFO L130 BoogieDeclarations]: Found specification of procedure sample [2023-10-12 17:12:37,077 INFO L138 BoogieDeclarations]: Found implementation of procedure sample [2023-10-12 17:12:37,078 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:12:37,115 INFO L236 CfgBuilder]: Building ICFG [2023-10-12 17:12:37,117 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-10-12 17:12:37,226 INFO L277 CfgBuilder]: Performing block encoding [2023-10-12 17:12:37,237 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-10-12 17:12:37,238 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-10-12 17:12:37,239 INFO L201 PluginConnector]: Adding new model min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:37 BoogieIcfgContainer [2023-10-12 17:12:37,239 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-10-12 17:12:37,240 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-10-12 17:12:37,240 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-10-12 17:12:37,247 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-10-12 17:12:37,247 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:37,247 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 05:12:36" (1/2) ... [2023-10-12 17:12:37,253 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6194b873 and model type min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 05:12:37, skipping insertion in model container [2023-10-12 17:12:37,253 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-10-12 17:12:37,254 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 05:12:37" (2/2) ... [2023-10-12 17:12:37,254 INFO L332 chiAutomizerObserver]: Analyzing ICFG min-max-split-sample.bpl [2023-10-12 17:12:37,336 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-10-12 17:12:37,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 50 transitions, 137 flow [2023-10-12 17:12:37,424 INFO L124 PetriNetUnfolderBase]: 5/40 cut-off events. [2023-10-12 17:12:37,424 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:12:37,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 40 events. 5/40 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 88 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-10-12 17:12:37,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 50 transitions, 137 flow [2023-10-12 17:12:37,434 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 51 places, 40 transitions, 107 flow [2023-10-12 17:12:37,436 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-10-12 17:12:37,478 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 40 transitions, 107 flow [2023-10-12 17:12:37,480 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 107 flow [2023-10-12 17:12:37,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 107 flow [2023-10-12 17:12:37,512 INFO L124 PetriNetUnfolderBase]: 5/40 cut-off events. [2023-10-12 17:12:37,512 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-10-12 17:12:37,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 40 events. 5/40 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 88 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2023-10-12 17:12:37,513 INFO L119 LiptonReduction]: Number of co-enabled transitions 730 [2023-10-12 17:12:37,826 INFO L134 LiptonReduction]: Checked pairs total: 767 [2023-10-12 17:12:37,827 INFO L136 LiptonReduction]: Total number of compositions: 11 [2023-10-12 17:12:37,840 INFO L305 stractBuchiCegarLoop]: Interprodecural is true [2023-10-12 17:12:37,841 INFO L306 stractBuchiCegarLoop]: Hoare is false [2023-10-12 17:12:37,841 INFO L307 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-10-12 17:12:37,841 INFO L308 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-10-12 17:12:37,841 INFO L309 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-10-12 17:12:37,842 INFO L310 stractBuchiCegarLoop]: Difference is false [2023-10-12 17:12:37,843 INFO L311 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-10-12 17:12:37,844 INFO L315 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-10-12 17:12:37,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-10-12 17:12:38,018 INFO L131 ngComponentsAnalysis]: Automaton has 303 accepting balls. 672 [2023-10-12 17:12:38,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:38,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:38,023 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:12:38,023 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:38,023 INFO L337 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-10-12 17:12:38,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 736 states, but on-demand construction may add more states [2023-10-12 17:12:38,040 INFO L131 ngComponentsAnalysis]: Automaton has 303 accepting balls. 672 [2023-10-12 17:12:38,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:38,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:38,040 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-10-12 17:12:38,040 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:38,044 INFO L748 eck$LassoCheckResult]: Stem: 59#[$Ultimate##0]don't care [161] $Ultimate##0-->L100: Formula: (let ((.cse0 (select v_A_43 0))) (and (<= 0 v_k_28) (= .cse0 v_array_max_52) (= .cse0 v_array_min_50) (<= v_k_28 v_N_20))) InVars {A=v_A_43, N=v_N_20, k=v_k_28} OutVars{A=v_A_43, array_min=v_array_min_50, N=v_N_20, array_max=v_array_max_52, k=v_k_28} AuxVars[] AssignedVars[array_min, array_max] 62#[L100]don't care [140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] 64#[L100-1, $Ultimate##0]don't care [112] $Ultimate##0-->L36-1: Formula: (= v_i1_2 0) InVars {} OutVars{i1=v_i1_2} AuxVars[] AssignedVars[i1] 66#[L36-1, L100-1]don't care [2023-10-12 17:12:38,044 INFO L750 eck$LassoCheckResult]: Loop: 66#[L36-1, L100-1]don't care [155] L36-1-->L36-1: Formula: (and (= (let ((.cse0 (select v_A_23 v_i1_17))) (ite (< v_array_min_27 .cse0) v_array_min_27 .cse0)) v_array_min_26) (< v_i1_17 v_k_14) (= (+ v_i1_17 1) v_i1_16)) InVars {A=v_A_23, array_min=v_array_min_27, k=v_k_14, i1=v_i1_17} OutVars{A=v_A_23, array_min=v_array_min_26, k=v_k_14, i1=v_i1_16} AuxVars[] AssignedVars[array_min, i1] 66#[L36-1, L100-1]don't care [2023-10-12 17:12:38,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:38,048 INFO L85 PathProgramCache]: Analyzing trace with hash 188964, now seen corresponding path program 1 times [2023-10-12 17:12:38,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:38,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713292130] [2023-10-12 17:12:38,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:38,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:38,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:38,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:38,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:38,191 INFO L85 PathProgramCache]: Analyzing trace with hash 186, now seen corresponding path program 1 times [2023-10-12 17:12:38,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:38,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425561579] [2023-10-12 17:12:38,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:38,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:38,197 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:38,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:38,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash 5858039, now seen corresponding path program 1 times [2023-10-12 17:12:38,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:38,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019723113] [2023-10-12 17:12:38,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:38,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:38,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:38,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:38,326 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:38,327 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:38,327 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:38,327 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:38,327 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:38,327 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:38,328 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:38,328 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:38,328 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration1_Lasso [2023-10-12 17:12:38,328 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:38,328 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:38,340 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:12:38,347 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:12:38,476 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:38,479 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:38,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:38,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:38,482 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:12:38,508 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:12:38,508 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:12:38,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:38,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:38,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:38,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:38,520 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:38,520 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:38,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:38,540 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:12:38,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:38,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:38,542 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:12:38,544 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:12:38,546 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:12:38,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:38,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:38,552 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:12:38,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:38,565 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:12:38,565 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:12:38,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:38,613 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:12:38,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:38,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:38,614 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:12:38,616 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:12:38,618 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:12:38,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:38,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:38,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:38,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:38,627 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:38,627 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:38,644 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:38,650 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:12:38,650 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:12:38,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:38,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:38,658 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:12:38,659 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:12:38,660 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:38,679 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:38,679 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:38,679 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i1, k) = -1*i1 + 1*k Supporting invariants [] [2023-10-12 17:12:38,687 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:12:38,690 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:38,705 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:38,715 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:38,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:38,729 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:38,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:38,730 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:12:38,752 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:12:38,753 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 736 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:38,872 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 736 states, but on-demand construction may add more states. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1992 states and 11413 transitions. Complement of second has 4 states. [2023-10-12 17:12:38,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:38,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:38,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2023-10-12 17:12:38,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 3 letters. Loop has 1 letters. [2023-10-12 17:12:38,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:38,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:12:38,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:38,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 3 letters. Loop has 2 letters. [2023-10-12 17:12:38,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:38,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1992 states and 11413 transitions. [2023-10-12 17:12:38,919 INFO L131 ngComponentsAnalysis]: Automaton has 280 accepting balls. 649 [2023-10-12 17:12:38,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1992 states to 1593 states and 9210 transitions. [2023-10-12 17:12:38,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 899 [2023-10-12 17:12:39,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1246 [2023-10-12 17:12:39,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1593 states and 9210 transitions. [2023-10-12 17:12:39,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:39,007 INFO L219 hiAutomatonCegarLoop]: Abstraction has 1593 states and 9210 transitions. [2023-10-12 17:12:39,016 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:12:39,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states and 9210 transitions. [2023-10-12 17:12:39,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1248. [2023-10-12 17:12:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 1248 states have (on average 6.051282051282051) internal successors, (7552), 1247 states have internal predecessors, (7552), 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:12:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 7552 transitions. [2023-10-12 17:12:39,097 INFO L241 hiAutomatonCegarLoop]: Abstraction has 1248 states and 7552 transitions. [2023-10-12 17:12:39,097 INFO L430 stractBuchiCegarLoop]: Abstraction has 1248 states and 7552 transitions. [2023-10-12 17:12:39,097 INFO L337 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-10-12 17:12:39,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1248 states and 7552 transitions. [2023-10-12 17:12:39,106 INFO L131 ngComponentsAnalysis]: Automaton has 280 accepting balls. 649 [2023-10-12 17:12:39,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:39,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:39,107 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2023-10-12 17:12:39,107 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:39,108 INFO L748 eck$LassoCheckResult]: Stem: 5090#[$Ultimate##0]don't care [161] $Ultimate##0-->L100: Formula: (let ((.cse0 (select v_A_43 0))) (and (<= 0 v_k_28) (= .cse0 v_array_max_52) (= .cse0 v_array_min_50) (<= v_k_28 v_N_20))) InVars {A=v_A_43, N=v_N_20, k=v_k_28} OutVars{A=v_A_43, array_min=v_array_min_50, N=v_N_20, array_max=v_array_max_52, k=v_k_28} AuxVars[] AssignedVars[array_min, array_max] 5092#[L100]don't care [140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] 5228#[L100-1, $Ultimate##0]don't care [143] L100-1-->$Ultimate##0: Formula: (and (= 2 v_computeMin2Thread1of1ForFork3_thidvar0_2) (= 2 v_computeMin2Thread1of1ForFork3_thidvar1_2)) InVars {} OutVars{computeMin2Thread1of1ForFork3_thidvar0=v_computeMin2Thread1of1ForFork3_thidvar0_2, computeMin2Thread1of1ForFork3_thidvar1=v_computeMin2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[computeMin2Thread1of1ForFork3_thidvar0, computeMin2Thread1of1ForFork3_thidvar1] 5448#[$Ultimate##0, $Ultimate##0, L101]don't care [107] $Ultimate##0-->L48-1: Formula: (= v_i2_1 (+ v_k_1 1)) InVars {k=v_k_1} OutVars{i2=v_i2_1, k=v_k_1} AuxVars[] AssignedVars[i2] 5678#[$Ultimate##0, L101, L48-1]don't care [2023-10-12 17:12:39,108 INFO L750 eck$LassoCheckResult]: Loop: 5678#[$Ultimate##0, L101, L48-1]don't care [159] L48-1-->L48-1: Formula: (and (< v_i2_25 v_N_12) (= (+ v_i2_25 1) v_i2_24) (= v_array_min_32 (let ((.cse0 (select v_A_29 v_i2_25))) (ite (< v_array_min_33 .cse0) v_array_min_33 .cse0)))) InVars {A=v_A_29, array_min=v_array_min_33, N=v_N_12, i2=v_i2_25} OutVars{A=v_A_29, array_min=v_array_min_32, N=v_N_12, i2=v_i2_24} AuxVars[] AssignedVars[array_min, i2] 5678#[$Ultimate##0, L101, L48-1]don't care [2023-10-12 17:12:39,108 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:39,109 INFO L85 PathProgramCache]: Analyzing trace with hash 5858952, now seen corresponding path program 1 times [2023-10-12 17:12:39,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:39,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124965965] [2023-10-12 17:12:39,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:39,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,115 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:39,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:39,125 INFO L85 PathProgramCache]: Analyzing trace with hash 190, now seen corresponding path program 1 times [2023-10-12 17:12:39,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:39,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998531322] [2023-10-12 17:12:39,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:39,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,141 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:39,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:39,145 INFO L85 PathProgramCache]: Analyzing trace with hash 181627671, now seen corresponding path program 1 times [2023-10-12 17:12:39,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:39,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989006481] [2023-10-12 17:12:39,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:39,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:39,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:39,235 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:39,236 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:39,236 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:39,236 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:39,236 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:39,236 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,236 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:39,236 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:39,236 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration2_Lasso [2023-10-12 17:12:39,236 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:39,236 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:39,237 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:12:39,240 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:12:39,242 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:12:39,243 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:12:39,346 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:39,346 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:39,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:39,359 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:12:39,360 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:12:39,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:12:39,366 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:39,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:39,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:39,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:39,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:39,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:39,394 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:39,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2023-10-12 17:12:39,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:39,398 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:12:39,421 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:12:39,421 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:12:39,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:39,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:39,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:39,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:39,428 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:39,428 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:39,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:39,463 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:12:39,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:39,464 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:12:39,466 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:12:39,468 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:12:39,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:39,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:39,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:39,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:39,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:39,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:39,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:39,522 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:12:39,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:39,523 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:12:39,553 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:12:39,554 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:12:39,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:39,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:39,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:39,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:39,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:39,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:39,580 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:39,586 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2023-10-12 17:12:39,586 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. [2023-10-12 17:12:39,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:39,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:39,587 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:12:39,589 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:12:39,615 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:39,634 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:39,634 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:39,635 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N) = -1*i2 + 1*N Supporting invariants [] [2023-10-12 17:12:39,639 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:12:39,640 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:39,650 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:39,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:39,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:39,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:39,666 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:39,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:39,666 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:12:39,667 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:12:39,667 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1248 states and 7552 transitions. cyclomatic complexity: 6677 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:39,792 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1248 states and 7552 transitions. cyclomatic complexity: 6677. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 3762 states and 24139 transitions. Complement of second has 4 states. [2023-10-12 17:12:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2023-10-12 17:12:39,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 4 letters. Loop has 1 letters. [2023-10-12 17:12:39,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:39,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:12:39,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:39,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 4 letters. Loop has 2 letters. [2023-10-12 17:12:39,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:39,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3762 states and 24139 transitions. [2023-10-12 17:12:39,888 INFO L131 ngComponentsAnalysis]: Automaton has 243 accepting balls. 612 [2023-10-12 17:12:39,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3762 states to 3036 states and 19299 transitions. [2023-10-12 17:12:39,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1214 [2023-10-12 17:12:39,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1642 [2023-10-12 17:12:39,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3036 states and 19299 transitions. [2023-10-12 17:12:39,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:39,979 INFO L219 hiAutomatonCegarLoop]: Abstraction has 3036 states and 19299 transitions. [2023-10-12 17:12:39,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states and 19299 transitions. [2023-10-12 17:12:40,100 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:12:40,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 2326. [2023-10-12 17:12:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 2326 states have (on average 6.57609630266552) internal successors, (15296), 2325 states have internal predecessors, (15296), 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:12:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 15296 transitions. [2023-10-12 17:12:40,156 INFO L241 hiAutomatonCegarLoop]: Abstraction has 2326 states and 15296 transitions. [2023-10-12 17:12:40,156 INFO L430 stractBuchiCegarLoop]: Abstraction has 2326 states and 15296 transitions. [2023-10-12 17:12:40,156 INFO L337 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-10-12 17:12:40,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2326 states and 15296 transitions. [2023-10-12 17:12:40,179 INFO L131 ngComponentsAnalysis]: Automaton has 243 accepting balls. 612 [2023-10-12 17:12:40,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:40,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:40,179 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-10-12 17:12:40,179 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:40,180 INFO L748 eck$LassoCheckResult]: Stem: 11917#[$Ultimate##0]don't care [161] $Ultimate##0-->L100: Formula: (let ((.cse0 (select v_A_43 0))) (and (<= 0 v_k_28) (= .cse0 v_array_max_52) (= .cse0 v_array_min_50) (<= v_k_28 v_N_20))) InVars {A=v_A_43, N=v_N_20, k=v_k_28} OutVars{A=v_A_43, array_min=v_array_min_50, N=v_N_20, array_max=v_array_max_52, k=v_k_28} AuxVars[] AssignedVars[array_min, array_max] 11919#[L100]don't care [140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] 12101#[L100-1, $Ultimate##0]don't care [143] L100-1-->$Ultimate##0: Formula: (and (= 2 v_computeMin2Thread1of1ForFork3_thidvar0_2) (= 2 v_computeMin2Thread1of1ForFork3_thidvar1_2)) InVars {} OutVars{computeMin2Thread1of1ForFork3_thidvar0=v_computeMin2Thread1of1ForFork3_thidvar0_2, computeMin2Thread1of1ForFork3_thidvar1=v_computeMin2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[computeMin2Thread1of1ForFork3_thidvar0, computeMin2Thread1of1ForFork3_thidvar1] 12469#[$Ultimate##0, $Ultimate##0, L101]don't care [146] L101-->$Ultimate##0: Formula: (and (= v_computeMax1Thread1of1ForFork4_thidvar2_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar0_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar1_2 3)) InVars {} OutVars{computeMax1Thread1of1ForFork4_thidvar0=v_computeMax1Thread1of1ForFork4_thidvar0_2, computeMax1Thread1of1ForFork4_thidvar1=v_computeMax1Thread1of1ForFork4_thidvar1_2, computeMax1Thread1of1ForFork4_thidvar2=v_computeMax1Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[computeMax1Thread1of1ForFork4_thidvar0, computeMax1Thread1of1ForFork4_thidvar1, computeMax1Thread1of1ForFork4_thidvar2] 10801#[$Ultimate##0, $Ultimate##0, L102, $Ultimate##0]don't care [122] $Ultimate##0-->L61-1: Formula: (= v_i3_6 0) InVars {} OutVars{i3=v_i3_6} AuxVars[] AssignedVars[i3] 10807#[$Ultimate##0, $Ultimate##0, L61-1, L102]don't care [2023-10-12 17:12:40,180 INFO L750 eck$LassoCheckResult]: Loop: 10807#[$Ultimate##0, $Ultimate##0, L61-1, L102]don't care [157] L61-1-->L61-1: Formula: (and (= v_array_max_30 (let ((.cse0 (select v_A_25 v_i3_17))) (ite (< v_array_max_31 .cse0) .cse0 v_array_max_31))) (= (+ v_i3_17 1) v_i3_16) (< v_i3_17 v_k_18)) InVars {A=v_A_25, array_max=v_array_max_31, i3=v_i3_17, k=v_k_18} OutVars{A=v_A_25, array_max=v_array_max_30, i3=v_i3_16, k=v_k_18} AuxVars[] AssignedVars[array_max, i3] 10807#[$Ultimate##0, $Ultimate##0, L61-1, L102]don't care [2023-10-12 17:12:40,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:40,180 INFO L85 PathProgramCache]: Analyzing trace with hash 181628843, now seen corresponding path program 1 times [2023-10-12 17:12:40,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:40,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719944153] [2023-10-12 17:12:40,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:40,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:40,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:40,194 INFO L85 PathProgramCache]: Analyzing trace with hash 188, now seen corresponding path program 1 times [2023-10-12 17:12:40,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:40,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120735799] [2023-10-12 17:12:40,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:40,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:40,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1335526994, now seen corresponding path program 1 times [2023-10-12 17:12:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:40,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186811891] [2023-10-12 17:12:40,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:40,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:40,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:40,305 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:40,305 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:40,305 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:40,305 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:40,306 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:40,306 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,306 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:40,306 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:40,306 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration3_Lasso [2023-10-12 17:12:40,306 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:40,306 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:40,307 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:12:40,309 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:12:40,311 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:12:40,314 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:12:40,345 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:12:40,348 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:12:40,350 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:12:40,459 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:40,460 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:40,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:40,461 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:12:40,464 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:12:40,464 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:12:40,470 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:40,470 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:40,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:40,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:40,472 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:40,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:40,490 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:40,495 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:12:40,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:40,497 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:12:40,509 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:12:40,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:12:40,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:40,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:40,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:40,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:40,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:40,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:40,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:40,535 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:12:40,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:40,545 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:40,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-10-12 17:12:40,549 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:12:40,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:40,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:40,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:40,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:40,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:40,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:40,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:40,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:40,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:40,578 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:12:40,580 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:12:40,582 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:12:40,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:40,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:40,588 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-10-12 17:12:40,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:40,617 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-10-12 17:12:40,617 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-10-12 17:12:40,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:40,661 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2023-10-12 17:12:40,664 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:12:40,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:40,665 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:12:40,667 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:12:40,668 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:12:40,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:40,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:40,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:40,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:40,677 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:40,677 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:40,740 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:40,744 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:12:40,744 INFO L444 ModelExtractionUtils]: 6 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-10-12 17:12:40,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:40,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:40,918 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:12:40,920 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:12:40,966 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:41,002 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:41,002 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:41,002 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(i3, k) = -1*i3 + 1*k Supporting invariants [] [2023-10-12 17:12:41,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2023-10-12 17:12:41,006 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:41,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:41,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:41,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:41,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:41,040 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:41,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:41,040 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:12:41,040 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:12:41,040 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2326 states and 15296 transitions. cyclomatic complexity: 13471 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:41,167 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2326 states and 15296 transitions. cyclomatic complexity: 13471. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 6934 states and 46139 transitions. Complement of second has 4 states. [2023-10-12 17:12:41,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:41,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2023-10-12 17:12:41,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 5 letters. Loop has 1 letters. [2023-10-12 17:12:41,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:41,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:12:41,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:41,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 5 letters. Loop has 2 letters. [2023-10-12 17:12:41,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:41,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6934 states and 46139 transitions. [2023-10-12 17:12:41,258 INFO L131 ngComponentsAnalysis]: Automaton has 190 accepting balls. 559 [2023-10-12 17:12:41,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6934 states to 5357 states and 35165 transitions. [2023-10-12 17:12:41,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1620 [2023-10-12 17:12:41,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2052 [2023-10-12 17:12:41,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5357 states and 35165 transitions. [2023-10-12 17:12:41,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:41,434 INFO L219 hiAutomatonCegarLoop]: Abstraction has 5357 states and 35165 transitions. [2023-10-12 17:12:41,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2023-10-12 17:12:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5357 states and 35165 transitions. [2023-10-12 17:12:41,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5357 to 4126. [2023-10-12 17:12:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4126 states, 4126 states have (on average 6.719583131362094) internal successors, (27725), 4125 states have internal predecessors, (27725), 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:12:41,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4126 states to 4126 states and 27725 transitions. [2023-10-12 17:12:41,582 INFO L241 hiAutomatonCegarLoop]: Abstraction has 4126 states and 27725 transitions. [2023-10-12 17:12:41,582 INFO L430 stractBuchiCegarLoop]: Abstraction has 4126 states and 27725 transitions. [2023-10-12 17:12:41,582 INFO L337 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-10-12 17:12:41,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4126 states and 27725 transitions. [2023-10-12 17:12:41,606 INFO L131 ngComponentsAnalysis]: Automaton has 190 accepting balls. 559 [2023-10-12 17:12:41,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:41,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:41,607 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:12:41,607 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2023-10-12 17:12:41,607 INFO L748 eck$LassoCheckResult]: Stem: 23917#[$Ultimate##0]don't care [161] $Ultimate##0-->L100: Formula: (let ((.cse0 (select v_A_43 0))) (and (<= 0 v_k_28) (= .cse0 v_array_max_52) (= .cse0 v_array_min_50) (<= v_k_28 v_N_20))) InVars {A=v_A_43, N=v_N_20, k=v_k_28} OutVars{A=v_A_43, array_min=v_array_min_50, N=v_N_20, array_max=v_array_max_52, k=v_k_28} AuxVars[] AssignedVars[array_min, array_max] 23919#[L100]don't care [140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] 24167#[L100-1, $Ultimate##0]don't care [143] L100-1-->$Ultimate##0: Formula: (and (= 2 v_computeMin2Thread1of1ForFork3_thidvar0_2) (= 2 v_computeMin2Thread1of1ForFork3_thidvar1_2)) InVars {} OutVars{computeMin2Thread1of1ForFork3_thidvar0=v_computeMin2Thread1of1ForFork3_thidvar0_2, computeMin2Thread1of1ForFork3_thidvar1=v_computeMin2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[computeMin2Thread1of1ForFork3_thidvar0, computeMin2Thread1of1ForFork3_thidvar1] 24679#[$Ultimate##0, $Ultimate##0, L101]don't care [146] L101-->$Ultimate##0: Formula: (and (= v_computeMax1Thread1of1ForFork4_thidvar2_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar0_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar1_2 3)) InVars {} OutVars{computeMax1Thread1of1ForFork4_thidvar0=v_computeMax1Thread1of1ForFork4_thidvar0_2, computeMax1Thread1of1ForFork4_thidvar1=v_computeMax1Thread1of1ForFork4_thidvar1_2, computeMax1Thread1of1ForFork4_thidvar2=v_computeMax1Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[computeMax1Thread1of1ForFork4_thidvar0, computeMax1Thread1of1ForFork4_thidvar1, computeMax1Thread1of1ForFork4_thidvar2] 22519#[$Ultimate##0, $Ultimate##0, L102, $Ultimate##0]don't care [134] L102-->$Ultimate##0: Formula: (and (= v_computeMax2Thread1of1ForFork0_thidvar1_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar3_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar2_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar0_2 4)) InVars {} OutVars{computeMax2Thread1of1ForFork0_thidvar3=v_computeMax2Thread1of1ForFork0_thidvar3_2, computeMax2Thread1of1ForFork0_thidvar2=v_computeMax2Thread1of1ForFork0_thidvar2_2, computeMax2Thread1of1ForFork0_thidvar1=v_computeMax2Thread1of1ForFork0_thidvar1_2, computeMax2Thread1of1ForFork0_thidvar0=v_computeMax2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMax2Thread1of1ForFork0_thidvar3, computeMax2Thread1of1ForFork0_thidvar2, computeMax2Thread1of1ForFork0_thidvar1, computeMax2Thread1of1ForFork0_thidvar0] 22523#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L103, $Ultimate##0]don't care [117] $Ultimate##0-->L74-1: Formula: (= v_i4_1 (+ v_k_5 1)) InVars {k=v_k_5} OutVars{k=v_k_5, i4=v_i4_1} AuxVars[] AssignedVars[i4] 24471#[L74-1, $Ultimate##0, $Ultimate##0, L103, $Ultimate##0]don't care [2023-10-12 17:12:41,607 INFO L750 eck$LassoCheckResult]: Loop: 24471#[L74-1, $Ultimate##0, $Ultimate##0, L103, $Ultimate##0]don't care [152] L74-1-->L74-1: Formula: (and (= v_array_max_18 (let ((.cse0 (select v_A_15 v_i4_15))) (ite (< v_array_max_19 .cse0) .cse0 v_array_max_19))) (= v_i4_14 (+ v_i4_15 1)) (< v_i4_15 v_N_8)) InVars {A=v_A_15, N=v_N_8, array_max=v_array_max_19, i4=v_i4_15} OutVars{A=v_A_15, N=v_N_8, array_max=v_array_max_18, i4=v_i4_14} AuxVars[] AssignedVars[array_max, i4] 24471#[L74-1, $Ultimate##0, $Ultimate##0, L103, $Ultimate##0]don't care [2023-10-12 17:12:41,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:41,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1335527326, now seen corresponding path program 1 times [2023-10-12 17:12:41,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:41,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594066949] [2023-10-12 17:12:41,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:41,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:41,611 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:41,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:41,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:41,615 INFO L85 PathProgramCache]: Analyzing trace with hash 183, now seen corresponding path program 1 times [2023-10-12 17:12:41,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:41,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067500122] [2023-10-12 17:12:41,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:41,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:41,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:41,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:41,619 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:41,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1548325702, now seen corresponding path program 1 times [2023-10-12 17:12:41,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:41,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226394637] [2023-10-12 17:12:41,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:41,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:41,623 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:41,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:41,731 INFO L210 LassoAnalysis]: Preferences: [2023-10-12 17:12:41,731 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-10-12 17:12:41,731 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-10-12 17:12:41,731 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-10-12 17:12:41,731 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-10-12 17:12:41,731 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:41,731 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-10-12 17:12:41,731 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-10-12 17:12:41,731 INFO L133 ssoRankerPreferences]: Filename of dumped script: min-max-split-sample.bpl_BEv2_Iteration4_Lasso [2023-10-12 17:12:41,731 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-10-12 17:12:41,731 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-10-12 17:12:41,733 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:12:41,735 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:12:41,737 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:12:41,739 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:12:41,740 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:12:41,742 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:12:41,743 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:12:41,745 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:12:41,747 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:12:41,749 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:12:41,750 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:12:41,905 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-10-12 17:12:41,905 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-10-12 17:12:41,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:41,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:41,921 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:41,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-10-12 17:12:41,925 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:12:41,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:41,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:41,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:41,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:41,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:41,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:41,943 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:41,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2023-10-12 17:12:41,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:41,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:41,947 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:41,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-10-12 17:12:41,954 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:12:41,960 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:41,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:41,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:41,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:41,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:41,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:41,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:41,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2023-10-12 17:12:41,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:41,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:41,979 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:41,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-10-12 17:12:41,982 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:12:41,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:41,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:41,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:41,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:41,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:41,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:41,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:41,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:41,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:41,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:41,998 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:42,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-10-12 17:12:42,004 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:12:42,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:42,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:42,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:42,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:42,037 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:42,037 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:42,040 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:42,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:42,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:42,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:42,201 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:42,208 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:12:42,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:42,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:42,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:42,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:42,223 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:42,223 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:42,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-10-12 17:12:42,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:42,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:42,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:42,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:42,274 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:42,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-10-12 17:12:42,277 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:12:42,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:42,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:42,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:42,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:42,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:42,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:42,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:42,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:42,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:42,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:42,353 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:42,391 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:12:42,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:42,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:42,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:42,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:42,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:42,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:42,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-10-12 17:12:42,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:42,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:42,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:42,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:42,426 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:42,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2023-10-12 17:12:42,430 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:12:42,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:42,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:42,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:42,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:42,453 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:42,453 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:42,468 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:42,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:42,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:42,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:42,471 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:42,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-10-12 17:12:42,485 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:12:42,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:42,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:42,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:42,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:42,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:42,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:42,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:42,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:42,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:42,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:42,524 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-10-12 17:12:42,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-10-12 17:12:42,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-10-12 17:12:42,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:42,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:42,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:42,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:42,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:42,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:42,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-10-12 17:12:42,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:42,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:42,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:42,562 INFO L229 MonitoredProcess]: Starting monitored process 27 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:12:42,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-10-12 17:12:42,622 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:12:42,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-10-12 17:12:42,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-10-12 17:12:42,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-10-12 17:12:42,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-10-12 17:12:42,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-10-12 17:12:42,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-10-12 17:12:42,639 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-10-12 17:12:42,669 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2023-10-12 17:12:42,669 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2023-10-12 17:12:42,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-10-12 17:12:42,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-10-12 17:12:42,675 INFO L229 MonitoredProcess]: Starting monitored process 28 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:12:42,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-10-12 17:12:42,679 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-10-12 17:12:42,694 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2023-10-12 17:12:42,694 INFO L513 LassoAnalysis]: Proved termination. [2023-10-12 17:12:42,694 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i4) = 1*N - 1*i4 Supporting invariants [] [2023-10-12 17:12:42,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:42,701 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-10-12 17:12:42,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:42,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-10-12 17:12:42,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-10-12 17:12:42,734 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2023-10-12 17:12:42,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-10-12 17:12:42,735 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:12:42,735 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:12:42,735 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4126 states and 27725 transitions. cyclomatic complexity: 24284 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:43,072 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4126 states and 27725 transitions. cyclomatic complexity: 24284. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 11722 states and 78589 transitions. Complement of second has 4 states. [2023-10-12 17:12:43,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2023-10-12 17:12:43,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-10-12 17:12:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2023-10-12 17:12:43,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 6 letters. Loop has 1 letters. [2023-10-12 17:12:43,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:43,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 7 letters. Loop has 1 letters. [2023-10-12 17:12:43,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:43,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 67 transitions. Stem has 6 letters. Loop has 2 letters. [2023-10-12 17:12:43,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-10-12 17:12:43,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11722 states and 78589 transitions. [2023-10-12 17:12:43,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-10-12 17:12:43,438 INFO L131 ngComponentsAnalysis]: Automaton has 123 accepting balls. 492 [2023-10-12 17:12:43,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11722 states to 8193 states and 54323 transitions. [2023-10-12 17:12:43,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1947 [2023-10-12 17:12:43,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2313 [2023-10-12 17:12:43,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8193 states and 54323 transitions. [2023-10-12 17:12:43,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-10-12 17:12:43,656 INFO L219 hiAutomatonCegarLoop]: Abstraction has 8193 states and 54323 transitions. [2023-10-12 17:12:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8193 states and 54323 transitions. [2023-10-12 17:12:43,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8193 to 6408. [2023-10-12 17:12:43,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6408 states, 6408 states have (on average 6.752965043695381) internal successors, (43273), 6407 states have internal predecessors, (43273), 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:12:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6408 states to 6408 states and 43273 transitions. [2023-10-12 17:12:44,117 INFO L241 hiAutomatonCegarLoop]: Abstraction has 6408 states and 43273 transitions. [2023-10-12 17:12:44,117 INFO L430 stractBuchiCegarLoop]: Abstraction has 6408 states and 43273 transitions. [2023-10-12 17:12:44,117 INFO L337 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-10-12 17:12:44,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6408 states and 43273 transitions. [2023-10-12 17:12:44,213 INFO L131 ngComponentsAnalysis]: Automaton has 123 accepting balls. 492 [2023-10-12 17:12:44,213 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-10-12 17:12:44,213 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-10-12 17:12:44,214 INFO L149 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-10-12 17:12:44,214 INFO L150 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-10-12 17:12:44,214 INFO L748 eck$LassoCheckResult]: Stem: 43838#[$Ultimate##0]don't care [161] $Ultimate##0-->L100: Formula: (let ((.cse0 (select v_A_43 0))) (and (<= 0 v_k_28) (= .cse0 v_array_max_52) (= .cse0 v_array_min_50) (<= v_k_28 v_N_20))) InVars {A=v_A_43, N=v_N_20, k=v_k_28} OutVars{A=v_A_43, array_min=v_array_min_50, N=v_N_20, array_max=v_array_max_52, k=v_k_28} AuxVars[] AssignedVars[array_min, array_max] 43840#[L100]don't care [140] L100-->$Ultimate##0: Formula: (= v_computeMin1Thread1of1ForFork2_thidvar0_2 1) InVars {} OutVars{computeMin1Thread1of1ForFork2_thidvar0=v_computeMin1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[computeMin1Thread1of1ForFork2_thidvar0] 44106#[L100-1, $Ultimate##0]don't care [143] L100-1-->$Ultimate##0: Formula: (and (= 2 v_computeMin2Thread1of1ForFork3_thidvar0_2) (= 2 v_computeMin2Thread1of1ForFork3_thidvar1_2)) InVars {} OutVars{computeMin2Thread1of1ForFork3_thidvar0=v_computeMin2Thread1of1ForFork3_thidvar0_2, computeMin2Thread1of1ForFork3_thidvar1=v_computeMin2Thread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[computeMin2Thread1of1ForFork3_thidvar0, computeMin2Thread1of1ForFork3_thidvar1] 44700#[$Ultimate##0, $Ultimate##0, L101]don't care [146] L101-->$Ultimate##0: Formula: (and (= v_computeMax1Thread1of1ForFork4_thidvar2_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar0_2 3) (= v_computeMax1Thread1of1ForFork4_thidvar1_2 3)) InVars {} OutVars{computeMax1Thread1of1ForFork4_thidvar0=v_computeMax1Thread1of1ForFork4_thidvar0_2, computeMax1Thread1of1ForFork4_thidvar1=v_computeMax1Thread1of1ForFork4_thidvar1_2, computeMax1Thread1of1ForFork4_thidvar2=v_computeMax1Thread1of1ForFork4_thidvar2_2} AuxVars[] AssignedVars[computeMax1Thread1of1ForFork4_thidvar0, computeMax1Thread1of1ForFork4_thidvar1, computeMax1Thread1of1ForFork4_thidvar2] 42362#[$Ultimate##0, $Ultimate##0, L102, $Ultimate##0]don't care [134] L102-->$Ultimate##0: Formula: (and (= v_computeMax2Thread1of1ForFork0_thidvar1_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar3_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar2_2 4) (= v_computeMax2Thread1of1ForFork0_thidvar0_2 4)) InVars {} OutVars{computeMax2Thread1of1ForFork0_thidvar3=v_computeMax2Thread1of1ForFork0_thidvar3_2, computeMax2Thread1of1ForFork0_thidvar2=v_computeMax2Thread1of1ForFork0_thidvar2_2, computeMax2Thread1of1ForFork0_thidvar1=v_computeMax2Thread1of1ForFork0_thidvar1_2, computeMax2Thread1of1ForFork0_thidvar0=v_computeMax2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[computeMax2Thread1of1ForFork0_thidvar3, computeMax2Thread1of1ForFork0_thidvar2, computeMax2Thread1of1ForFork0_thidvar1, computeMax2Thread1of1ForFork0_thidvar0] 42366#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L103, $Ultimate##0]don't care [137] L103-->L84: Formula: (and (= 5 v_sampleThread1of1ForFork1_thidvar4_2) (= 5 v_sampleThread1of1ForFork1_thidvar1_2) (= 5 v_sampleThread1of1ForFork1_thidvar0_2) (= 5 v_sampleThread1of1ForFork1_thidvar3_2) (= 5 v_sampleThread1of1ForFork1_thidvar2_2)) InVars {} OutVars{sampleThread1of1ForFork1_thidvar1=v_sampleThread1of1ForFork1_thidvar1_2, sampleThread1of1ForFork1_thidvar0=v_sampleThread1of1ForFork1_thidvar0_2, sampleThread1of1ForFork1_thidvar3=v_sampleThread1of1ForFork1_thidvar3_2, sampleThread1of1ForFork1_thidvar2=v_sampleThread1of1ForFork1_thidvar2_2, sampleThread1of1ForFork1_thidvar4=v_sampleThread1of1ForFork1_thidvar4_2} AuxVars[] AssignedVars[sampleThread1of1ForFork1_thidvar1, sampleThread1of1ForFork1_thidvar0, sampleThread1of1ForFork1_thidvar3, sampleThread1of1ForFork1_thidvar2, sampleThread1of1ForFork1_thidvar4] 42828#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, L84, L104]don't care [2023-10-12 17:12:44,214 INFO L750 eck$LassoCheckResult]: Loop: 42828#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, L84, L104]don't care [128] L84-->L86: Formula: (= v_min_samples_1 (store v_min_samples_2 (+ (- 1) v_i1_7) v_array_min_8)) InVars {min_samples=v_min_samples_2, i1=v_i1_7, array_min=v_array_min_8} OutVars{min_samples=v_min_samples_1, i1=v_i1_7, array_min=v_array_min_8} AuxVars[] AssignedVars[min_samples] 43492#[$Ultimate##0, $Ultimate##0, L86, $Ultimate##0, $Ultimate##0, L104]don't care [129] L86-->L87: Formula: (= v_min_samples_3 (store v_min_samples_4 (+ (- 1) v_i2_7) v_array_min_9)) InVars {min_samples=v_min_samples_4, i2=v_i2_7, array_min=v_array_min_9} OutVars{min_samples=v_min_samples_3, i2=v_i2_7, array_min=v_array_min_9} AuxVars[] AssignedVars[min_samples] 41728#[$Ultimate##0, $Ultimate##0, $Ultimate##0, L87, $Ultimate##0, L104]don't care [130] L87-->L88: Formula: (= (store v_max_samples_2 (+ (- 1) v_i3_7) v_array_max_8) v_max_samples_1) InVars {array_max=v_array_max_8, max_samples=v_max_samples_2, i3=v_i3_7} OutVars{array_max=v_array_max_8, max_samples=v_max_samples_1, i3=v_i3_7} AuxVars[] AssignedVars[max_samples] 41732#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, L88, L104]don't care [131] L88-->L84: Formula: (= (store v_max_samples_4 (+ (- 1) v_i4_7) v_array_max_9) v_max_samples_3) InVars {array_max=v_array_max_9, max_samples=v_max_samples_4, i4=v_i4_7} OutVars{array_max=v_array_max_9, max_samples=v_max_samples_3, i4=v_i4_7} AuxVars[] AssignedVars[max_samples] 42828#[$Ultimate##0, $Ultimate##0, $Ultimate##0, $Ultimate##0, L84, L104]don't care [2023-10-12 17:12:44,215 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:44,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1335527346, now seen corresponding path program 1 times [2023-10-12 17:12:44,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:44,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550000184] [2023-10-12 17:12:44,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:44,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:44,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:44,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:44,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:44,255 INFO L85 PathProgramCache]: Analyzing trace with hash 4864899, now seen corresponding path program 1 times [2023-10-12 17:12:44,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:44,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676545307] [2023-10-12 17:12:44,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:44,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:44,264 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:44,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:44,267 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-10-12 17:12:44,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1795654324, now seen corresponding path program 1 times [2023-10-12 17:12:44,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-10-12 17:12:44,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560258805] [2023-10-12 17:12:44,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-10-12 17:12:44,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-10-12 17:12:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:44,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:44,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-10-12 17:12:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:44,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-10-12 17:12:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-10-12 17:12:44,462 INFO L201 PluginConnector]: Adding new model min-max-split-sample.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 05:12:44 BoogieIcfgContainer [2023-10-12 17:12:44,462 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-10-12 17:12:44,462 INFO L158 Benchmark]: Toolchain (without parser) took 7575.21ms. Allocated memory was 217.1MB in the beginning and 759.2MB in the end (delta: 542.1MB). Free memory was 167.0MB in the beginning and 451.2MB in the end (delta: -284.2MB). Peak memory consumption was 257.3MB. Max. memory is 8.0GB. [2023-10-12 17:12:44,462 INFO L158 Benchmark]: Boogie PL CUP Parser took 3.61ms. Allocated memory is still 217.1MB. Free memory is still 168.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-10-12 17:12:44,463 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.26ms. Allocated memory is still 217.1MB. Free memory was 167.0MB in the beginning and 165.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:44,463 INFO L158 Benchmark]: Boogie Preprocessor took 43.10ms. Allocated memory is still 217.1MB. Free memory was 165.4MB in the beginning and 164.3MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-10-12 17:12:44,463 INFO L158 Benchmark]: RCFGBuilder took 258.41ms. Allocated memory is still 217.1MB. Free memory was 164.1MB in the beginning and 179.3MB in the end (delta: -15.2MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2023-10-12 17:12:44,463 INFO L158 Benchmark]: BuchiAutomizer took 7222.17ms. Allocated memory was 217.1MB in the beginning and 759.2MB in the end (delta: 542.1MB). Free memory was 179.1MB in the beginning and 451.2MB in the end (delta: -272.1MB). Peak memory consumption was 269.8MB. Max. memory is 8.0GB. [2023-10-12 17:12:44,464 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 3.61ms. Allocated memory is still 217.1MB. Free memory is still 168.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.26ms. Allocated memory is still 217.1MB. Free memory was 167.0MB in the beginning and 165.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.10ms. Allocated memory is still 217.1MB. Free memory was 165.4MB in the beginning and 164.3MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 258.41ms. Allocated memory is still 217.1MB. Free memory was 164.1MB in the beginning and 179.3MB in the end (delta: -15.2MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 7222.17ms. Allocated memory was 217.1MB in the beginning and 759.2MB in the end (delta: 542.1MB). Free memory was 179.1MB in the beginning and 451.2MB in the end (delta: -272.1MB). Peak memory consumption was 269.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function k + -1 * i1 and consists of 3 locations. One deterministic module has affine ranking function -1 * i2 + N and consists of 3 locations. One deterministic module has affine ranking function -1 * i3 + k and consists of 3 locations. One deterministic module has affine ranking function N + -1 * i4 and consists of 3 locations. The remainder module has 6408 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.9s AutomataMinimizationTime, 4 MinimizatonAttempts, 4071 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 1.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: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 190 IncrementalHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 64 mSDtfsCounter, 190 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital66 mio100 ax100 hnf100 lsp108 ukn59 mio100 lsp56 div100 bol100 ite100 ukn100 eq176 hnf94 smp100 dnf146 smp64 tf100 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 48ms VariablesStem: 4 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 84]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L95] 0 assume 0 <= k && k <= N; [L97] 0 array_min := A[0]; [L98] 0 array_max := A[0]; VAL [N=0, array_max=9, array_min=9, k=0] [L100] FORK 0 fork 1 computeMin1(); VAL [N=0, array_max=9, array_min=9, k=0] [L101] FORK 0 fork 2, 2 computeMin2(); VAL [N=0, array_max=9, array_min=9, k=0] [L102] FORK 0 fork 3, 3, 3 computeMax1(); VAL [N=0, array_max=9, array_min=9, k=0] [L103] FORK 0 fork 4, 4, 4, 4 computeMax2(); VAL [N=0, array_max=9, array_min=9, k=0] [L104] FORK 0 fork 5, 5, 5, 5, 5 sample(); VAL [N=0, array_max=9, array_min=9, k=0] Loop: [L85] min_samples[i1 - 1] := array_min; [L86] min_samples[i2 - 1] := array_min; [L87] max_samples[i3 - 1] := array_max; [L88] max_samples[i4 - 1] := array_max; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 84]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L95] 0 assume 0 <= k && k <= N; [L97] 0 array_min := A[0]; [L98] 0 array_max := A[0]; VAL [N=0, array_max=9, array_min=9, k=0] [L100] FORK 0 fork 1 computeMin1(); VAL [N=0, array_max=9, array_min=9, k=0] [L101] FORK 0 fork 2, 2 computeMin2(); VAL [N=0, array_max=9, array_min=9, k=0] [L102] FORK 0 fork 3, 3, 3 computeMax1(); VAL [N=0, array_max=9, array_min=9, k=0] [L103] FORK 0 fork 4, 4, 4, 4 computeMax2(); VAL [N=0, array_max=9, array_min=9, k=0] [L104] FORK 0 fork 5, 5, 5, 5, 5 sample(); VAL [N=0, array_max=9, array_min=9, k=0] Loop: [L85] min_samples[i1 - 1] := array_min; [L86] min_samples[i2 - 1] := array_min; [L87] max_samples[i3 - 1] := array_max; [L88] max_samples[i4 - 1] := array_max; End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 51 PlacesBefore, 40 PlacesAfterwards, 40 TransitionsBefore, 29 TransitionsAfterwards, 730 CoEnabledTransitionPairs, 2 FixpointIterations, 2 TrivialSequentialCompositions, 9 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 767 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 563, independent: 545, independent conditional: 0, independent unconditional: 545, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 366, independent: 354, independent conditional: 0, independent unconditional: 354, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 366, independent: 354, independent conditional: 0, independent unconditional: 354, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 563, independent: 191, independent conditional: 0, independent unconditional: 191, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 366, unknown conditional: 0, unknown unconditional: 366] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 RESULT: Ultimate proved your program to be incorrect! [2023-10-12 17:12:44,482 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...